eg-strider improves Eg-walker, beating the previous fastest CRDT on every metric
vaibhavk97 · x · 2026-10-26
jzhao introduces eg-strider, a set of improvements atop the Eg-walker collaborative text editing algorithm, claiming significantly better performance on every measurable axis: merge time, reopen time, peak memory, memory at rest, and snapshot size.
The post explains Eg-walker's core idea: OT is fast for sequential merges but blows up on large concurrent merges, while CRDTs merge concurrency well but carry heavy per-character metadata and load slowly. Eg-walker builds an event graph of index-based operations, applying sequential edits directly and constructing CRDT-like state only temporarily to resolve concurrent ones. eg-strider optimizes these paths further, with benchmarks visualized on a Twitter language corpus.
More from Research
- MIT paper uses LLMs to measure ambiguity in laws and AI constitutions, EMNLP 2026 Oral — sebkrier · 2026-10-26
- ELLIS PhD Program opens 2026 applications, deadline October 31 — CSProfKGD · 2026-10-26
- Loss curves show the right inductive bias buys a large training efficiency gap — mike64_t · 2026-10-26
- Watch an LLM think: 3D visualization traces a prompt through all 64 layers of Qwen3.8-27B — gamedevsam · 2026-10-26
- Fortnow asks when algorithmic results are plausibly optimal, from Metric TSP to matrix mult — fortnow · 2026-10-26
- Domingos Clashes With OpenAI's Brockman Over the Curse of Dimensionality — AlexTensor · 2026-10-26