Thousand Node Tax

Rendezvous is cheaper per lookup because it skips the sorted position list, but pays for it by moving substantially more keys than the ring when a node is removed

A plain rendezvous lookup is O(N) because it scores every node, while a ring lookup is O(log P) via binary search over the sorted list of P positions

A rendezvous lookup is O(1) because it hashes the key exactly once, while a ring lookup is O(N) because the client walks the circle from the key's position to the next node

Both are effectively O(1), since each scheme hashes the key once and reads the owner from a precomputed assignment table