A capacity-planning tool that teaches

Design it.
Break it.
Fix it.

before production does.

Draw a system, give it traffic, and see what breaks first — at what load, what it does to latency, and what it costs to fix. Every number shows its working.

The playground judging a payment platform at peak traffic: the risk check, ledger database and webhook receivers are over capacity, and the results strip names what fails first.

A payment platform at 7.5K checkouts a second. Five components give out; the engine says which, and why.

8
worked problems
24
concepts, each with a widget
18
component types, plus your own

How it works

Draw it. Give it traffic. Push it. Read the answer.

A URL shortener on the playground canvas: client, load balancer, service, cache and database, each with its verdict.

Draw the system you are actually building. Components come with real capacities — a service, a cache, a database with replicas, a third party with a rate limit — and every line between them is a declared call, not a guess.

What makes it different

Not a drawing tool with numbers on it. A model you can argue with.

Declared, not guessed
You state how traffic splits, fans out and routes. The tool never infers what your load balancer does — it asks, then shows the arithmetic per component so you can check it.
Time, not just steady state
Run a spike through the design with a real autoscaling policy and see the window where new copies are not there yet.
Honest about its limits
Latency is a textbook approximation and says so. Failure modes cover what the model can express and name what it cannot. Defaults are flagged until you replace them.

Start here

Start with a problem.

Three systems to build, stress, and understand.

  1. Turn a long URL into a short code and redirect on lookup. The classic warm-up: tiny write path, enormous read path, and a key-generation problem hiding underneath.

    7 components~364K req/s peakOpen problem →
  2. Decide, in under a millisecond and across a whole fleet, whether this request is allowed through. The algorithm choice and the counter-sharing problem are the two real questions.

    6 components~200K req/s peakOpen problem →
  3. Build the storage layer the other problems assume exists. Consistent hashing for placement, quorums for consistency, and an explicit answer to what happens during a partition.

    4 components~180K req/s peakOpen problem →
The URL Shortener design, as the problem page draws it.
This is the actual diagram. Every problem opens in the playground as it is.URL Shortenera real design from the library
All 8 problems →

Learn the ideas

The concepts behind the systems.

Short explanations. Real trade-offs. Click to go deeper.

All 24 concepts →

The bottleneck is already in your design.
Find it on a Tuesday, not at launch.

7 templates to start from, or a blank canvas. No account, nothing uploaded — your designs stay in your browser.