Key-value store: two calls, and everything behind them

One strong interview answer to "design a distributed key-value store": a hash ring with virtual nodes for placement, R + W > N quorums tuned per request, sloppy quorums and hinted handoff to stay writable, vector clocks so two carts merge instead of losing an item, and the tombstones that stop deletes coming back.