A simple Byzantine Generals protocol
The Byzantine Generals Problem is a classical problem in distributed computing that models a systems resiliency against arbitrary adversarial faults. The existing solutions to this problem tend to be quite intricate and many of them employ some form of recursion. This paper gives a new algorithm that solves the problem in an exceptionally simple straight-line program.
byzantine generals problem distributed algorithm fault tolerant