mirrors/tendermint
1
0
Fork 0
mirror of https://github.com/tendermint/tendermint.git synced 2026-01-06 21:36:26 +00:00
Code Issues Packages Projects Releases Wiki Activity

describe valset sorting according to v0.34 requirements (#169)

Browse Source
This commit is contained in:
Andrey Kuprianov
2020-09-25 09:22:14 +02:00
committed by GitHub
parent 80747a0872
commit 109a73f672
1 changed files with 5 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
spec/core/data_structures.md
View File

@@ -374,7 +374,8 @@ block.ValidatorsHash == MerkleRoot(state.Validators)
MerkleRoot of the current validator set that is committing the block.
This can be used to validate the `LastCommit` included in the next block.
Note the validators are sorted by their voting power before computing the MerkleRoot.
Note that before computing the MerkleRoot the validators are sorted
first by voting power (descending), then by address (ascending).
### NextValidatorsHash
@@ -385,7 +386,9 @@ block.NextValidatorsHash == MerkleRoot(state.NextValidators)
MerkleRoot of the next validator set that will be the validator set that commits the next block.
This is included so that the current validator set gets a chance to sign the
next validator sets Merkle root.
Note the validators are sorted by their voting power before computing the MerkleRoot.
Note that before computing the MerkleRoot the validators are sorted
first by voting power (descending), then by address (ascending).
### ConsensusHash