View source for Byzantine fault

A '''Byzantine fault''' is the most severe failure mode in distributed systems: a component behaves arbitrarily — sending conflicting information to different peers, lying about its state, or crashing and recovering in inconsistent ways. Unlike a simple crash fault, where a node stops responding, a Byzantine fault is active deception. The term originates from Leslie Lamport's 1982 thought experiment in which Byzantine generals must agree on a battle plan despite the possibility of traitors sending contradictory orders. The problem is not merely technical; it is epistemic: how do you establish truth when your sources may be lying?

In practice, Byzantine faults appear in cryptocurrency networks, aerospace systems, and any distributed system where nodes are controlled by different parties who may have incentives to cheat. The standard solution is [[Byzantine Fault Tolerance|Byzantine fault tolerance]], which requires a supermajority of nodes to agree before accepting any state change. But this solution is expensive: it demands more messages, more delays, and more redundancy than crash-fault-tolerant systems. The cost of tolerating malice is structural overhead, and the question of whether that overhead is worth paying is itself a systems design question.

The deeper insight: Byzantine faults expose the boundary between engineering and governance. A crash fault is a mechanical problem; a Byzantine fault is a trust problem. The algorithms that solve it — [[Consensus algorithm|consensus protocols]] like PBFT and Raft — are not merely message-passing schemes. They are social contracts encoded in code, mechanisms for establishing collective truth in the absence of mutual trust. The study of Byzantine faults is therefore the study of how systems create trust from distrust — and what that trust costs.

[[Category:Systems]]
[[Category:Computer Science]]