Compact Merkle Multiproofs
Cryptography and Security
2020-02-25 v2 Data Structures and Algorithms
Abstract
The compact Merkle multiproof is a new and significantly more memory-efficient way to generate and verify sparse Merkle multiproofs. A standard sparse Merkle multiproof requires to store an index for every non-leaf hash in the multiproof. The compact Merkle multiproof on the other hand requires only leaf indices, where is the number of elements used for creating a multiproof. This significantly reduces the size of multirpoofs, especially for larger Merke trees.
Cite
@article{arxiv.2002.07648,
title = {Compact Merkle Multiproofs},
author = {Lum Ramabaja and Arber Avdullahu},
journal= {arXiv preprint arXiv:2002.07648},
year = {2020}
}