The Quorum Condition: R + W > N
You'll learn: Why the formula R + W > N guarantees that reads always see the most recent write in a distributed system.
The Core Idea
In a distributed system with N replicas, you choose how many nodes must acknowledge a write (W) and how many must respond to a read (R). The quorum condition states that if R + W > N, your read and write sets must overlap — guaranteeing at least one node in your read quorum has the latest value.
Why Overlap Matters
Think of it like a Venn diagram of nodes:
- You write to
Wnodes - You read from
Rnodes - If
R + W > N, these two sets cannot be disjoint — they must share at least one node
That shared node ensures you'll always read the most recent write, because at least one replica you query participated in the latest successful write.
Example
Say N = 5 replicas:
-
Quorum satisfied:
R = 3,W = 3→3 + 3 = 6 > 5✓
Reading from any 3 nodes guarantees overlap with the 3 nodes that confirmed the write. -
No guarantee:
R = 2,W = 2→2 + 2 = 4 ≤ 5✗
You might read from 2 nodes that didn't participate in the latest write, missing the new value.
The math forces at least (R + W) - N nodes to appear in both sets. When that number is ≥ 1, consistency is preserved.
Key Takeaway:
The quorum condition R + W > N ensures read and write quorums always overlap by at least one node, guaranteeing reads reflect the latest successful write without requiring all replicas to agree.