Author: G. Andrew Stone 2017-02-23 18:28:18
Published on: 2017-02-23T18:28:18+00:00
On Feb 23, 2017, Peter Todd via bitcoin-dev initiated a discussion on whether an insertion-ordered MMR (Modified Merkle Tree) can allow an efficient non-existence proof. The proposal defines a prunable MMR with an implicit commitment to the number of items in the tree for a better TXO (Transaction Output) commitment. This enhances the efficiency of the proof-of-tree-size by following the right-most nodes. The discussion revolves around how MMRs could be used to solve issues related to TXO commitments. The insertion-ordered MMR is expected to enhance the efficiency of non-existence proofs and make way for better TXO commitments.
Updated on: 2023-06-11T21:40:52.500179+00:00