Sloppy Quorums and Hinted Handoff
What you'll learn: How systems maintain availability during node failures by writing to temporary substitute nodes.
The Problem with Strict Quorums
In standard quorum systems (N=3, R=2, W=2), what happens when one of your designated replica nodes is unavailable? If you strictly require writing to nodes A, B, and C, but C is down, should you reject the write and sacrifice availability?
Sloppy Quorums: Prioritizing Availability
A sloppy quorum relaxes the strict requirement about which nodes must respond. Instead of demanding writes go to the exact N designated replicas, you accept writes to any N healthy nodes in the cluster—even if they're not the usual homes for that data.
Think of it like a package delivery: if your neighbor isn't home, the delivery service leaves the package with another neighbor rather than returning it to the sender.
Hinted Handoff: Reconciliation Later
When node D temporarily accepts a write meant for the unavailable node C, it stores a hint noting "this data belongs to C, not me." Once C recovers, D automatically hands off the data to its proper home. This reconciliation process is called hinted handoff.
The Trade-off
Sloppy quorums maximize availability—writes succeed even during failures. However, they weaken durability guarantees temporarily. If substitute node D crashes before handing off to C, that write could be lost. You're also not guaranteed strict consistency until handoff completes.
Key Takeaway: Sloppy quorums with hinted handoff prioritize availability over strict consistency by accepting writes to temporary substitute nodes during failures, with automatic reconciliation once designated nodes recover.