[bitcoin-dev] A Better MMR Definition
G. Andrew Stone
g.andrew.stone at gmail.com
Thu Feb 23 18:28:18 UTC 2017
Can an insertion ordered MMR allow an efficient nonexistence proof?
On Feb 23, 2017 1:20 PM, "Peter Todd via bitcoin-dev" <
bitcoin-dev at 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 at lists.linuxfoundation.org> wrote:
> > > Reposting something that came up recently in a private discussion with
> > > academics:
> > >
> > > Concretely, let's define a prunable MMR with the following grammar.
> > > definition is an improvement on whats in the python-proofmarshal by
> > > committing
> > > to the number of items in the tree implicitly; an obvious
> > > 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
> 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 at lists.linuxfoundation.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the bitcoin-dev