The CAP theorem describes a tradeoff in distributed systems: during a network partition, a system cannot guarantee both consistency and availability. Consistency means users see the same, up-to-date data; availability means requests still receive a response. The familiar “pick two of three” shorthand can mislead: when a partition occurs, the choice is between consistency and availability. section 2.9 section 7.3.5
The last ticket
If New York and London lose contact, each may try to sell the same last ticket. Waiting for London’s confirmation protects consistency but leaves the New York buyer waiting. Selling immediately keeps the service available but risks selling the ticket twice. section 2.9
The business context guides the decision. A bank transfer should favor consistent balances; a social feed may favor availability even if a new post or connection appears late. In a multi-region system, partitions cannot simply be ruled out, and even excessive latency can force a similar choice. Ask which failure is more acceptable: delayed or unavailable service, or temporarily stale data. section 2.9.1 section 7.3.5






