Interactive Visualizations
Explore distributed algorithms through interactive, step-by-step visualizations. Each visualization lets you control the algorithm, inject failures, and see the state change in real time.
Raft Consensus
Leader election, log replication, and term changes. Step through the algorithm that powers etcd and Consul.
Open →Paxos
The original consensus protocol. Watch proposers, acceptors, and learners agree on a value through two phases.
Open →CAP Theorem
Explore the consistency-availability-partition tolerance trade-off. See where real systems fall on the triangle.
Open →CRDT (G-Counter)
Conflict-free replicated counters. See how two nodes can independently increment and merge without conflicts.
Open →Consistent Hashing
Hash ring with virtual nodes. Add and remove nodes to see how keys redistribute with minimal movement.
Open →Lamport Clocks
Step through Lamport's logical clock algorithm. See how C_j = max(C_j, C_i + 1) creates a partial event ordering.
Open →Vector Clocks
Track causal history across nodes with color-coded vector entries. Detect concurrent updates and conflicts automatically.
Open →Gossip Protocol
Watch infection-style rumor spreading across a network. Control fanout and see convergence in action.
Open →Two-Phase Commit
Distributed transaction coordination. Inject failures and see the blocking problem in action.
Open →