Glossary · Term

conflict-free replicated data type

← all terms

Definition

Plain language

A kind of shared data built so separate copies can be edited independently and always merge back together cleanly.

As stated in the literature

CRDT — a data structure whose operations commute so concurrent replicas converge without coordination; only applicable when operations are order-independent, which limits its use for general agent state.

Also called: CRDT, CRDTs

Why it matters: It lets separate copies of data be edited at the same time and reconciled automatically, avoiding the need for constant coordination between them.

For example, two people editing the same shared shopping list offline can each add items, and when their phones reconnect both lists merge into one without losing anything.

Heard on the show

“The clean algebraic merges — the conflict-free replicated data type approach — only work for operations that commute, where order doesn't matter.”
Episode 150 — Don't Kill the Loser: A Different Way to Handle Two AI Agents Colliding

Mentioned in 1 episode

  1. 150
    Don't Kill the Loser: A Different Way to Handle Two AI Agents Colliding

Related terms