Prove the early deciding consensus algorithm described in Fig. 11.3. Let us consider the unbeatable binary consensus algorithm described in Fig. 11.7. • Let lgr i be the value of the graph lgi at the...

Prove the early deciding consensus algorithm described in Fig. 11.3.

Let us consider the unbeatable binary consensus algorithm described in Fig. 11.7.

• Let lgr

i be the value of the graph lgi at the end of round r. Prove (by induction) that lgr

i

captures the causal past of pi at the end of round r (round invariant of the algorithm in

Fig. 11.7).

• With the help of the previous round invariant, prove the CC-agreement property of the

unbeatable algorithm described in Fig. 11.7.