Indexing the archive…
Your Universe of Digital Possibilities
Add one server to a hundred and an ordinary hash table reshuffles almost every key. Put the servers on a ring instead, give each key to the first server clockwise, and only the keys between two neighbours move — one arc’s worth, the least any map could manage.
A new server on the ring takes only the keys between its predecessor and itself — on average one share in S + 1, the least any map could move. Under key mod N a key stays only if its remainder is the same for S and S + 1, about one key in S + 1; all the rest move.
The S·v positions are uniform points on the circle, so the arcs between them are nearly independent exponentials and a server’s share is a sum of v of them. With one position each, the busiest holds about ln S times the mean; with v, the spread shrinks like 1/√v.
Each node keeps a finger to the node succeeding it at every power of two around the ring. Forwarding a lookup to the closest finger before the key at least halves the remaining distance, so a lookup takes at most log₂ S hops and about half that on average.
The Choice balanced the work a job at a time; The Hash keeps a map of the work stable while the servers themselves come and go. One circle, two hashes, a clockwise rule — and a join costs the least it possibly could. Chord then drops the last central fact, the ring itself: each node knows a logarithmic handful of others and a lookup halves its distance at every hop, the same doubling that will spread The Rumor to every node in log n rounds. And like the codes of The Code it buys robustness with a little redundancy — there extra bits against noise, here extra positions on the circle against an uneven share.