How it works
The overlap rule
When R plus W is greater than N, every successful read contacts at least one replica that acknowledged the latest successful write.
Tunable consistency
A larger write quorum strengthens write durability, while a larger read quorum can detect newer versions at the cost of latency and availability.
Conflicting versions
Quorum overlap does not solve concurrent writes by itself, so systems still need versions, timestamps, vector clocks, or application-level merging.
Failure budget
An operation remains available only when enough replicas are reachable to satisfy its chosen quorum.