System Design Playground

Each simulator starts with the naive approach so you can watch it break, then flips on the pattern that fixes it. Building intuition for "why" a pattern exists sticks longer than memorizing a definition.

Being built next

The patterns where the naive version fails in a way you can actually watch happen. Each one gets the same two-part treatment: an animated explainer, then a simulator you drive yourself.

Coming Soon

Why Sharding

One hot key pins a single node at 100% while the rest idle — then shard and rebalance, and pay for it in cross-shard queries.

Coming Soon

Why Idempotency Keys

A client retries a payment after a timeout and gets charged twice — then add an idempotency key and make the whole retry storm safe.

Coming Soon

Why Service Discovery

Hardcoded addresses keep routing traffic to an instance that already died — then register instances and health-check them, and watch traffic reroute live.

Coming Soon

Why Backpressure & Bulkheads

One slow dependency eats the shared pool and takes unrelated endpoints down with it — then isolate pools per dependency and contain the blast radius.

Later in the queue

Further out, and a little more involved to model — but the same format.

Coming Soon

Why Quorum Reads & Writes

Move N, R, and W yourself and find the exact point where R + W ≤ N starts handing you a stale read.

Coming Soon

Why a Bloom Filter

Count the disk reads wasted on keys that were never there, add the filter, then shrink the bitmap until false positives bite back.

Coming Soon

Why a CDN

Watch latency by region and origin load with every request going to one datacenter, then cache at the edge.

Coming Soon

Why CQRS

Reads and writes fight over the same model until both slow down — then split them, and live with projection lag.

Coming Soon

Why Saga over 2PC

One participant hangs mid-transaction: compare a blocked 2PC coordinator against compensating saga steps.