Part 1 of 5 · 1 min read
Why this page comes first
In this module you will
- Explain how leaderless replication removes the single-leader restriction entirely.
- Define a read quorum and a write quorum, and how their sizes relate to correctness.
- Explain a sloppy quorum and hinted handoff, and the specific availability problem they solve.
- Decide appropriate quorum sizes for a stated availability-versus-consistency requirement.
The previous two pages covered single-leader and multi-leader replication, both of which still designate specific nodes as leaders. This page covers a third shape entirely: no leader at all. Any node can accept a write or a read. A vote count, not a designated role, decides whether an operation succeeded.