CAP Theorem

A theorem in distributed systems stating that, in the presence of network partitions, a distributed data store can provide at most two of these three guarantees simultaneously: consistency (all nodes see the same data at the same time), availability (every request receives a response), and partition tolerance (the system continues to operate despite message loss or network splits).