> As long as you write your state transition functions with certain identities and use appropriate data structures to represent your state you can guarantee a partial ordering for messages and an eventually-consistent state (the only assumption is that all messages are delivered to the replica at some point).
CRDTs are one such approach. Commutativity solves the problem of ordering in a very different way, and turns the consensus problem into a "set membership" rather than a "membership and order" problem. CRDTs have some really nice properties, and are a very active area of research.
CRDTs are one such approach. Commutativity solves the problem of ordering in a very different way, and turns the consensus problem into a "set membership" rather than a "membership and order" problem. CRDTs have some really nice properties, and are a very active area of research.