Op-based Observed-Remove Set (OR-Set), a Conflict-free Replicated Data Type (CRDT)

Offline-first CRDT sync engine in Rust — delta-state CRDTs (LWW-Map, OR-Set), vector clocks, sled persistence, Tokio networking, and a demo CLI.

An Observed-Remove Set (OR-Set) is a Powerful CRDT that Solves the Specific Problem in Distributed Systems of Allowing Elements to be Added and Removed Multiple Times Without Losing Data During Concurrent Updates

A distributed Observed-Remove Set (OR-Set) CRDT in Go. Features Add-Wins semantics, causal DotContexts, and delta-state peer-to-peer gossiping for eventual consistency without distributed locks.

An add-wins OR-set CRDT RDF-datastore

Make a `knockout.ObservableArray` out of CRDT set or document

CRDTs: G-Counter, PN-Counter, LWW-Register, OR-Set with merge.

State-based OR-Set CRDT implementation in C++ with comprehensive benchmarks and test suite

This is a Last-Writer-Wins Element Set(lww-set) data structure implemented in Swift language. Conceptually, lww-set is an Operation-based Conflict-Free Replicated Date Type(CRDT). It can achieve strong eventual consistency and monotonicy. We used to use applications such us calendar or Evernote for a long time. They have something in common — at the same time all of them allow (in any combination) to work offline to access from different devices several people to modify the same data