Why does hash(key) mod N break when cluster size changes?
When N grows from 4 to 5 nodes, hash(key) mod 4 and hash(key) mod 5 almost never point to the same node. Redis running mod 4 answers 'key lives on node 2'. The cluster adds a node and switches to mod 5. Now the same key hashes to node 3. Everything on disk is stale—the cache is wiped.
Answered in
When 87% of Your Cache VanishesConsistent hashing maps nodes and keys to a circle, so adding a server moves only 1/N of keys instead of almost all of them.
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.