CAP Theorem

CAP Theorem is the theorem that states that any distributed data store can on provide 2 of the three consistency guarantees, they are:

C - Consistency

Every read will get the most recent write, or an error

A - Availability

Every request receives a non error response but it may not have the most recent write

P - Partition tolerance

The system will continue to operate despite messages being dropped or delayed between nodes