Distribute keys across N nodes so adding/removing a node only moves ~1/N of keys.
Distribute keys across N nodes such that adding or removing a node only reshuffles ~1/N of the keys.
The whole architecture is built around the ring, where every node owns a range of the keyspace
Counters in Redis are distributed by consistent hash so adding capacity doesn't reset every user's rate-limit window
Redis timeline cache shards by user_id via consistent hashing