@techreport{bryce-cose-merkle-mountain-range-proofs-02,
    number =    {draft-bryce-cose-merkle-mountain-range-proofs-02},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-bryce-cose-merkle-mountain-range-proofs/02/},
    author =    {Robin Bryce},
    title =     {{Merkle Mountain Range for Immediately Verifiable and Replicable Commitments}},
    pagetotal = 22,
    year =      2024,
    month =     nov,
    day =       26,
    abstract =  {This specification describes the COSE encoding of proofs for post- order traversal binary Merkle trees, also known as history trees and Merkle mountain ranges. Proving and verifying are defined in terms of the cryptographic asynchronous accumulator described by ReyzinYakoubov (https://eprint.iacr.org/2015/718.pdf). The technical advantages of post-order traversal binary Merkle trees are discussed in CrosbyWallachStorage (https://static.usenix.org/event/sec09/tech/full\_papers/crosby.pdf) and PostOrderTlog (https://research.swtch.com/tlog\#appendix\_a).},
}