the second hundred · metaphor 181
You and someone you need to move in step with can only reach each other through a channel that sometimes drops what you send. You want the plain thing every partnership wants: to both know, at the same moment, that you are decided together. The strange news is that no number of messages will ever quite get you there.
You text: “Dinner at eight?” They reply: “Yes.” But did your yes reach them? So they text: “Got it — eight.” But now they don't know their confirmation arrived, so you send: “Great, see you then.” — and now you're unsure that landed. Every message closes one gap and opens another exactly like it, one rung higher. The plan feels settled; certainty of the plan never quite is.
This is not anxiety or bad manners. It is a hard fact about coordinating across any channel that can lose a message: the last thing you sent is always the thing whose arrival you cannot confirm. The tower of “I know that you know that I know…” climbs as high as you like and is never, ever finished. Computer scientists met it in a fable of two generals — and proved the ceiling can't be reached.
The unclosable gap
Follow the logic on the perfect wire first, where nothing is ever lost. West decides the plan and sends it. East receives it — now East knows the plan. But West has no proof East got it, so East sends an acknowledgement. West receives it — now West knows that East knows. Yet East can't be sure that acknowledgement arrived, so West acknowledges the acknowledgement, and now East knows that West knows that East knows. The tower rises one solid rung with every delivery.
And still, at every moment, the topmost message is one whose arrival its sender cannot confirm. There is always a highest rung held by only one side. To make it mutual you send one more — which creates a new highest rung, held by only one side. The gap to certainty is exactly one, forever. This is the thing that surprises people: even with a flawless channel, the two of you never reach the state where you both know you're agreed, all the way down, at the same instant. That state is called common knowledge, and it sits at the top of an infinite ladder.
Now add loss. Slide the channel loss up and the climb also stalls: a message vanishes in the fog, its sender waits, times out, resends. The confirmed tower still grows — you can build as many solid rungs as you have patience for — but each rung now costs, on average, 1/(1−q) sends, and the ceiling recedes exactly as fast as you climb. Loss makes the impossibility visceral; the perfect wire proves it was never about loss at all.
What to try
Everything on the panel is computed from the actual messenger crossings — the counters are real deliveries and real losses, and the avg confirmations before a loss is measured from the run and printed beside the theoretical (1−q)/q it is converging toward. Nothing is staged. Start on the near-perfect channel and press Send a few times: the tower climbs cleanly, one solid rung each press — and the red dashed ceiling stays one rung above, labelled never reached. The counter of levels of I-know-you-know ticks up, and common knowledge? stubbornly reads never.
Now drag the loss up and hit Auto. Watch messages vanish mid-fog in red; the sender simply keeps resending, and the tower grows in fits — fast when the wire is kind, in painful lurches when it isn't. Let it run and the avg confirmations before a loss settles onto the theory line. Push loss toward the extreme and confirmations between losses become rare, but notice the point that never changes no matter what you do: the top rung is always dashed, always the one nobody can confirm. You can spend a thousand messages; the last one is still in the fog.
The mapping
Two people planning across text messages. A team scattered over email deciding whether the launch is really a go. A couple, mid-argument, each waiting for the other to confirm the reconciliation is real. In every case the wish is the same and so is the fact: you want to both know, together, that you're decided, and the channel between you — words, silence, distance, memory — can always drop the thing that would close it. So certainty recedes one acknowledgement further each time you reach for it.
The lesson is not despair; it's a redescription of what coordination actually is. You will never reach the top of the tower, so agreements are not built on certainty of agreement — they are built on enough rungs that both sides are willing to act as if agreed. At some finite height you stop confirming and simply move: you show up at eight. The two generals problem is why every working protocol, human or machine, eventually replaces proof with a leap — a decision to trust the tower you have rather than wait for the one you can't finish.
Read as life lessons
Whoever spoke most recently is always the one who cannot know they were heard. This is structural, not personal — the silence after your message means nothing certain, in either direction.
Even with zero loss, the ladder is infinite. The obstacle is not unreliability but the shape of mutual knowing itself — each level of “you know that I know” needs a level above it.
Because the tower never tops out, coordination ends not in proof but in a decision to act as if. You stop asking “are we sure?” and simply keep the appointment.
In the wild
A TCP handshake and every “delivered” receipt live under this ceiling. Protocols don't seek certainty; they pick a finite number of retries and a timeout, then commit — trust with a deadline.
Databases that must agree across machines can't wait for common knowledge, so they settle for quorums and consensus rules that are provably safe without any side ever being fully certain.
Contracts, RSVPs, ceremonies, and shared rituals exist to manufacture near-common-knowledge cheaply — public acts everyone saw everyone see, so the tower feels tall enough to act on.
The mapping, exactly
| Mathematics | Life |
|---|---|
| the two generals | Any two parties who must act in step, whose success depends on doing the same thing at the same time. |
| the lossy channel | Every medium between you — texts, email, speech, distance, memory — that can silently drop what was sent. |
| an acknowledgement | “Got it.” The reply that closes one gap of doubt and, by existing, opens the next one above it. |
| levels of nested knowledge | “I know that you know that I know…” — how deep your shared certainty has actually been confirmed to run. |
| common knowledge | The top of the ladder: both of you knowing you're agreed, all the way down, at once. Never reached in finite time. |
| the timeout & commit | The moment you stop confirming and simply act — trusting the finite tower you've built instead of the infinite one you can't. |
The honest model
The channel is a coin: each message reaches the far camp with probability 1−q and is lost with probability q, drawn live for every crossing. A delivered message adds one confirmed rung to the tower and hands the newest uncertainty to the receiver, who becomes the next sender; a lost message adds nothing and the same sender must try again. The levels of I-know-you-know counter is simply the number of messages delivered so far — a quantity that grows without bound yet, crucially, always leaves its own top rung unconfirmed.
The one statistic worth predicting is the run of consecutive deliveries between losses. Consecutive successes of a coin with success probability 1−q follow a geometric law with mean (1−q)/q, and the panel accumulates the measured runs and shows them landing on that curve — computed from the crossings, not assumed. Everything else in the widget is a faithful bookkeeping of a fact no amount of protocol can escape: the highest rung is defined by the message whose fate its sender does not yet know, so a finished, mutual, all-the-way-down certainty has probability zero of ever existing.
Where the metaphor tears
The theorem forbids perfect common knowledge, but humans coordinate beautifully on approximate common knowledge — a few rungs, a shared glance, a public vow. The impossibility is real and the coordination is real; treating the ceiling as a reason not to commit mistakes a mathematical limit for a practical one. Most plans need three rungs, not infinity.
The fable assumes all knowledge travels as private point-to-point messages. But a public event — a handshake in a room, a broadcast both sides witness together — can install many rungs at once, because each party sees the other seeing it. Real coordination cheats the tower with shared presence in ways the two-generals channel forbids by construction.
The generals must attack together or both die; the stakes are perfectly mutual. Many human coordinations aren't — one side can act first and absorb the risk, or a default (“we meet at the usual place unless you say otherwise”) removes the need to confirm at all. Where a fallback exists, the missing top rung stops mattering, and the paradox quietly dissolves.