04
Summit · Case Study 1
Key-Value Store
Design a distributed KV store — leaderless replication, quorum reads/writes, LSM tree internals, gossip membership, vector clock conflict resolution.
System Requirements
Problem statement, functional requirements, back-of-envelope estimation, and non-functional requirements.
FREstimationNFR
Open →
API Design
API surface for a KV store — get, put, delete — and the reasoning behind Base64 encoding for keys.
API DesignWhy Base64
Open →
Base Architecture
Why leaderless replication wins for a KV store — single-leader vs multi-leader vs leaderless tradeoffs, and the base design.
LeaderlessReplicationBase Design
Open →
Deep Dives
Consistent hashing, quorum writes, hinted handoff, LSM tree internals, compaction strategies, gossip protocol, vector clock conflict resolution, TTL, and fault isolation.
LSM TreesCompactionQuorum W/RGossip ProtocolVector Clocks
Open →
Observability
SLIs and SLOs for a KV store, latency and availability measurement, alerting strategy, and error budgets.
SLI / SLOAlertingError Budget
Open →
Final Design
The complete architecture after all deep dives — every component justified, every tradeoff resolved.
Final ArchitectureFull Diagram
Open →