Read/Write Quorum

The Golden Rule: W + R > N

When W + R > N, every read quorum must overlap with every write quorum by at least one node. This overlap guarantees the reader always sees the latest write — this is strong consistency. The math is elegant: if you write to W nodes and read from R nodes, and W + R > N, then at least one node participated in both operations, so the read must see the latest write.

Example: N=5, W=3, R=3
  W + R = 6 > 5 (N)  →  Strong Consistency ✅

  Write goes to:   [1, 2, 3]       (3 nodes)
  Read comes from: [3, 4, 5]       (3 nodes)
  Overlap:         [3]             (at least 1 node!)
  → Node 3 has the latest write, so read sees it.

Connection to the CAP Theorem

The CAP theorem states that a distributed system can only guarantee two of three properties: Consistency, Availability, and Partition tolerance. Quorum systems let you tune where you sit on this spectrum:

Tunable Consistency in Practice

Modern databases let you configure consistency per query, not just per cluster. This is called tunable consistency — the killer feature of quorum-based systems.

-- Strong consistency (W + R > N)
INSERT INTO users ... USING CONSISTENCY QUORUM;
SELECT * FROM users ... USING CONSISTENCY QUORUM;

-- Fast writes, eventual reads
INSERT INTO users ... USING CONSISTENCY ONE;
SELECT * FROM users ... USING CONSISTENCY ONE;

-- Maximum safety
INSERT INTO users ... USING CONSISTENCY ALL;
SELECT * FROM users ... USING CONSISTENCY ALL;

* Strong consistency when both reads and writes use QUORUM

Sloppy Quorums & Hinted Handoff

A strict quorum requires responses from specific designated nodes. A sloppy quorum accepts responses from any N nodes, not just the designated replicas. This dramatically improves availability during partial failures.

Read Repair & Anti-Entropy

When a read quorum returns responses with different versions, the system performs read repair — it writes the latest version back to the stale replicas. This happens in the background and is transparent to the client.

What Does W + R > N Actually Guarantee?

A common misconception is that W + R > N gives you linearizability (the strongest form of consistency). In reality, it only guarantees regular register semantics — you'll see the latest write or a concurrent write, but not necessarily in a globally ordered way. For true linearizability, you need additional mechanisms:

• Read-your-writes: No guarantee that a client immediately sees its own writes unless reads go to the same quorum
• Monotonic reads: A client might see newer data then older data on subsequent reads from different quorums
• True linearizability: Requires consensus protocols like Raft or Paxos on top of quorums (e.g., CockroachDB, etcd)

Production Systems Deep Dive