System InternalsLearn ↗Consistent HashingADD_NODEREMOVE_NODEPUTGET

Consistent Hashing — pick a scenario

0/3 done

Pick one and press Start, then click Next › to step through it.

Watch for

When the node leaves, only the keys it owned hop to their successor — the rest of the ring is undisturbed.

More about this scenario
You'll learn

How consistent hashing keeps a cluster reshardable — a membership change moves only a fraction of keys, not all of them.

How it runs

Each node (and its virtual nodes) hashes to points on a ring; a key belongs to the first node clockwise from its hash. Removing a node hands only its keys to the next node clockwise; every other key keeps its owner.