Consistent Hashing Rings
### Why Consistent Hashing?
Traditional modulo hashing ($ ext{hash}(key) pmod N$) requires remapping almost 100% of keys whenever a cache node is added or removed ($N o N+1$). **Consistent Hashing** maps keys and nodes onto a circular $2^{32}-1$ hash ring, remapping only $K/N$ keys during node scaling.