Byzantine Generals Problem
Also known as: BFT Problem, Distributed Agreement Problem, Malicious Node Coordination
A game theory problem that illustrates the challenge of achieving consensus in distributed systems with unreliable participants.
The Byzantine Generals Problem is a classic dilemma in computer science and game theory that describes how parties in a distributed system can agree on a coordinated strategy despite the presence of malicious actors or faulty communication. It was originally formulated as a metaphor for generals planning a battle while some may be traitors. In blockchain, solving this problem is critical for designing secure consensus algorithms. Protocols like PBFT, Tendermint, and many Proof of Stake systems implement Byzantine Fault Tolerance (BFT) to ensure correct network behavior even if some nodes act maliciously.