{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_topology","feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","contains":"claims, sources, anecdotes, question_graph slice","slug":"thinker-eric-brewer","urls":{"read":"https://miscsubjects.com/api/articles/thinker-eric-brewer/topology"},"how_to_use":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","write":null,"imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/thinker-eric-brewer/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/thinker-eric-brewer/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"graph_topology","name":"Cross-article graph","what":"Merged claims/sources across condition+stack slugs for one question.","urls":{"read":"https://miscsubjects.com/api/articles/thinker-eric-brewer/graph-topology?question=..."}},{"id":"question_graph","name":"Question graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output).","urls":{"read":"https://miscsubjects.com/api/articles/thinker-eric-brewer/question-graph","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","urls":{"read":"https://miscsubjects.com/api/articles/thinker-eric-brewer/voxels","write":"https://miscsubjects.com/api/protocol/claim"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","why":"Every feature is auditable collective intelligence","how":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/thinker-eric-brewer/topology"},"imessage":null,"router":null,"related":[{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"graph_topology","what":"Merged claims/sources across condition+stack slugs for one question."},{"id":"question_graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output)."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."}],"not_medical_advice":true},"slug":"thinker-eric-brewer","title":"Eric Brewer — The CAP Theorem","register":"standard","tags":["oip","kimi-import","self-explaining","voxel","thinkers","thinker-eric-brewer"],"updated_at":"2026-07-15T04:20:33.005Z","body_excerpt":"<!-- hierarchy:nav -->\n> **Path:** [OIP](https://miscsubjects.com/a/oip) › [Thinker Reference](https://miscsubjects.com/a/oip-thinker-reference) › [Thinkers](https://miscsubjects.com/a/oip-thinkers) › **Eric Brewer — The CAP Theorem**\n>\n> **Shelf:** Thinkers · **Traversal:** self-explaining · hierarchical · voxel-ready\n> **Machine root:** [OIP tree](https://miscsubjects.com/api/dispatch?map=1&format=markdown) · [Registry](https://miscsubjects.com/api/dispatch?registry=1)\n\n# Eric Brewer — The CAP Theorem\n\n## §SELF — thinker-eric-brewer\n\n**What this page is:** An explanation of a theorem that governs all distributed computer systems.\n**What it explains:** The CAP theorem and why distributed systems must choose between consistency and availability.\n**Why read it:** To understand why no distributed database can be fully consistent and fully available at the same time.\n\n### What the CAP Theorem Is\n\nThe CAP theorem was proposed by Eric Brewer (born 1965), a computer scientist at UC Berkeley and Google, in a keynote address in 2000. It was formally proved in 2002 by Seth Gilbert and Nancy Lynch of MIT.\n\nCAP names three properties of a distributed data store (a system where data is stored across multiple connected computers):\n\n- **Consistency (C):** Every read receives the most recent write. All nodes (individual computers in the system) see the same data at the same time.\n- **Availability (A):** Every request receives a non-error response. The system responds to every query, even if the data is not the most recent.\n- **Partition tolerance (P):** The system continues to operate despite network partitions — situations where messages between nodes are lost or delayed.\n\nThe theorem states: in a distributed data store, you can guarantee at most two of the three properties.\n\n### Why It Matters\n\nThe theorem matters because network partitions (P) are inevitable in real systems. Cables fail. Routers reboot. Data centers lose connectivity. If a partition occurs, the system must choose: either preserve consistency (C) by refusing some requests, or preserve availability (A) by serving possibly stale data.\n\nThis is not a technological limitation that better engineering will solve. It is a logical limit proved by the Gilbert-Lynch proof.\n\n### The Key Idea: The Trade-off\n\nIf the network partitions (P), you must choose between consistency (C) and availability (A). You cannot have both.\n\n- Choose CP: The system blocks writes until consistency is restored. Some requests fail. The system is consistent but not fully available.\n- Choose AP: The system accepts all writes and serves all reads. Some responses contain stale data. The system is available but not fully consistent.\n\nMost real-world distributed systems choose AP and handle consistency asynchronously (in the background). They accept that different nodes may see different data for a short period, and they resolve differences later.\n\n### What Brewer Got Right\n\n- Identified the three properties that matter in distributed systems design.\n- Showed that the choice between them is a logical necessity, not an engineering failure.\n- Forced system designers to be explicit about which properties they prioritize.\n\n### What Brewer Got Wrong or Left Unfinished\n\n- The theorem is often stated as \"pick two of three,\" which implies you could build a system that is CA (consistent and available) but not partition-tolerant. In practice, network partitions are unavoidable, so every real system must tolerate partitions. The actual choice is between CP and AP, not among all three pairs.\n- The theorem does not quantify the trade-off. It does not say how much consistency you lose for a given gain in availability.\n- Brewer later noted that the theorem describes a binary at partition time, but real systems operate on a spectrum between strong consistency and eventual consistency.\n\n### How It Connects to Other Ideas\n\n- **ACID vs. BASE:** ACID (Atomicity, Consistency, Isolation, Durability) describes the properties of traditi","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","claims":[],"sources":[],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"slug":"thinker-eric-brewer","questions":[],"evidence":[],"edges":[],"counts":{"questions":0,"evidence":0,"edges":0}},"honesty":{"active_claims":0,"retracted_claims":0,"cut_claims":0,"challenges":0,"scrub_events":0,"note":"Retracted/cut claims stay on ledger but are excluded from ask unless ?include_inactive=1"},"counts":{"claims":0,"claims_total":0,"sources":0,"anecdotal":0,"scientific":0,"user_reports":0,"questions":0,"evidence_ingests":0}}