CAP Theorem

In a distributed read/write store, you cannot guarantee atomic consistency, availability of every non-failed node, and tolerance of arbitrary message loss at once. The result is an impossibility theorem about a specific system model. It is not the slogan “pick any two of three” taken as a product taxonomy.