CAP Theorem Explained: Why Distributed Systems Can't Have It All

The CAP theorem, formally proven by Gilbert and Lynch, states that a distributed system cannot simultaneously guarantee consistency, availability, and partition tolerance during a network failure. This is illustrated by a hotel booking scenario where two servers, cut off from each other, each confirm the same room to different guests — a logically impossible outcome. When a network partition occurs, a server must choose between refusing requests to preserve data integrity or continuing to respond at the risk of conflicting states. The theorem is often simplified as a 'pick two' triangle, but this framing can be misleading, as partition tolerance is not truly optional in real-world distributed networks. Understanding CAP requires recognizing that the trade-off is not a design flaw but a fundamental constraint imposed by the limits of communication between nodes.