Mathematical Results Recap

• a ballot number (unique identifier),
• a decree (proposed value),
• and votes from other nodes in the system.

• once a value is chosen, all future ballots will agree on that value,
• consistency (safety) is maintained across the distributed system.

Theorems One and Two formally prove that if the constraints are upheld, the protocol is safe. Message passing between nodes, combined with ballot management, guarantees agreement even if multiple ballots are active or nodes fail.

Theorems One and Two formally prove that if the constraints are upheld, the protocol is safe. Message passing between nodes, combined with ballot management, guarantees agreement even if multiple ballots are active or nodes fail.