What does consistency mean in CAP?
Consistency (in CAP) means linearizability: every read reflects all writes that completed before it. If you write v=99 and the write succeeds, the next read sees v=99. Under partition, achieving this requires quorum: refuse the write if you can't reach a majority of replicas. Weak consistency (eventual consistency) relaxes this and allows temporary divergence.
Answered in
The CAP Theorem Is Not a MenuNetwork partitions force a hard choice: refuse writes (CP) or accept and diverge (AP). Why the two-of-three myth is wrong, and what PACELC really tells us.
Read the full analysisOther questions this article answers
More system design questions
- Why doesn't Google just run Dijkstra faster?
- What is a shortcut edge and when is it precomputed?
- How much space do shortcut edges take compared to the original graph?
- Can Contraction Hierarchies handle dynamic graphs like traffic or road closure?
- Why contract low-degree nodes first instead of high-degree ones?
- What is a CRDT and why does it matter for real-time collaboration?
- How do CRDTs handle concurrent edits without a central server referee?
- Why did Figma move from operational transforms to CRDTs?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.