Author: Peter Todd 2016-05-18 23:53:36
Published on: 2016-05-18T23:53:36+00:00
The email thread discusses the proposed TXO commitments using Merkle Mountain Range, a type of deterministic, indexable, insertion-ordered merkle tree. The MMR implementation with pruning support is available on Github, where item retrieval by index is implemented and changing elements in-place is yet to be implemented. The original MMR scheme developed for OpenTimestamps is insufficient as it doesn't prove the position in the tree very well. However, the proofchains MMR scheme fixes this problem by making each inner node in the MMR commit to the total number of elements under it. The proposal of having both an append-only TXO and an append-only STXO was discussed, but it wouldn't work as the STXO would need to be indexed by outpoint or txout creation order, which is similar to insertion-ordered TXO commitment. It is interesting how a merbinner tree, when insertion-order indexed, ends up with a data structure that's almost identical to a MMR.
Updated on: 2023-06-11T05:26:14.878265+00:00