2020/02/18 by Lum Ramabaja, Arber Avdullahu, Ramabaja, Lum +1 · 1 voice
Computer Science · #Advanced Data Storage Technologies #Caching and Content Delivery #Peer-to-Peer Network Technologies #cs.CR #cs.DS
paper · pdf · doi:10.48550/arxiv.2002.07648
openalex publication_date 2020/02/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 k leaf indices, where k is the number of elements used for creating a multiproof. This significantly reduces the size of multirpoofs, especially for larger Merke trees.