#algorithm #systemic-issue


The Byzantine generals problem is a riddle about coordination in a network where agents are not trustworthy. It assumes that communication between agents is working, but some of the agents might provide misleading information, in which case agreement can be achieved only if the number of good actors is at least $3n + 1$ actors are required, with $n$ rhe number of traitors.