A Paradox of Common Knowledge
This legendary logic puzzle reveals the surprising power of common knowledge—not just what you know, but what you know that others know that you know...
A visitor arrives and announces to everyone: "At least one of you has blue eyes."
The visitor then leaves. What happens?
If there are N blue-eyed people, they ALL leave on night N.
Set the number of blue-eyed islanders and watch the logic unfold:
The key insight is understanding the difference between individual knowledge and common knowledge.
Alice is the only one with blue eyes. She sees 0 blue eyes. When the visitor says "at least one has blue eyes," Alice immediately knows it must be her. She leaves on Night 1.
Alice and Bob both have blue eyes. Alice sees 1 blue eye (Bob's). She thinks: "If I don't have blue eyes, Bob will leave Night 1." Bob reasons the same about Alice. When neither leaves Night 1, both realize: "I must have blue eyes too!" Both leave on Night 2.
Alice, Bob, and Carol all have blue eyes. Each sees 2 blue eyes. Alice thinks: "If I don't have blue eyes, Bob and Carol will leave Night 2." When they don't, Alice (and Bob and Carol, by identical reasoning) realizes she has blue eyes. All three leave on Night 3.
By induction, if there are N blue-eyed people, they all leave on Night N.
Here's what makes this truly paradoxical:
If there are 100 blue-eyed people, everyone can already see that at least one person has blue eyes. The visitor's announcement tells them nothing new... or does it?
Before the announcement, everyone individually knew there were blue-eyed people. But:
The announcement creates this infinite tower of shared knowledge. Before it, the chain broke at some level. After it, everyone can begin the recursive reasoning that leads to the solution.
Common knowledge is not just knowing something. It's knowing that others know, and knowing that others know that you know, and so on to infinity. This subtle distinction has profound implications:
Market crashes can happen when private information becomes common knowledge. Everyone knowing the king has no clothes is different from it being publicly announced.
Secure communication protocols must carefully manage what becomes common knowledge between parties. The distinction is crucial for security proofs.
Revolutions often start when oppression becomes common knowledge. Everyone suffering isn't enough—everyone must know that everyone knows and is ready to act.
The "Two Generals Problem" shows that common knowledge is impossible to achieve in systems with unreliable communication. This has deep implications for consensus algorithms.
The puzzle assumes perfect logicians. In reality, one person's mistake would break the chain, and no one might ever leave.
They watch and wait. On night N, when all blue-eyed people leave, the brown-eyed ones learn they don't have blue eyes—but they still don't know if their eyes are brown or some other color!
If there are actually no blue-eyed people, everyone sees 0 blue eyes, so no one can deduce anything, and nothing happens.
Each blue-eyed person sees N-1 blue eyes. On night 1, they'd all know and leave immediately!
A single, seemingly obvious statement—"at least one of you has blue eyes"—triggers a cascade of logical deduction that takes exactly N days to complete. The announcement added no new facts that anyone didn't already know, yet it fundamentally changed what everyone could reason.
This is the strange power of common knowledge: the difference between everyone knowing something, and everyone knowing that everyone knows.