Intermediate

Distributed Key-Value Store

Build a simplified Dynamo-style store to understand consistent hashing, replication, and the CAP theorem hands-on instead of from a diagram. A key-value store that runs as multiple nodes, distributes data across them, tolerates node failure, and lets you choose your own consistency/availability tradeoff.

~9h

0 / 7 steps

🚀

Intro

What you're building

A key-value store that runs as multiple nodes, distributes data across them, tolerates node failure, and lets you choose your own consistency/availability tradeoff — the ideas behind Dynamo, Cassandra, and Riak, at a scale you can actually run on your laptop.

🔨

Step 1 — Implement consistent hashing

🔨

Step 2 — Replicate writes

🔨

Step 3 — Confront the CAP theorem directly

🔨

Step 4 — Resolve conflicting versions

🎯

Secret Mission

Secret Mission: simulate a partition

🧹

Wrap Up

What you learned

Pro

Test what you just learned

Self-testing is one of the best ways to retain new skills. Unlock project quizzes to check your understanding.

0 / 7 complete