You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Tendermint receives a list of validators from the Applycation Layer, selects a proposer from among them, proposer propose block, and the validators vote to block. The first block is also treated as a list of validators delivered by the Application Layer.
In the application layer, validators can be added through genTx stored in the config in the first block, and then added through Create Validator. Tendermint can elect a proposer by passing the list of validators added at BeginBlock.
Then, in the consensus algorithm that selects only a part of the VRF, it is important to obtain the hash, the input value of the VRF. From the second block, not the first block, the previous block is not a problem because the hash can be obtained from the stored proof. In this case, when generating the first block, we can solve this issue as deliver the hash that anyone can know.
I suggest to use the result of hashing the genesis struct as the hash of the first block that anyone can know. Different chains will have different genesis struct, so. he same hash is less likely to be found, and the same genesis struct is used for the same chain.
We need to check how to elect genesis propoer and validator set using VRF election.
Because it is difference with tendermint's way.
The text was updated successfully, but these errors were encountered: