Consistent Hashing, Actually Working: From Modulo to a Java Ring with Virtual Nodes
“Design a distributed cache.” You say hash(key) % N. The interviewer nods, then asks: “A node dies at 3 AM. What happens?” If your answer is “we rehash everything,” you’ve just told them your cache has a planned outage every time the …


