How do CRDTs handle concurrent edits without a central server referee?
CRDTs use mathematically designed operations where the order of execution doesn't matter—they're commutative. Each operation is tagged with metadata (unique IDs, timestamps, site IDs) so every replica can apply the same operations in a consistent order and converge to the same final state.
Answered in
CRDTs: Conflict-Free Collaboration at 60fpsEvery user edits a local replica; operations merge automatically into an identical state regardless of arrival order, with no central locking.
Read the full analysisOther questions this article answers
More system design questions
- Why doesn't Google just run Dijkstra faster?
- What is a shortcut edge and when is it precomputed?
- How much space do shortcut edges take compared to the original graph?
- Can Contraction Hierarchies handle dynamic graphs like traffic or road closure?
- Why contract low-degree nodes first instead of high-degree ones?
- What is a CRDT and why does it matter for real-time collaboration?
- Why did Figma move from operational transforms to CRDTs?
- What's the memory and bandwidth cost of running replicas locally?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.