Reckle Trees: Updatable Merkle Batch Proofs with Applications

ePrint Report: Reckle Trees: Updatable Merkle Batch Proofs with Applications

Charalampos Papamanthou, Shravan Srinivasan, Nicolas Gailly, Ismael Hishon-Rezaizadeh, Andrus Salumets, Stjepan Golemac

We propose Reckle trees, a new vector commitment based on succinct RECursive arguments and MerKLE trees. Reckle trees' distinguishing feature is their support for succinct batch proofs that are updatable - enabling new applications in the blockchain setting where a proof needs to be computed and efficiently maintained over a moving stream of blocks. Our technical approach is …

applications batch eprint report feature merkle report support trees