Why computer systems need to survive the treachery of their own internal components
In short: A Byzantine fault occurs when a system component presents conflicting information to different observers, making it impossible to reach a consensus. Named after an allegory of generals plotting an attack, this failure mode is the most difficult to solve because it can arise from physical errors, not just malicious interference.
The Byzantine generals problem, formalized in 1978 by Robert Shostak and later popularized by Leslie Lamport, describes a scenario where generals must agree on a single strategy despite some being traitors. In computing, this translates to nodes in a distributed system that may send contradictory data to different peers. Unlike a simple crash, where a node stops working, a Byzantine failure allows a node to act erratically or deceptively, potentially confusing the entire network. This is the most complex failure mode because it can occur without any hostile human intent, stemming instead from subtle hardware or software glitches.
To achieve Byzantine fault tolerance (BFT), a system must ensure that all honest components reach a consistent agreement. Without cryptographic signatures, mathematical proofs established by Shostak, Marshall Pease, and Lamport show that a system requires more than three times as many total components as there are faulty ones (n > 3F). This ensures that the honest majority can outvote the traitors. When digital signatures are used to prevent impersonation, the requirement relaxes to needing more than one-third of the total nodes to be honest (n > F+1).
Modern applications of BFT are critical for high-stakes environments where consensus is non-negotiable. Systems like the Boeing 777 flight control and the Orion spacecraft utilize BFT to maintain safety despite potential component failures. In the realm of decentralized technology, BFT-based protocols are used to secure networks against fraud, though some systems claim BFT without meeting the strict mathematical requirements of the original consensus models. Recent research continues to push the boundaries of these systems, exploring ways to parallelize consensus to overcome the scalability limitations that have historically plagued BFT implementations.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Byzantine fault
- Also: Wikidata — Byzantine fault · CC0
- Also: Wikidata — Byzantine fault tolerance that supports heterogeneous clients · CC0
To cite this card, link to https://intellectplus.co.uk/app/places-byzantine-fault.
How we source, check and correct cards: Editorial standards.
General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.
Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?
Related
More in Countries and other regions · More in Countries & Cities · Latest · A–Z · All topics
