/ The Arena

Landmark Capstone Challenge: Consistent Hash Ring with VNodes ⚔️

In this landmark capstone challenge, you will implement a production-grade Consistent Hash Ring supporting Virtual Nodes (VNodes), logarithmic binary search routing, and dynamic node addition/removal.

Requirements:

1. Deterministic 32-bit Hashing & VNodes:
   • Hash each virtual node coordinate (${nodeId}#${i}) to a 32-bit unsigned integer.
   • Store entries in a sorted ring for $O(\log (N\cdot V))$ lookup performance.
2. Clockwise Key Routing with Wraparound:
   • For any key, find the first virtual node whose hash is $\ge \text{hash}(key)$.
   • If key hash exceeds all nodes on the ring, wrap around to the first node ($0^{\circ }$).
3. Dynamic Rebalancing:
   • Support adding and removing physical nodes with immediate, minimal key redistribution.