CRDT: Text Buffer - Made by Evan
Collaboratively editing strings of text is a common desire in peer-to-peer applications. For example, a note-taking app might represent each document as a single collaboratively-edited string of text. The algorithm presented here is one way to do this. It comes from a family of algorithms called CRDTs, which I will not describe here. It's similar to the approaches taken by popular collaborative te
An Interactive Intro to CRDTs | jakelazaroff.com
Have you heard about CRDTs and wondered what they are? Maybe you’ve looked into them a bit, but ran into a wall of academic papers and math jargon? That was me before I started my Recurse Center The Recurse Center The Recurse Center is a self-directed, community-driven educational retreat for programmers in New York City. www.recurse.com/ batch. But I’ve spent the past month or so doing research a
Peritext: A CRDT for Rich-Text Collaboration
Two editors are asynchronously collaborating on a rich-text document. Each editor makes local changes, and when they periodically sync, the Peritext CRDT ensures that they converge to seeing the same formatted document. This example is live running code. A revised PDF version of this article has been accepted to CSCW 2022 and published in the PACM HCI journal. Please cite it as: Geoffrey Litt, Sar
CRDTs go brrr
5000x faster CRDTs: An Adventure in Optimization July 31 2021 A few years ago I was really bothered by an academic paper. Some researchers in France put together a comparison showing lots of ways you could implement realtime collaborative editing (like Google Docs). They implemented lots of algorithms - CRDTs and OT algorithms and stuff. And they benchmarked them all to see how they perform. (Cool
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
"New algorithms for collaborative text editing" by Martin Kleppmann (Strange Loop 2023)
https://nomad.foo/blog/cola
