Byzantine Generals Problem

The Byzantine Generals Problem is a thought experiment describing how independent parties can agree on a common plan when messages may be lost or forged and some parties may be traitors. Leslie Lamport, Robert Shostak, and Marshall Pease formalized it in a 1982 paper, proving that agreement requires more than two thirds of participants to be honest.

Why it matters

Digital money is, at bottom, a Byzantine Generals Problem: every participant must agree on a single history of transactions even though some participants would profit from lying about it. The double spend attack, in which the same coin is sent to two recipients, is exactly the kind of contradictory message the generals fear. Before 2008, every practical solution assumed a closed group with known members, which meant a gatekeeper, which meant trust in an institution.

In the gold vs bitcoin debate

Gold sidesteps the problem entirely: a coin in hand cannot be double spent, because physics enforces uniqueness. Bitcoin was the first system to solve the problem in an open network, using proof of work to make the honest chain the one backed by the most expended energy. Supporters frame this as the digital reinvention of gold's unforgeability. Skeptics reply that the solution costs real electricity, to which bitcoiners answer that gold mining was never free either.