Don't Just Read. Simulate.
Complex systems are hard to understand from static diagrams. Touch, interact, and break things to build intuition for Distributed Systems.
Distributed Systems
RAFT Consensus
Leader election and log replication visualizer
CAP Theorem
Trade-offs between Consistency and Availability
Chaos Playground
Inject faults into a microservices mesh
Go Scheduler
M:N scheduling and work stealing in Go
Circuit Breaker
Resilience pattern visualizer
Distributed Lock
Redlock consensus & clock drift
Retry Strategy
Backoff algorithm grapher
Read/Write Quorum
N, W, R consistency visualizer
Database Internals
B-Tree Indexing
Interactive insertion and splitting of B-Tree nodes
LSM-Tree
Log-Structured Merge Tree compaction process
Isolation Levels
Visualizing dirty reads, phantom reads, and ACID
Vector Embedding
High-dimensional vector similarity search
LRU Cache
Visualize cache behavior
Cache Eviction
LRU vs LFU vs FIFO comparison
Database Sharding
Hash, Range & Directory strategies
Networking Protocols
OSI Model Flow
Packet encapsulation from App to Physical layer
TCP Handshake
SYN, SYN-ACK, ACK connection establishment
TCP Congestion
Slow start, congestion avoidance, and recovery
HTTP/2 Streams
Multiplexing and head-of-line blocking solver
JSON vs Protobuf
Compare payload sizes
gRPC vs REST
Performance comparison
JWT Lifecycle
Token issuance and expiration flow
Algorithms & Logic
Rate Limiter
Visualize Token Bucket vs Leaky Bucket algorithms
Load Balancer
Round Robin, Least Conn, and IP Hash strategies
Consistent Hashing
Distribute data across nodes with minimal reshuffling
Algorithm Visualizer
Step-by-step execution of sorting and search
Bloom Filter
Probabilistic data structures visualization
Queue & Stack
FIFO queue vs LIFO stack with side-by-side comparison
Linked List
Singly, Doubly, and Circular list simulator
Trie / Autocomplete
Prefix search visualization
Decision Tree
Interactive ML classification tree
Sorting Visualizer
Bubble, Quick, Merge & more
Binary Search
Visualizing Search Patterns
Dijkstra Pathfinding
Shortest path on a grid