Consensus and Why Agreement Is Hard
Several machines have to agree on one value even though some may fail and messages may be delayed. A majority quorum plus a leader gets there in practice, and the theory says no protocol can guarantee both safety and progress when delays have no bound.
What a learner can do afterwards
- Explain why a majority quorum makes two conflicting decisions impossible
- Follow a leader election and say what happens if the old leader returns
- State what the impossibility result rules out and what it leaves available
1 · Read
You already know copies can disagree and silence hides crashes. Consensus asks several machines to agree on one value even though some may fail and messages may be late. Take any two groups of 3 from 5 nodes: they always share at least one node.
Five nodes must pick one leader. Three vote for Ana and two for Ben, so Ana wins a majority. No rival group of three can vote for Ben without including someone who already voted for Ana, and nobody votes twice. Two conflicting decisions are impossible.
In practice a leader coordinates: it is elected, gathers votes, and announces the decision. If the old leader returns after a failure, the newer term wins and the old one steps down quietly instead of ruling beside it.
Theory adds one honest warning. When delays have no bound, no protocol can guarantee both safety and progress at once. That rules out a perfect protocol and leaves practical ones that stay safe and usually finish.
Majorities overlap so conflicts are impossible, a leader coordinates, and unbounded delay rules out perfection but not practice.
2 · Watch
Take it off screen
Where it sits
8 questions wait behind this lesson, each with its answer explained. Every answer feeds the sky: stars light as they are learned, and dim when it is time to come back.