Byzantine Generals’ Problem

The Byzantine Generals’ Problem is a thought experiment from computer science that describes one of the hardest challenges in building distributed systems: how can a group of participants who cannot fully trust each other still reach a reliable agreement? It was formally described by Leslie Lamport, Robert Shostak, and Marshall Pease in 1982, and became the intellectual foundation for much of how blockchains were later designed.

The story goes like this: several army generals are surrounding a city, communicating only by messenger. Some generals might be traitors. The loyal generals need to agree on a single plan — attack together or retreat together — because acting inconsistently would be catastrophic. Bitcoin, invented in 2008 by Satoshi Nakamoto, was the first practical solution to this problem at internet scale. It solved it using Proof of Work — a mechanism where agreeing on the truth requires spending real computational effort, making cheating prohibitively expensive rather than just socially forbidden.

Example: Think of a group of friends trying to decide where to meet for dinner over text, but one friend keeps telling different people different things to stir up chaos. The Byzantine Generals’ Problem asks how the honest friends can still agree on the right location even when they know someone among them might be lying.