Implement BFT validator cycle
Where BFT will choose smallest person to validate block
Timestamp (3s) or 5s for node to propagane each other hash of current as a proof of randomnesss
H = hash of (Heigh + sig) where (sig is a signature of Height)
Who was lowest H will be block proposer
Implement BFT validator cycle
Where BFT will choose smallest person to validate block
Timestamp (3s) or 5s for node to propagane each other hash of current as a proof of randomnesss
H = hash of (Heigh + sig) where (sig is a signature of Height)
Who was lowest H will be block proposer