Lamport's Byzantine Generals algorithm in Python
Introduction
Imagine a group of generals of the Byzantine army camped with their troops around an enemy city. The generals must agree upon a common battle plan: either attack or retreat. However, some of them may be traitors! The non-traitor generals succeed only if all of them choose the same action — either everyone attacks or everyone retreats; if even one non-traitor general does something different, the battle is lost.
In their seminal paper The Byzantine Generals Problem Lamport, Shostak a...
Read more at bytepawn.com