• Introduces a new conflict model for collaborative data structures enabling explicit local-first resolution. • Uses semantic dependencies between operations to detect conflicts instead of opaque CRDT logic. • Resolves conflicts by rebasing onto a reconciling operation via a three‑way merge over a replicated journal. • Demonstrated on collaborative registers, including explicit Last‑Writer‑Wins and semi‑automatic multi‑register entity. • Eliminates need for centralized coordination, preserving offline work and reducing latency. • Provides a framework that can be extended to other CRDTs and collaborative primitives.

Article Summaries:

  • A recent arXiv submission proposes a new “Semantic Conflict Model” for collaborative data structures that moves beyond the opaque conflict resolution of traditional Conflict‑Free Replicated Data Types (CRDTs). The model identifies conflicts by examining semantic dependencies between concurrent operations and resolves them locally by rebasing conflicting operations onto a reconciling operation through a three‑way merge over a replicated journal. Unlike existing reconciliation methods that rely on centralized coordination, this approach enables explicit, local‑first conflict resolution. The authors demonstrate the model on collaborative registers, providing an explicit formulation of a Last‑Writer‑Wins register and a multi‑register entity that supports semi‑automatic reconciliation.

Sources: