Daily Level-Up
19 lessons · System Design
Latest
- 2026-06-22Anti-Entropy with Merkle Trees: Syncing Replicas Without Comparing Every RecordSystem Design · Consistency & Replication
- 2026-06-21Hinted Handoff: Remembering Writes for Nodes That Were AwaySystem Design · Consistency & Replication
- 2026-06-20Read Repair: Healing Stale Replicas on the FlySystem Design · Consistency & Replication
- 2026-06-19Monotonic Read Consistency: Preventing Time from Running BackwardsSystem Design · Consistency & Replication
- 2026-06-18Sloppy Quorums: Staying Available When Your Cluster Partially FailsSystem Design · Consistency & Replication
System Design
Caching
Consistency & Replication
- 2026-06-22Anti-Entropy with Merkle Trees: Syncing Replicas Without Comparing Every Record
- 2026-06-21Hinted Handoff: Remembering Writes for Nodes That Were Away
- 2026-06-20Read Repair: Healing Stale Replicas on the Fly
- 2026-06-19Monotonic Read Consistency: Preventing Time from Running Backwards
- 2026-06-18Sloppy Quorums: Staying Available When Your Cluster Partially Fails
- 2026-06-14Change Data Capture: Streaming Every Write Without Touching Your Application Code
- 2026-06-11Gossip Protocol: How Distributed Nodes Reach Agreement Without a Leader
- 2026-06-10Vector Clocks: Tracking Causality Without a Central Clock
- 2026-06-09Quorum Reads & Writes: Tunable Consistency Without a Single Master
- 2026-06-07Read-Your-Writes Consistency: Guaranteeing You See Your Own Changes
Partitioning & Hashing
Storage & Indexing
- 2026-06-17Fractional Cascading: Slashing Repeated Binary Search Across Sorted Lists
- 2026-06-16Copy-on-Write B-Trees: Crash Safety Without a Write-Ahead Log
- 2026-06-15Skip Lists: Probabilistic Indexing Without Tree Rebalancing
- 2026-06-13Bitmap Indexes: Crushing Analytical Queries With Bitwise Math
- 2026-06-12Bloom Filters: Skipping Disk Reads You Know Will Miss
- 2026-06-08LSM Trees: Why Write-Heavy Databases Abandon B-Trees
- 2026-06-07Write-Ahead Logging (WAL): Durability Without Sacrificing Speed