Replicated Log
Also known as:
Distributed Log
Append Only Log
Definition
A replicated log is a list of operations that is kept in the same order on many machines using a consensus protocol. Every node applies the entries in the same order, so all the replicas end up with the same state. This is the main idea behind Raft, Multi Paxos, Kafka, and most fault tolerant systems.
Popular reads
View All
Cursor Skills: How to Create and Use Agent Skills
Jun 23, 2026
Payment System Design: Ledger, Idempotency, and Settlement
Jul 18, 2026
X Algorithm Explained: How the Open Source Recommendation System Works
Jan 22, 2026
Complete Guide to Graph Data Structure: BFS, DFS, Adjacency List vs Matrix
Jan 20, 2026
The Complete HTMX Guide: From Zero to Production
Dec 22, 2025
Transactional Outbox Pattern: Never Lose an Event Again
Apr 07, 2026
Key Takeaways
- If two nodes apply the same log entries in the same order, they end up with the same state.
- Consensus algorithms exist mainly to agree on what the next log entry is.
- A replicated log is the cleanest way to combine durability, ordering, and replication into one primitive.
- Once you have a replicated log, you can build databases, queues, lock services, and event streams on top of it without solving consensus again.
How It Works
- A leader takes a client command and appends it to its local log.
- It copies the entry to followers using a consensus protocol like Raft or Multi Paxos.
- Once a majority quorum has stored the entry, the leader marks it committed and moves the high watermark.
- Each replica applies committed entries in order to its state machine. Same input plus same order gives same state.
Where It Is Used
- etcd’s raft log is a replicated log. The boltdb store on each node is a state machine that gets built from it.
- Kafka exposes its log directly as the API. Every topic partition is a replicated log.
- CockroachDB and TiKV run thousands of small Raft groups, each one managing one replicated log per data range.