Why Byzantine systems need more than a simple majority
A faulty computer in a distributed network can do more than send an incorrect answer. It can equivocate: send one version of a message to one set of computers and a conflicting version to another. This is the Byzantine fault problem, named for the challenge of reaching agreement when some participants may behave unpredictably or maliciously.
A simple majority vote is not enough if different groups receive different information. A protocol instead asks sufficiently large groups—called quorums—to approve a decision, and arranges them so that any two quorums overlap.
The arithmetic behind the one-third limit
In a common design, a network has at least 3f + 1 computers and requires 2f + 1 approvals, where f is the maximum number of faulty computers it aims to tolerate. Any two groups of 2f + 1 drawn from 3f + 1 computers must share at least f + 1 members. If no more than f computers are faulty, at least one computer in that overlap is honest.
That honest computer follows the protocol rather than approving incompatible decisions. The overlap therefore blocks a faulty participant from quietly assembling one approving group for a decision and another for its opposite. The threshold is not a promise that every system uses these exact numbers; it describes a widely used way to make agreement possible despite conflicting messages.
Why the honest majority matters
The limit is severe because the protocol must remain safe even when faulty computers coordinate and tell different stories. If faulty participants can make up a third or more of the network, the required overlap may no longer guarantee an honest witness. The network could then lose its protection against conflicting decisions.
That makes membership and fault assumptions part of the engineering: a system’s guarantees depend on keeping the faulty share below its tolerance, not merely on having many computers. The quorum rule turns that assumption into a concrete safeguard—every pair of approvals must intersect in someone who will not sign both sides.
