Happily Ever After: A CRDT Fairy Tale
summary
CRDTs provide eventual convergence without a central server, trading strict consistency for availability under partitions and improving on OT for peer-to-peer editing. Practical details include the Teletype CRDT implementation (operation-based), an integrateOperations step and setTextInRange for applying edits, left/right dependency checks plus peer id/pun pairs to handle out‑of‑order messages, and a move toward Delta state-based CRDTs to shrink bandwidth; the math uses join‑semi‑lattices to guarantee a least upper bound.
AI-written summary · about
chapters (6)
related talks
50mCRDTs in Practice
49mWhat CRDTs, distributed editing and the speed of light means to your writer friends
32mCRDT and other new ideas for client-server communication
33mDoes the network seem thin up here? Collaborating with mountaintop mesh networks
13mHow to make a real-time collaborative text editor in 5 easy steps!
35mData Types for Eventually Consistent Databases
29mHow to Read the Exact Time When You Have a Billion Clocks
23mBuilding Offline and Real-Time Applications - The Magic of CRDTs