Eventual Consistency

Eventual consistency is a consistency model used in distributed computing that guarantees that, if no new updates are made to a given data item, all accesses to that item will eventually return the same value. It is the consistency model of choice for systems that prioritize availability over immediate correctness, and it is the practical response to the CAP theorem's impossibility of strong consistency during a network partition. Eventual consistency is not a failure mode. It is a deliberate design choice that accepts temporary divergence in exchange for continuous operation.

The reconciliation mechanisms that make eventual consistency work — vector clocks, gossip protocols, anti-entropy repairs — are the distributed systems equivalent of epidemic algorithms that spread information through populations. The insight is that agreement does not require immediate coordination. It requires only that the system converge faster than it diverges, and that the reconciliation of conflicts is cheaper than the prevention of conflicts. This is the same principle that makes mesh networks and swarm intelligence possible: local disagreement is tolerable as long as global convergence is probable.

Eventual consistency is often misunderstood as "weak" consistency, but this framing is itself weak. Eventual consistency is strong enough for the majority of real-world applications, and the assumption that strong consistency is the default is a historical accident of the relational database era. The systems that scale are those that recognized that most data does not need to be globally consistent at all times. It needs to be consistent enough, soon enough.