<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Merkle-CRDTs: Merkle-DAGs meet CRDTs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2004.00107/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2004.00107/feed.xml" rel="self" type="application/rss+xml" /><item><title>Merkle-CRDTs: Merkle-DAGs meet CRDTs — mentioned by iamwil</title><link>https://news.ycombinator.com/item?id=39655471</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.00107:39655471</guid><pubDate>Sat, 09 Mar 2024 23:26:59 GMT</pubDate><description>&lt;p&gt;Curious: What do you need something like that for? It sounds like some kind of synced backup of a dataset represented by files on S3? With what you describe, it kinda sounds like a Merkle-DAG CRDT. https://arxiv.org/pdf/2004.00107.pdf The paper describes a Merkle-DAG that can sync two copies together, because it&amp;#x27;s also a CRDT. I don&amp;#x27;t think it&amp;#x27;s exactly what you want, but I think if you&amp;#x27;re building an implementation, it gives you the core ideas of what you&amp;#x27;re looking for. I also detail Merkle-DAGs in my search. https://interjectedfuture.com/crdts-turned-inside-out/ If you&amp;#x27;re looking for…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.00107/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NI</category></item><item><title>Merkle-CRDTs: Merkle-DAGs meet CRDTs — mentioned by afirium</title><link>https://news.ycombinator.com/item?id=34923179</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.00107:34923179</guid><pubDate>Fri, 24 Feb 2023 10:49:06 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2004.00107&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.00107/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NI</category></item><item><title>Merkle-CRDTs: Merkle-DAGs meet CRDTs — HN submission</title><link>https://news.ycombinator.com/item?id=34923178</link><guid isPermaLink="false">urn:hackerpapers:submission:2004.00107:34923178</guid><pubDate>Fri, 24 Feb 2023 10:49:06 GMT</pubDate><description>&lt;p&gt;Merkle-CRDTs: Merkle-Dags Meet CRDTs&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2004.00107/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NI</category></item><item><title>Merkle-CRDTs: Merkle-DAGs meet CRDTs — mentioned by hecturchi</title><link>https://news.ycombinator.com/item?id=30565609</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.00107:30565609</guid><pubDate>Sat, 05 Mar 2022 08:31:01 GMT</pubDate><description>&lt;p&gt;The idea of DAG-embedded CRDTs is far from new and was introduced here: https://arxiv.org/abs/2004.00107 (I&amp;#x27;m among the authors) Unfortunately, the verification that the author proposes (not accepting new updates until the dag below is verified) will need a lot of caveats for real world usage. Currently we use these CRDTs for a key value database of 40M+ keys in a deployment of ipfs-cluster, which uses https://github.com/ipfs/go-ds-crdt .&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.00107/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NI</category></item><item><title>Merkle-CRDTs: Merkle-DAGs meet CRDTs — mentioned by hecturchi</title><link>https://news.ycombinator.com/item?id=29002728</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.00107:29002728</guid><pubDate>Tue, 26 Oct 2021 16:47:37 GMT</pubDate><description>&lt;p&gt;Hehe, or even writing a paper! https://arxiv.org/abs/2004.00107# The link takes you to our Merkle-CRDTs paper, which includes a nice intro to CRDTs in general, so no prior knowledge needed!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.00107/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NI</category></item><item><title>Merkle-CRDTs: Merkle-DAGs meet CRDTs — mentioned by haadcode</title><link>https://news.ycombinator.com/item?id=22921295</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.00107:22921295</guid><pubDate>Mon, 20 Apr 2020 05:11:20 GMT</pubDate><description>&lt;p&gt;Posted this in another reply above, but give this a read: &amp;quot;Merkle CRDTs&amp;quot; (https://arxiv.org/abs/2004.00107).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.00107/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NI</category></item><item><title>Merkle-CRDTs: Merkle-DAGs meet CRDTs — mentioned by haadcode</title><link>https://news.ycombinator.com/item?id=22921225</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.00107:22921225</guid><pubDate>Mon, 20 Apr 2020 04:56:58 GMT</pubDate><description>&lt;p&gt;&amp;gt; Last-Writer-Wins is a conflict resolution strategy that can be used by any kind of data type that needs conflicts resolved, CRDTs included. Unfortunately it&amp;#x27;s not a very good one: even if you use vector clocks instead of wall clocks, it doesn&amp;#x27;t give you much stronger guarantees than determinism. That is, given two concurrent writes, the winner is essentially arbitrary. LWW is a merge strategy of last resort; if that&amp;#x27;s the only thing your CRDT system offers, I&amp;#x27;m not sure it&amp;#x27;s really fair to call it a CRDT system. Can&amp;#x27;t reply to the comment below, so replying here. I believe what…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.00107/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NI</category></item></channel></rss>
