Placement

Replicas must not ride in the same rack: CRUSH weights become rack/zone/DC-aware so a single domain failure can’t lose the data.

Weighted rendezvous hashing picks replicas deterministically and peer-equally without a central allocator — later hardened for failure domains. Teaches: content-hash-based placement, weighted rendezvous hashing, deterministic stable sort, failure domain filtering.