Conflict-Free Replicated Data Types.¶
Shapiro, M., Preguiça, N., Baquero, C., & Zawirski, M. (2011). Conflict-Free Replicated Data Types. Stabilization, Safety, and Security of Distributed Systems (SSS 2011).
Cited by¶
6 citations across 6 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Eventual Consistency
- Distributed databases and file sync — local writes accepted without coordination, propagated, and reconciled; conflict-free replicated data types are the deepest formalisation, with mathematically well-defined merges.
This sourceFormalizes CRDTs with commutative, associative, idempotent merge functions guaranteeing convergence without coordination.
Supported in partVerified against the work's full text
Supplies the coordination-free replica update and the formal SEC/CRDT convergence model, but not the claim that CRDTs are the deepest formalisation.
“Replicating data under Eventual Consistency (EC) allows any replica to accept updates without remote synchronisation. This ensures performance and scalability in large-scale distributed systems (e.g., clouds). However, published EC approaches are ad-hoc and error-prone. Under a formal Strong Eventual Consistency (SEC) model, we study sufficient conditions for convergence. A data type that satisfies these conditions …”
- Distributed databases and file sync — local writes accepted without coordination, propagated, and reconciled; conflict-free replicated data types are the deepest formalisation, with mathematically well-defined merges.
- Mission Command
- Distributed systems. Eventual-consistency architectures and CRDTs: each node holds the invariants (the intent) and acts on its local view; the system converges without a central authority adjudicating every write.
This sourceDefines CRDTs: replicas act on local views under a shared commutative/associative/idempotent merge invariant, converging without central coordination.
Supported in partVerified against the publisher's abstract
States that replicas under eventual consistency accept updates without remote synchronisation and that a CRDT satisfies sufficient conditions for convergence; it never speaks of per-node 'invariants' or 'intent'.
“Replicating data under Eventual Consistency (EC) allows any replica to accept updates without remote synchronisation. This ensures performance and scalability in large-scale distributed systems (e.g., clouds). However, published EC approaches are ad-hoc and error-prone. Under a formal Strong Eventual Consistency (SEC) model, we study sufficient conditions for convergence. A data type that satisfies these conditions …”
- Distributed systems. Eventual-consistency architectures and CRDTs: each node holds the invariants (the intent) and acts on its local view; the system converges without a central authority adjudicating every write.
Domain-specific¶
- CAP Theorem (and variants)
- One variant has slightly wider CS reach worth noting: CRDTs (conflict-free replicated data types) are a general tool of optimistic replication — their conflict-free merge algebra applies wherever divergent replicas must converge without coordination, so the same mechanism appears in collaborative text editors and version-control merge as well as in databases
This sourceThe formalisation of conflict-free replicated data types, whose merge algebra makes divergent replicas converge without coordination, with co-operative text editing among the applications the paper names.
Supported in partVerified against the work's full text
“we previously published Treedoc, a sequence CRDT for co-operative text editing”
- One variant has slightly wider CS reach worth noting: CRDTs (conflict-free replicated data types) are a general tool of optimistic replication — their conflict-free merge algebra applies wherever divergent replicas must converge without coordination, so the same mechanism appears in collaborative text editors and version-control merge as well as in databases
Mechanisms¶
- Commutative Updates
- Its strength is coordination-free concurrent writes with no lost updates — the natural fit for tallies, reaction counts, presence sets, and any state that is fundamentally accumulated rather than set.
This sourceShows how CRDT replicas accept concurrent updates without foreground synchronization and converge without losing increments, with grow-only counters and sets used for click, reaction, and presence-like accumulated state.
- Its strength is coordination-free concurrent writes with no lost updates — the natural fit for tallies, reaction counts, presence sets, and any state that is fundamentally accumulated rather than set.
- CRDT-Like State Merge
- Because the merge is a least upper bound, replicas that have seen the same updates are identical, and the system reaches strong eventual consistency
This sourceDerives strong eventual consistency from least-upper-bound merging: replicas that have received the same updates converge to the same state.
- Because the merge is a least upper bound, replicas that have seen the same updates are identical, and the system reaches strong eventual consistency
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 3 of 6 citations: 3 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:94058d233ebc · see in the full table