A Conflict Tree Replicated Data Type for Co-Operative Editing

A conflict tree replicated datotype is one that, once body has received all the information about what went into it, all those datotypes compute the same value. There are essentially two ways to achieve that. One is commutivity, and then there's an operational c r d t. And so it's got a different set of rules that if you were to follow these rules within your dato type, it would still converge to the same outcome. Inucan: I'm not sure if this is one of the fallacies of distributed computing, but messages always arrive in order. That is definitely a fallacy. The history of serdites is alittle et interesting. You can kind