Skip to main content



Synchronizing Many Filesystems in Near Linear Time

The preprint and sample code are now available for the latest result in our Algebraic Theory of Filesystems. Finding a provably correct subquadratic synchronization algorithm for many filesystems is one of the main theoretical problems in Operational Transformation (OT) and Conflict-free Replicated Data Types (CRDT) frameworks. Based on the Algebraic Theory of Filesystems, which incorporates non-commutative filesystem commands natively, we developed and built a proof-of-concept implementation of an algorithm which synchronizes an arbitrary number of replicas. It is provably correct, and has linear complexity after an initial sorting phase. It works by identifying conflicting command pairs and requesting one of them to be removed; can be guided to reach any of the theoretically possible synchronized states. The algorithm allows asynchronous usage. After the client sends a synchronization request, the local replica remains available for further modification. When the synchronization in

Latest Posts

Data Synchronization: A Complete Theoretical Solution for Filesystems

Linear and Logistic Regressions as Degenerate Neural Networks in Keras

Interpreting Neural Networks by Reducing Nonlinearities during Training

Remote Management in 9 Simple Steps: A Quick Practical Guide to Transitioning Away from the Office

Decreasing accuracy in neural nets during training - things to try

The correctness and completeness of algebraic file synchronisers

How much data do you need for an A/B test?

Display the full value of a tensor in Tensorflow / Keras

AI is More Instinct than Intelligence

Display sample predictions during training using Keras callbacks