Toolkit.
34 simulators

Push the pieces
yourself.

Interactive visualisations for learning distributed systems, algorithms, and data structures. Nothing beats moving the parts yourself.

Filter

Simulator
CAP Theorem Featured
Pick two. Toggle the partition. Watch the third guarantee fail.
Consistent Hashing
Add, remove, and move nodes around the ring.
Database Sharding
Range, hash, and directory strategies compared.
Read/Write Quorum
Tune N, R, W — watch reads and writes succeed or stall.
Isolation Levels
Dirty reads, non-repeatable reads, phantoms — side-by-side.
Rate Limiter Featured
Token bucket, leaky bucket, fixed and sliding windows.
Circuit Breaker
State-machine resilience pattern, with failure playback.
Retry Strategy
Exponential, jittered, decorrelated — load-tested.
Load Balancer
Round-robin, least-conn, hashing, p2c — under real load.
Cache Eviction
LRU, LFU, ARC, TinyLFU compared in real time.
LRU Cache
Watch the list mutate as you read and write.
Chaos Playground
Inject latency, packet loss, and node failure at will.
TCP Handshake
Three-way and four-way, with sequence numbers.
TCP Congestion
Slow start, congestion avoidance, fast recovery.
HTTP Flow
Request lifecycle across client, proxy, origin.
HTTP/2 Streams
Multiplexed frames, dependencies, head-of-line blocking.
gRPC vs REST
Side-by-side wire format, streaming, error model.
JSON vs Protobuf
Size, parse cost, schema evolution.
JWT Lifecycle
Issue, verify, rotate, revoke — the full loop.
K8s Rollout
RollingUpdate, surge, unavailable — live deployment.
Pod Eviction
PDBs, node pressure, preemption — playable.
Goroutine Scheduler
GMP model: work stealing, netpoll, preemption.
Storage Engine
LSM and B-tree read/write paths side by side.
B-Tree
Insert, split, rebalance — node by node.
Trie / Autocomplete
Prefix tree walk-through with live lookup.
Bloom Filter
Tune bits and hashes; watch false-positive rate.
Linked List
Singly, doubly, circular — pointers annotated.
Queue & Stack
FIFO, LIFO, priority, deque — visualised.
Sorting Visualiser
Bubble, quick, merge, heap — comparison counts visible.
Binary Search
Leftmost, rightmost, insertion point patterns.
Dijkstra Pathfinding
Shortest path on a grid with weighted obstacles.
Algorithm Visualizer
Explore common algorithms step by step.
Decision Tree
Grow, split, prune — classification made visible.
Vector Embedding
Cosine similarity, ANN search, index tradeoffs.