{"id":"consistent-hash-routing-correct-under-single-thread","text":"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.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["consistent-hash-minimal-redistribution","ch-preference-list-skips-duplicates"],"outlist":["consistent-hash-ring-not-thread-safe"],"label":"Minimal redistribution and deduplicated preference lists ensure correct routing, gated on the ring having no synchronization for concurrent add/remove operations"}],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"consistent-hash-routing-correct-under-single-thread","truth_value":"IN","reason":"SL justification valid","antecedents":["consistent-hash-minimal-redistribution","ch-preference-list-skips-duplicates"],"label":"Minimal redistribution and deduplicated preference lists ensure correct routing, gated on the ring having no synchronization for concurrent add/remove operations","outlist":["consistent-hash-ring-not-thread-safe"]},{"node":"consistent-hash-minimal-redistribution","truth_value":"IN","reason":"premise"},{"node":"ch-preference-list-skips-duplicates","truth_value":"IN","reason":"premise"}]}}