Composing and Decomposing Op-Based CRDTs with Semidirect Products
summary
Construction called the semidirect product composes two op-based CRDTs plus an action function to produce a single CRDT that deterministically resolves concurrent noncommuting operations. Examples: add-only and multiply-only integer registers compose so concurrent multiply and add yield the same final value (Dave and Mary both reach 17 by transforming adds via distributivity under the add-before-mult rule). Works to add multiply to counters, reverse to lists, map over dictionaries, and to decompose sets into add-only and remove-only CRDTs.
AI-written summary · about
chapters (4)
related talks
29mComposing and decomposing op-based CRDTs with semidirect products
48mCRDTs: From sequential to concurrent executions
36mConflict-Free Replicated Datatypes (CRDT)
15mModular Verification of Op-Based CRDTs in Separation Logic
24mCRDT Emulation, Simulation, and Representation Independence
29mAbout Combining Functional Reactive Programming and Replicated Data Types
40mPractical Demystification of CRDT
34mUsing CRDTs Beyond Text Editors
