Another name for Causal Trees is "RGA" (Replicated Growable Array). They are ~identical algorithms that were published concurrently. E.g., Automerge uses RGA (<a href="https://automerge.org/docs/documents/#lists" rel="nofollow noreferrer">https://automerge.org/docs/documents/#lists</a>).
How does the performance of Causal Trees compare to other CRDT implementations, especially in scenarios with a high frequency of concurrent updates? It seems like a promising approach for collaborative text apps, but I'm curious about its scalability and real-world performance.
This is a really fun post. Really appreciate the time you put into it!<p>Quick note: on mobile, the text inputs for the clients is forcing all the text to be very tiny, and you need to manually zoom in to read it.
> Don’t fret if you’re a fan of central authority though, Figma successfully uses CRDTs server-side to handle the collaborative aspects of their product, as well as Soundcloud and many others.<p>Why bother with CRDTs if you’re doing server-side synchronization?<p>MMORPGs can handle synchronizing thousands of users without problem.