3 ms·
I wonder how well that scales and how it handles network partitions or erratic peers.
by EternalFury 2y ago
I wonder how well that scales and how it handles network partitions or erratic peers.
- toomim 2y agoYou can use CRDT algorithms with Braid that heal from network partitions transparently, and guarantee strong eventual consistency. Here's an example CRDT algorithm for collaborative text that can handle arbitrary network partitions, and guarantee full eventual consistency, and prune all unnecessary history: https://braid.org/antimatter https://braid.org/antimatter This algorithm is the first to do so, and happened to be developed in the Braid group. As for scaling, check out JosephG's https://josephg.com/blog/crdts-go-brrr/ https://josephg.com/blog/crdts-go-brrr/ CRDT, which scales great, and is thoroughly tested. The Braid protocol is also architected with a new type of OT/CRDT architecture called a Time Machine that lets you do advanced things like apply backpressure through a network to decrease the frequency of updates, which we presented in https://braid.org/meeting-81 https://braid.org/meeting-81, and are releasing in the https://github.com/braid-org/braid-text https://github.com/braid-org/braid-text library that you can try right now.