Compact Merkle Multiproofs

02/18/2020
by   Lum Ramabaja, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2022

P-Index

I propose the P-Index that genuinely constitutes a well-defined, compact...
research
05/01/2019

Separate Chaining Meets Compact Hashing

While separate chaining is a common strategy for resolving collisions in...
research
05/03/2018

Sound Colless-like balance indices for multifurcating trees

The Colless index is one of the most popular and natural balance indices...
research
02/06/2023

Storing a Trie with Compact and Predictable Space

This paper proposed a storing approach for trie structures, called coord...
research
11/19/2019

Extending General Compact Querieable Representations to GIS Applications

The raster model is commonly used for the representation of images in ma...
research
07/22/2012

A New Training Algorithm for Kanerva's Sparse Distributed Memory

The Sparse Distributed Memory proposed by Pentii Kanerva (SDM in short) ...
research
09/12/2018

Compact Optimization Algorithms with Re-sampled Inheritance

Compact optimization algorithms are a class of Estimation of Distributio...

Please sign up or login with your details

Forgot password? Click here to reset