Byzantine fault tolerance

Byzantine fault tolerance is the ability of a network to keep working correctly even when some of its participants are not just broken, but actively lying or trying to sabotage agreement. The name comes from a classic puzzle: several generals surrounding a city must coordinate to all attack or all retreat, sending messages by courier — but some generals may be traitors sending contradictory orders. Can the loyal ones still reach a unanimous, correct decision?

This is exactly the problem a public blockchain faces. Thousands of anonymous participants, some of whom may be malicious, must agree on one shared ledger without trusting each other. A system is called Byzantine fault tolerant if it can reach correct agreement as long as the dishonest participants stay below some threshold — classically, fewer than one-third of them. Beyond that limit, the traitors can force confusion; below it, the honest majority always prevails.

Every blockchain consensus mechanism is, at heart, a practical solution to this puzzle. Proof of work makes it expensive to be a loud traitor by requiring real computation; proof of stake makes treachery costly by putting the traitor's own deposit at risk. Either way, the design goal is the same: tolerate a bounded number of liars and failures, and still let the honest participants converge on one true, agreed-upon history. Byzantine fault tolerance is the formal property that makes a trustless network possible.