cerc-io/lotus
16
0
Fork 0
Code Issues Pull Requests Packages Projects Releases 27 Wiki Activity

change with @Kubuxu's comment

Browse Source
This commit is contained in:
Steven Li 2019-11-01 08:56:15 +08:00 committed by GitHub
parent 85854578d1
commit 9a5adfed3a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
chain/types/blockheader.go
View File

@ -170,12 +170,13 @@ func PowerCmp(eproof ElectionProof, mpow, totpow BigInt) bool {
max(h) == 2^256-1 max(h) == 2^256-1
which in terms of integer math means: which in terms of integer math means:
(h(vrfout) + 1) * totalPower <= e * minerPower * 2^256 (h(vrfout) + 1) * totalPower <= e * minerPower * 2^256
in 2^256 space, it is equivalent to:
h(vrfout) * totalPower < e * minerPower * 2^256
*/ */
h := sha256.Sum256(eproof) h := sha256.Sum256(eproof)
lhs := BigFromBytes(h[:]).Int lhs := BigFromBytes(h[:]).Int
lhs = lhs.Add(lhs, NewInt(1).Int)
lhs = lhs.Mul(lhs, totpow.Int) lhs = lhs.Mul(lhs, totpow.Int)
// rhs = minerPower * 2^256 // rhs = minerPower * 2^256
@ -183,8 +184,8 @@ func PowerCmp(eproof ElectionProof, mpow, totpow BigInt) bool {
rhs := new(big.Int).Lsh(mpow.Int, 256) rhs := new(big.Int).Lsh(mpow.Int, 256)
rhs = rhs.Mul(rhs, blocksPerEpoch.Int) rhs = rhs.Mul(rhs, blocksPerEpoch.Int)
// return true if lhs is less than or equal to rhs // h(vrfout) * totalPower < e * minerPower * 2^256?
return lhs.Cmp(rhs) <= 0 return lhs.Cmp(rhs) == -1
} }
func (t *Ticket) Equals(ot *Ticket) bool { func (t *Ticket) Equals(ot *Ticket) bool {