CAP theorem basics
Consistency — every read returns the latest write or an error. Availability — every request receives a non-error response (not necessarily the latest data). Partition tolerance — the system continues despite network splits between nodes.
CP systems: bank ledgers. AP systems: social feeds, DNS.
In practice, partitions happen. The real choice is CP (refuse writes/reads until consistent) vs AP (serve possibly stale data).
CP vs AP examples
| Aspect | CP (Consistency + Partition tolerance) | AP (Availability + Partition tolerance) |
|---|---|---|
| Behaviour during partition | Reject requests or block | Serve from local replica |
| Examples | ZooKeeper, etcd, traditional RDBMS primary | Cassandra, DynamoDB (configurable) |
| Good for | Leader election, inventory locks | Social feeds, analytics, session store |
| Risk | Downtime during partition | Stale reads, merge conflicts |
Behaviour during partition
CP (Consistency + Partition tolerance)Reject requests or blockAP (Availability + Partition tolerance)Serve from local replicaExamples
CP (Consistency + Partition tolerance)ZooKeeper, etcd, traditional RDBMS primaryAP (Availability + Partition tolerance)Cassandra, DynamoDB (configurable)Good for
CP (Consistency + Partition tolerance)Leader election, inventory locksAP (Availability + Partition tolerance)Social feeds, analytics, session storeRisk
CP (Consistency + Partition tolerance)Downtime during partitionAP (Availability + Partition tolerance)Stale reads, merge conflicts
The rest of this guide is part of Pro
Free covers every fresher guide in full. Pro unlocks Senior, Staff and Architect guides across every track.
Still to come · 5 sections
- PACELC extension
- Consistency models in practice
- Choosing for your product
- Handling partitions in design
- Common misconceptions
Test yourself
Answer these before moving on — recall is what makes it stick.