How to Reach Consensus with Paper, Pencil and the Raft Algorithm
summary
A practical exploration of the Raft consensus algorithm, explaining how Raft achieves agreement in distributed systems using only simple tools (paper and pencil) to illustrate its mechanics. The talk uses concrete examples and references real-world projects that use Raft (Etcd, Consul) to show leader election, log replication, and safety properties.
AI-written summary · about
chapters (15)
- 0:00Introduction
- 1:12What is a cluster and consensus
- 3:01Consistency problem in clusters
- 4:30Raft algorithm overview
- 7:23Preparing for interactive game
- 13:29Leader election theory
- 19:57Leader election practice
- 24:59Data replication after leader
- 30:48Log replication and state machine
- 36:16Handling failures and elections
- 43:56Quorum problems and fault tolerance
- 51:08Cluster configs and dynamic changes
- 1:01:43Interactive wrap-up
- 1:14:43Advanced Raft topics
- 1:20:56Q&A
related talks
01h 27mHow to Reach Consensus Using Paper, Pencil and the Raft Algorithm
47mUnderstanding Raft Consensus
41mThe Raft Consensus Algorithm
14mDistributed Consensus in 15 Minutes!
47mDistributed Systems: When Democracy and Computer Science Come Together
01h 13mPaxos vs Raft: Have we reached consensus on distributed consensus?
44mImproving Raft Survivability in Real-World Conditions
40mConsensus Algorithms in Distributed Systems