This page describes an older version of the product. The latest stable version is 16.4.


CAP Theorem

The CAP theorem, also known as Brewer’s theorem, states that it is impossible for a distributed computer system to simultaneously provide all three of the following guarantees:

  • Consistency (all nodes see the same data at the same time)

  • Availability (node failures do not prevent survivors from continuing to operate)

  • Partition Tolerance (the system continues to operate despite arbitrary message loss)