Pith. sign in

REVIEW 3 cited by

Merkle-CRDTs: Merkle-DAGs meet CRDTs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.00107 v2 pith:4OLSXQIG submitted 2020-03-31 cs.NI

Hector Sanjuan , Samuli Poyhtari , Pedro Teixeira , Ioannis Psaras This is my paper · ORCID
classification cs.NI
keywords merkle-crdtsmerkle-dagsapplicationscrdtsdatadeviceslayerproperties
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study Merkle-DAGs as a transport and persistence layer for Conflict-Free Replicated Data Types (CRDTs), coining the term Merkle-CRDTs and providing an overview of the different concepts, properties, advantages and limitations involved. We show how Merkle-DAGs can act as logical clocks giving Merkle-CRDTs the potential to greatly simplify the design and implementation of convergent data types in systems with weak messaging layer guarantees and a very large number of replicas. Merkle-CRDTs can leverage highly scalable distributed technologies like DHTs and PubSub algorithms running underneath to take advantage of the security and de-duplication properties of content-addressing. Examples of such content-oriented systems could include peer-to-peer content exchange and synchronisation applications between opportunistically connected mobile devices, IoT devices or user applications running in a web browser.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Byzantine Accountability Without Consensus: Strong Eventual Consistency for Non-Associative, Stochastic, Robust Aggregation

    cs.DC 2026-07 conditional novelty 6.0 of 10

    Any pure function of a product of CRDTs inherits Strong Eventual Consistency, so multi-Krum and similar discontinuous robust selectors can be made coordinator-free and accountable via OR-Set contributions plus grow-on...

  2. Memory-Exhaustion Attack on the Blocklace Byzantine-Repelling Conflict-Free Replicated Data Type

    cs.DC 2026-07 accept novelty 5.0 of 10

    A blocklace node can be forced to replicate arbitrarily many useless updates via self-incriminating synthetic identities, exhausting its memory.

  3. IDSS, a Novel P2P Relational Data Storage Service

    cs.DB 2025-07 conditional novelty 5.0 of 10

    IDSS uses a DHT-based P2P overlay over embedded SQLite databases to broadcast, execute, and merge SQL queries, including aggregate functions and limited nested queries, across all peers.

Pith tools