Jump Consistent Hash interactive simulator. A key is mapped to a bucket in [0, N-1] using a formula and zero memory: the key jumps forward through bucket indices until a jump would land past N. Trace any key's jumps and slide N to see how few keys move when a bucket is added or removed.
Jump Consistent Hash maps a key to a bucket [0, N-1] with zero memory. The key jumps forward through bucket indices, each jump's distance computed from a pseudorandom number cooked up from the key. When a jump lands past N, the algorithm stops at the previous bucket. The arcs you see below are the actual path. Click Play trace to watch it animate.
Jump path for—
Step-by-step
vs ring · HRW · vnodes: zero memory · perfect balance · O(log N) lookup · only the last bucket can be cheaply added or removed