3 ms·
Every change can be preserved in a history/append-only/log/stream. So you don't have to "lose" data from another "winning". However, the algorithm will by defau
by marknadal 12y ago
Every change can be preserved in a history/append-only/log/stream. So you don't have to "lose" data from another "winning". However, the algorithm will by default select one, you can then code it at the app level for the user to select a new winner.
The general case here is very UUID based key/value pairs. Anything beyond that, you should be using CRDTs and OT like algorithms, which I will be building on top of GUN.
However, in the meanwhile, I challenge you to try running the example folder from the GitHub ReadMe and seeing if you can break the automated sync and cause data divergence!
Edit: This person (in the comments below, please upvote him), and my reply, best addresses the most important questions:
https://news.ycombinator.com/item?id=9077969 https://news.ycombinator.com/item?id=9077969