Replicating data in large systems like the Internet is important for availability and fault-tolerance. Traditional strong consistency methods are slow, while weaker methods may not ensure convergence. Eventual consistency, where all replicas eventually match, can be unclear and error-prone. A new approach called update consistency ensures that replicated data is consistent with a linear order of updates, allowing for faster operations. This method is stronger than eventual consistency and can be applied universally in distributed systems.