Brewer’s Conjecture and the Feasibility of…

The CAP theorem asks what a replicated service can promise when the network splits. Read it to see how one completed write and one later isolated read force an exact choice: answer from incomplete knowledge or wait for communication that may never return.

Reading focus: How the paper defines atomic consistency, availability, and partition tolerance for one distributed read/write object. Why an isolated replica cannot distinguish a delayed write from a missing one, so answering now can be stale while waiting breaks termination. Why timeouts and weaker consistency create practical policies without restoring all three guarantees under the theorem's assumptions.

ACM SIGACT News 2002. Seth Gilbert and Nancy Lynch. 30 min read, very easy difficulty.