Search DistillSys

Find a concept

Type at least two characters to search lessons, designs, papers, and interview prep.

Consensusintermediate6 min read

Quorums

Use overlapping read and write sets to reason about replica authority, freshness, and failure tolerance.

2–5 minute refresher
Mental model

Choose enough replicas that every read intersects the latest successful write

30second
refresher
With N replicas, a write waits for W acknowledgements and a read consults R replicas. When R + W > N, every read set overlaps every successful write set. When W > N/2, two successful write quorums must overlap.

What problem do quorums solve?

Waiting for every replica makes one slow node block progress. Waiting for one replica risks stale or conflicting state. Quorums provide a tunable middle ground between coordination cost and fault tolerance.

Explore quorum choices

Interactive lab

Quorum calculator

Adjust the replica, read, and write counts. The overlap and availability implications update instantly.

3 + 3 > 5Read and write quorums overlap.
Decision guide

Key trade-offs

ChoiceWhat you gainWhat it costs
Large WMore durable and fresher acknowledged writesHigher write latency and lower write availability
Large RBetter chance of observing the newest versionHigher read latency and fanout
Sloppy quorumContinued writes during replica lossThe sets may not overlap; hinted handoff is required
What happens if?

Two replicas are unreachable in N=5, W=3

A write can still succeed with the remaining three. If a third replica is lost, the system must reject the write or weaken its policy.
What happens if?

A read sees three different versions

Version metadata—term/index, timestamp, or vector clock—selects or reconciles the result. Read repair can then update stale replicas outside the user’s critical path.
Senior interview modeWhy does R + W > N not necessarily guarantee linearizability?Show answer
The rule guarantees set overlap, not that writes are totally ordered or that the read chooses a committed latest value. Sloppy quorums, clock-based conflict resolution, and concurrent writes can violate linearizable behavior.
#quorum#replication#consistency#availability