Status: IN
Consistent hash routing provides correct minimal-redistribution key assignment with proper deduplication: adding an Nth node moves approximately 1/N of keys (not a full reshuffle), and the preference list correctly skips virtual nodes of already-seen physical nodes to return exactly replication_factor distinct physical nodes.
Minimal redistribution and deduplicated preference lists ensure correct routing, gated on the ring having no synchronization for concurrent add/remove operations
Depends on (SL): consistent-hash-minimal-redistribution, ch-preference-list-skips-duplicates