CAP theorem

RU: теорема CAP

A fundamental theorem in distributed systems proving that a system can guarantee at most two out of three properties simultaneously: Consistency (linearizability), Availability (any non-failing node returns a non-error response), and Partition Tolerance (the system continues to operate despite dropped or delayed messages). Since physical network partitions are inevitable, systems must choose between consistency (CP) and availability (AP) when a partition occurs.