Provide the EIG algorithm for the Byzantine agreement with n=7, t=2. Provide the local trees for Node 1, Node 2, Node
Posted: Fri Jul 01, 2022 5:46 am
Provide the EIG algorithm for the Byzantineagreement with n=7, t=2.
Provide the local trees for Node 1, Node 2, Node 6, Node 7,where Node 6 and Node 7 are dishonest. The initialvalues for Node1 to Node 5 are, 1, 0, 1,0,1. In the firstround, Node 6 and Node 7 send 0 to Node 2 and Node 4; but Node 6 and Node 7 send 1 to Node 1, Node 3, andNode5.
In the second and the third rounds, Node 6 and Node 7 actnormally.
Provide the local trees for Node 1, Node 2, Node 6, Node 7,where Node 6 and Node 7 are dishonest. The initialvalues for Node1 to Node 5 are, 1, 0, 1,0,1. In the firstround, Node 6 and Node 7 send 0 to Node 2 and Node 4; but Node 6 and Node 7 send 1 to Node 1, Node 3, andNode5.
In the second and the third rounds, Node 6 and Node 7 actnormally.