Paper 2025/234
Merkle Mountain Ranges are Optimal: On witness update frequency for cryptographic accumulators
Abstract
We study append-only set commitments with efficient updates and inclusion proofs, or cryptographic accumulators. In particular, we examine how often the inclusion proofs (or witnesses) for individual items must change as new items are added to the accumulated set. Using a compression argument, we show unconditionally that to accumulate a set of
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- authenticated data structuresaccumulatorsblockchainlower boundsMerkle Mountain Range
- Contact author(s)
-
jcb @ cs nyu edu
jessicachen @ nyu edu
mchrist @ cs columbia edu
ikaranta @ gmu edu - History
- 2025-02-17: approved
- 2025-02-14: received
- See all versions
- Short URL
- https://ia.cr/2025/234
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/234, author = {Joseph Bonneau and Jessica Chen and Miranda Christ and Ioanna Karantaidou}, title = {Merkle Mountain Ranges are Optimal: On witness update frequency for cryptographic accumulators}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/234}, year = {2025}, url = {https://eprint.iacr.org/2025/234} }