To me the other algorithms described in the list are more novel and interesting:<p><a href="https://madebyevan.com/algos/crdt-tree-based-indexing/" rel="nofollow">https://madebyevan.com/algos/crdt-tree-based-indexing/</a> - for when precise order is critical, like paragraphs in a document. This algorithm is <i>almost</i> like storing adjacency information like a linked list, but is more convergent. Very interesting for [my use-case](<a href="https://www.notion.so/blog/data-model-behind-notion" rel="nofollow">https://www.notion.so/blog/data-model-behind-notion</a>).<p><a href="https://madebyevan.com/algos/crdt-mutable-tree-hierarchy/" rel="nofollow">https://madebyevan.com/algos/crdt-mutable-tree-hierarchy/</a> - for tree-shaped data, like blocks in a Notion page that should have exactly one parent, but allow concurrent re-parenting operations<p><a href="https://madebyevan.com/algos/log-spaced-snapshots/" rel="nofollow">https://madebyevan.com/algos/log-spaced-snapshots/</a> - log space snapshots, for choosing what fidelity of historical information to store. For context, many CRDTs for rich text or sequences store unbounded history so that any edit made at any time can be merged into the sequence. For long-lived documents, this could be impractical to sync to all clients or keep in "hot" memory. Instead, we can decide to compact historical data and move it to cold storage, imposing a time boundary on what writes the system can accept on the hot path. The log-spaced snapshots algorithm here could be used to decide what should be kept "hot", and how to tune the cold storage.
Anyone unsure of what a CRDT is (I think everyone on HN must know by now), this is the perfect intro: <a href="https://www.inkandswitch.com/peritext/" rel="nofollow">https://www.inkandswitch.com/peritext/</a><p>The two most widely used CRDT implementations (combining JSON like general purpose types and rich text editing types) are:<p>- Automerge <a href="https://github.com/automerge/automerge" rel="nofollow">https://github.com/automerge/automerge</a><p>- Yjs <a href="https://github.com/yjs/yjs" rel="nofollow">https://github.com/yjs/yjs</a><p>Both have JS and Rust implementations, and have bindings to most online rich text editors.<p>CRDTs are addictive one you get into them.
CRDTs are often talked about in the same breath as collaborative editing software, but they're useful for much more than that.<p>They really are a theoretical model of how distributed, convergent, multi-master systems have to work. IE the DT in CRDT could be a whole datastore, not as just an individual document.<p>(Wish I could remember who on HN alerted me to this. I had read the paper but didn't grok the full implications).
This stuff is fun to play with. I implemented a Rust version of fractional indexing based on another of Evan’s blog posts.<p><a href="https://docs.rs/fractional_index/latest/fractional_index/" rel="nofollow">https://docs.rs/fractional_index/latest/fractional_index/</a>
CRDTs are incredible. I recommend checking out the original link [1] as well as this “awesome” list [2]<p>[1] <a href="https://madebyevan.com/algos/" rel="nofollow">https://madebyevan.com/algos/</a><p>[2] <a href="https://github.com/alangibson/awesome-crdt" rel="nofollow">https://github.com/alangibson/awesome-crdt</a>
This is basically the idea behind Logoot [Weis_2009] that was improved by LSeq [Nédelec_2013] and later extended to the first block-wise sequence CRDT: LogootSplit [André_2013]. LogootSplit was recently improved as Dotted LogootSplit [1] [Elvinger_2021].<p>Disclamer: I'm the author of Dotted LogootSplit.<p>[Weis_2009] <a href="https://hal.inria.fr/inria-00432368" rel="nofollow">https://hal.inria.fr/inria-00432368</a><p>[Nédelec_2013] <a href="https://hal.archives-ouvertes.fr/hal-00921633/en" rel="nofollow">https://hal.archives-ouvertes.fr/hal-00921633/en</a><p>[André_2013] <a href="https://hal.archives-ouvertes.fr/hal-01246212" rel="nofollow">https://hal.archives-ouvertes.fr/hal-01246212</a><p>[Elvinger_2021] <a href="https://hal.univ-lorraine.fr/tel-03284806" rel="nofollow">https://hal.univ-lorraine.fr/tel-03284806</a><p>[1] <a href="https://github.com/coast-team/dotted-logootsplit" rel="nofollow">https://github.com/coast-team/dotted-logootsplit</a>
This is kind of interesting but "fractional indexing" doesn't seem to be a computer science topic, and I think it might be clearer to treat these indexes as lists of numbers (or ordinals in ω^ω, if you prefer) rather than fractions. Those are simpler to generate and compare than arbitrary-precision fractions. Or as jitl's post suggests, using trees as indexes (I haven't yet looked at jitl's linked articles). Those would presumably have order type ε₀. It's not clear to me why you'd want that, but it seems doable. In all these schemes you might occasionally want a "stop the world garbage collection" where you reset all the indices to be ordinary integers or maybe pairs of integers. I guess that is also doable without having to pause all the updates, at least if you use pairs.
Reminds me a little of "Lexorank" used in Jira[0], except by using decimals instead of base-36 strings, which I guess could be more efficient? The "rebalancing" aspect is interesting because on a long enough timescale for a document you will definitely want to do it. Would love to read up more on any algorithms for doing this in a p2p manner - with a central server it's probably quite easy using some tombstoning or something.<p>[0] <a href="https://stackoverflow.com/questions/40718900/jiras-lexorank-algorithm-for-new-stories" rel="nofollow">https://stackoverflow.com/questions/40718900/jiras-lexorank-...</a>
reminds me a lot of Ford Circle / Farey Diagram / Stern Brocot tree<p>Basically a tree of fractions where you take two rational points on a number line, a/b and c/d, then the next point in the tree is (a+b) / (c+d). Turns out that every single point you create this way has a unique position and never duplicate each other, and it forms a tree like structure.<p><a href="https://en.wikipedia.org/wiki/Ford_circle" rel="nofollow">https://en.wikipedia.org/wiki/Ford_circle</a><p>not sure if this would be useful, but basically it could be a fractional index that has a built in tree structure, since it basically means any fraction is a leaf on a Stern-Brocot tree.
Is this the same as LSeq [1] except rather than using bytes one is basically using digits in a floating point representation (given this is JS where most things are floats)?<p>[1] <a href="https://bartoszsypytkowski.com/operation-based-crdts-arrays-1/" rel="nofollow">https://bartoszsypytkowski.com/operation-based-crdts-arrays-...</a>
Doesn't this end up being effectively a binary heap, with a maximum tree depth of 23 (floating point mantissa precision)? I imagine there must be a rebalancing operation required every so often, possibly more frequently for pathological insertion orders.
Is there a good resource on designing collaborative apps with CRDTS, that is which type of CRDT and conflict resolution to pick for a given application? Something like <a href="https://mattweidner.com/2022/02/10/collaborative-data-design.html" rel="nofollow">https://mattweidner.com/2022/02/10/collaborative-data-design...</a> but generalizes.
Thanks for sharing this, we implemented OT in our real-time editor, but CRDT's potential is evident in creating a collaborative experience, in particular fractional indexing and reparenting of mutable tree for our use cases.<p>We should end the CRDT vs OT debate once and for all.
This looks like great stuff if you follow the pointers, but lists don't make good submissions to HN (which itself is already a list). They tend not to lead to deep discussion because comments are about lowest common denominator of the items on the list, and this is usually pretty generic. What's better is to pick the most interesting item on the list and submit that instead. <a href="https://hn.algolia.com/?dateRange=all&page=0&prefix=true&sort=byDate&type=comment&query=denominator%20list%20by:dang" rel="nofollow">https://hn.algolia.com/?dateRange=all&page=0&prefix=true&sor...</a><p>Edit: let's do that in this case. I've changed the URL from <a href="https://madebyevan.com/algos/" rel="nofollow">https://madebyevan.com/algos/</a> based on <a href="https://news.ycombinator.com/item?id=33764875" rel="nofollow">https://news.ycombinator.com/item?id=33764875</a>.