Hacker News Reader

Those are lovely data structures and I know about them. But how are you planning on using those data structures? What CRDT are you building?

You might also be interested in Alex Good's Beelay algorithm: https://www.youtube.com/watch?v=neRuBAPAsE0

View on HN

Prolly trees can act as CRDTs if you have a merge function that always merges and doesn’t block.

So my initial comment merely tried to make the point that there is a design space where you’re not stuck with the tradeoff of carrying the full Merkle DAG history just to be able to reconstruct the latest version of your document.

Thanks for the video, will check it out!

Reply on news.ycombinator.com