Provably correct synchronisation in near linear time
I am thrilled that our latest paper on data synchronisation is out and freely available! For the first time it uses our previous theoretical results to provide algorithms and a sample implementation that run in near linear time.
This, finding a provably correct subquadratic synchronisation algorithm for many filesystems was one of the main theoretical problems in operational transformation (OT) and conflict-free replicated data types (CRDT). It's great to see our research into the algebraic theory of filesystem synchronisation leading to this wonderful result, which we hope will pave the way to speed up a host of collaboration and decentralised data tools in the cloud.