faculty at @Yale | co-director of @YaleACL | chief scientist at @lagrangedev | researching and teaching cryptography and security
Aug 22, 2023 • 7 tweets • 2 min read
(1/7) Recproofs () is a Merkle tree with updatable batch proofs. Let me try to unpack this: One attractive feature of Merkle trees is their fast updatability—when a Merkle leaf changes, leaf proofs can be updated with log n hash computations.lagrange.dev/recproofs
(2/7) This is however not true for Merkle batch proofs (A Merkle batch proof is a succinct proof for a set of Merkle leaves.) For one thing, we only know how to compute Merkle batch proofs with SNARKs. Updating such SNARK-based Merkle batch proofs requires re-computing the SNARK.