Consistency Availability Partitioning theorem by Eric Brewer
Consistency Availability Partitioning theorem by Eric Brewer that essentially posits that a distributed system can only handle one of two: Consistency, Availability or Partitioning (e.g. CA or CP, or AP). In reality there are only two permutations: CA and CP.