Cartesian Merkle Tree
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909580066291712 |
|---|---|
| author | Chystiakov, Artem Komendant, Oleh Riabov, Kyrylo |
| author_facet | Chystiakov, Artem Komendant, Oleh Riabov, Kyrylo |
| contents | This paper introduces the Cartesian Merkle Tree, a deterministic data structure that combines the properties of a Binary Search Tree, a Heap, and a Merkle tree. The Cartesian Merkle Tree supports insertions, updates, and removals of elements in $O(\log n)$ time, requires $n$ space, and enables membership and non-membership proofs via Merkle-based authentication paths. This structure is particularly suitable for zero-knowledge applications, blockchain systems, and other protocols that require efficient and verifiable data structures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_10944 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Cartesian Merkle Tree Chystiakov, Artem Komendant, Oleh Riabov, Kyrylo Cryptography and Security This paper introduces the Cartesian Merkle Tree, a deterministic data structure that combines the properties of a Binary Search Tree, a Heap, and a Merkle tree. The Cartesian Merkle Tree supports insertions, updates, and removals of elements in $O(\log n)$ time, requires $n$ space, and enables membership and non-membership proofs via Merkle-based authentication paths. This structure is particularly suitable for zero-knowledge applications, blockchain systems, and other protocols that require efficient and verifiable data structures. |
| title | Cartesian Merkle Tree |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2504.10944 |