Quorum

On this page 7

A quorum is the minimum number of nodes in a replicated system that must acknowledge an operation before the system treats that operation as successful. Replication in databases copies the same data to several servers, and a quorum rule decides how many of those copies must take part in a write, a read or a leadership decision so that the cluster stays consistent despite node failures.

The idea is arithmetic rather than mechanical: if every successful write reaches a majority of replicas, then any two majorities overlap in at least one node, and that shared node carries the latest committed state. This overlap property underpins consensus protocols such as Raft and Paxos, leaderless stores in the Dynamo tradition and the failover logic of many relational database clusters.

How a quorum guarantees overlapping replicas

A quorum works because intersecting sets cannot both be wrong. In a cluster of N replicas, a write quorum W and a read quorum R are chosen so that W + R > N. Under that condition, every read set shares at least one node with every successful write set, so a reader always contacts at least one replica that holds the newest acknowledged version.

A second condition, W > N/2, prevents two conflicting writes from both succeeding on disjoint groups of nodes. Majority quorums satisfy both conditions at once, which is why the default choice in most systems is floor(N/2) + 1. The cluster then remains available as long as a majority of nodes can communicate, and it tolerates floor((N-1)/2) failures.

The table below shows how majority size and fault tolerance grow with cluster size. Note that adding a fourth or sixth node raises the quorum without improving tolerance, which explains the strong preference for odd-sized clusters.

Nodes (N)Majority quorumFailures toleratedComment
110No redundancy
321Smallest fault-tolerant cluster
431Extra node adds cost, not tolerance
532Common production choice
743Higher write latency
Majority quorum size and fault tolerance by cluster size

Types of quorum in replicated databases

Quorums appear in several roles inside a database cluster, and each role protects a different property. A write quorum protects durability, a read quorum protects freshness, and an election quorum protects the uniqueness of the leader. Some systems also use a witness or arbiter, a lightweight voting member that stores no user data but helps form a majority.

The following table separates these variants, because confusing them is a frequent source of misconfigured clusters.

Quorum typeWho must agreeProperty protectedTypical setting
Write quorumW replicas acknowledge a writeDurability of committed dataLeaderless key-value stores
Read quorumR replicas answer a readReading the latest versionTunable consistency stores
Election quorumMajority of voting membersA single legitimate leaderRaft and primary election
Commit quorumLeader plus a majority of followersLog entries survive failoverConsensus-based databases
Witness voteData-less voter joins majorityTie breaking in small clustersTwo-site deployments
Quorum variants and what each protects

Sloppy quorums relax the rule during partitions: a write may be accepted by healthy nodes that are not its designated replicas, then handed back later through hinted handoff. This raises availability but breaks the overlap guarantee, so reads may return stale data until repair completes.

Quorum compared with other replication approaches

A quorum sits between synchronous replication to every replica and asynchronous replication to none. Waiting for all replicas gives the strongest durability but stops writes when a single node is slow or down. Waiting for none gives the lowest latency but risks losing acknowledged data on failover, measured as replication lag at the moment of the crash.

The comparison below places quorum acknowledgment alongside its neighbors in the Replication Topic, including semi-synchronous replication, which waits for a fixed number of replicas rather than a majority.

StrategyWrite waits forData loss on failoverAvailability under failure
All-replica synchronousEvery replicaNoneLowest
Majority quorumMore than half of replicasNone if leader election respects quorumSurvives minority loss
Semi-synchronousAt least one replicaRare, possible on fallbackHigh
AsynchronousPrimary onlyUp to the current lagHighest
Acknowledgment strategies in replicated databases

Quorum is also the main defense against split-brain. When a network partition divides a cluster, only the side that still holds a majority may elect a leader or accept writes. The minority side must refuse writes, which trades availability for safety exactly as the CAP theorem predicts for partitioned systems.

Choosing quorum settings in practice

Quorum settings should follow the workload’s tolerance for stale reads and lost writes. Many leaderless stores expose N, W and R per request, so an application can choose stronger guarantees for payments and weaker ones for analytics counters. Consensus-based databases usually fix the commit quorum at a majority and let operators tune only the cluster size and placement.

The decision table summarizes common situations for a cluster with three replicas and the reasoning behind each choice.

SituationRecommended settingReason
Financial recordsW = 2, R = 2Overlap guarantees latest value
Read-heavy catalogW = 3, R = 1Fast reads, slower writes
High-volume telemetryW = 1, R = 1Speed matters more than freshness
Cross-region clusterMajority with regional placementSurvives loss of one region
Quorum choices for a three-replica cluster

Replica placement matters as much as the numbers. Five nodes spread across two data centers in a three-and-two split cannot survive the loss of the larger site, because the remaining two nodes lack a majority. A third location, even one hosting only a witness, restores the ability to fail over automatically.

Limitations and common mistakes

A quorum guarantees overlap, not perfect linearizability. Concurrent writes, clock skew and incomplete read repair can still expose anomalies unless the system adds version vectors, leader leases or read-index checks. Operators should treat quorum arithmetic as a necessary but not sufficient condition for strong consistency.

  • Even cluster sizes increase the quorum without adding fault tolerance.
  • Sloppy quorums silently weaken the read-your-writes guarantee during partitions.
  • Manual forced failover that ignores quorum can create two primaries and divergent histories.
  • Large quorums across regions add round-trip latency to every committed write.
  • Counting non-voting replicas as voters overstates the real failure tolerance.

Stripped to the essentials

Imagine a committee of five people that keeps identical copies of an important ledger. A change is only official when at least three of them have written it down. Because any two groups of three always share at least one person, someone in every group knows the latest entry.

That rule is a quorum. It lets a database keep working when some copies fail while still preventing two halves of the system from telling different stories. The price is that every change must wait for enough members to answer.

Where it is applied

An online retailer runs its order database on a five-node cluster that uses a Raft-style consensus protocol, with two nodes in each of two cloud regions and a fifth node in a third region. Every order is committed only after three nodes have written it to their logs, so a commit typically takes 8 to 15 milliseconds longer than a single-node write.

During a regional network outage, the two isolated nodes lose contact with the rest and stop accepting orders, while the remaining three still form a majority, elect a leader within a few seconds and continue serving customers. When the outage ends, the isolated nodes catch up from the leader’s log. No acknowledged order is lost and no conflicting orders are created, which is exactly the outcome the quorum rule is designed to deliver.