Can an insertion ordered MMR allow an efficient nonexistence proof? On Feb 23, 2017 1:20 PM, "Peter Todd via bitcoin-dev" < bitcoin-dev@lists.linuxfoundation.org> wrote:
> On Thu, Feb 23, 2017 at 09:53:58AM -0800, Chris Priest wrote: > > On 2/22/17, Peter Todd via bitcoin-dev > > <bitcoin-dev@lists.linuxfoundation.org> wrote: > > > Reposting something that came up recently in a private discussion with > some > > > academics: > > > > > > Concretely, let's define a prunable MMR with the following grammar. > This > > > definition is an improvement on whats in the python-proofmarshal by > > > committing > > > to the number of items in the tree implicitly; an obvious > max-log2(n)-sized > > > proof-of-tree-size can be obtained by following the right-most nodes: > > > > What problem does this try to solve, and what does it have to do with > bitcoin? > > See the discussion on TXO commitments for how MMR's could be used; a > better MMR > makes for a better TXO commitment. > > -- > https://petertodd.org 'peter'[:-1]@petertodd.org > > _______________________________________________ > bitcoin-dev mailing list > bitcoin-dev@lists.linuxfoundation.org > https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev > >
_______________________________________________ bitcoin-dev mailing list bitcoin-dev@lists.linuxfoundation.org https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
