{
  "id": 932467,
  "title": "CAP Theorem",
  "url": "https://urgent.news/2026/08/15/cap-theorem",
  "topic": "tech",
  "section": "Tech",
  "published": "2026-08-15T02:00:00.000Z",
  "source": {
    "name": "Dev.to",
    "slug": "dev-to",
    "url": "https://dev.to/gouranga-das-khulna/cap-theorem-539k"
  },
  "original_language": "en",
  "account": "The CAP Theorem states that in a distributed system, you can only guarantee two out of the three properties - Consistency, Availability, and Partition Tolerance - at the same time. Consistency ensures every read returns the most recent write or an error, with all nodes seeing the same data simultaneously. Availability guarantees every request receives a non-error response, even if the data may be stale. Partition Tolerance ensures the system keeps functioning when network partitions occur, preventing nodes from communicating.\n\nIn practice, partitions are inevitable, so the choice is between CP (Consistency and Partition Tolerance) or AP (Availability and Partition Tolerance). CP systems prioritize correctness over availability, refusing to respond during partitions to avoid serving stale data. Examples include HBase, Zookeeper, etcd, MongoDB (by default), and Google Spanner. AP systems prioritize availability over correctness, responding with potentially stale data during partitions. Examples include Cassandra, DynamoDB, CouchDB, DNS, and Riak.\n\nDatabases can be classified as CA (single node, consistent), CP (distributed, strong consistency), AP (availability and partition tolerance), or eventually consistent. Tunable consistency allows systems like Cassandra to balance consistency and availability based on the required level of consistency for each operation. The PACELC theorem extends CAP, considering latency alongside partitioning scenarios. Ultimately, the choice between CP and AP depends on the specific business needs, with financial data requiring CP and social data being suited for AP.",
  "summary": "One-liner: In a distributed system, you can only guarantee two of three properties — Consistency, Availability, and Partition Tolerance — at the same time. 📌 The Three Properties C — Consistency Every read returns the most recent write (or an error). All nodes see the same data at the same time. Node A: Write x=5 Node B: Read x → must return 5 (not an old value) A — Availability Every request…",
  "key_points": [],
  "editors_take": "The CAP Theorem fundamentally reshapes database design by forcing a trade-off between consistency, availability, and partition tolerance, with system architects choosing between CP and AP based on specific business requirements.",
  "illustration": null,
  "coverage": {
    "outlets": 1,
    "also_reported_by": []
  },
  "ai_generated": true,
  "disclaimer": "Summaries, key points and the editor’s take are written by software from other outlets’ reporting and may contain errors — always check the linked original."
}