📅 Original date posted:2017-02-23 📝 Original message:On Thu, Feb 23, 2017 at ...

Peter Todd [ARCHIVE] /

npub1m23…2np2

2023-06-07 17:56:31

in reply to nevent1q…q39r

📅 Original date posted:2017-02-23
📝 Original message: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 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
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 455 bytes
Desc: Digital signature
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20170223/8a77c8e5/attachment.sig>;

Author Public Key

npub1m230cem2yh3mtdzkg32qhj73uytgkyg5ylxsu083n3tpjnajxx4qqa2np2

Show more details

Published at

2023-06-07 17:56:31

Kind type

1 Short Text Note

Event JSON

{ "id": "216ee8663171a17de0bd90fb66dde4bea24a0b6dd83d4d3f8aeba582bf2cb02d", "pubkey": "daa2fc676a25e3b5b45644540bcbd1e1168b111427cd0e3cf19c56194fb231aa", "created_at": 1686160591, "kind": 1, "tags": [ [ "e", "7c1fe6216790fb2846f605436edee6db0e33feb9c670df2e38b3b46417cf9504", "", "root" ], [ "e", "2e3fe13e42572e805d5d491ebfab8dd1caab0206af97c2890bd22cba36fdf504", "", "reply" ], [ "p", "3b5311200328974edeaa105b1a8f60d243e653cc63b6bb29f61dc696e04189ed" ] ], "content": "📅 Original date posted:2017-02-23\n📝 Original message:On Thu, Feb 23, 2017 at 09:53:58AM -0800, Chris Priest wrote:\n\u003e On 2/22/17, Peter Todd via bitcoin-dev\n\u003e \u003cbitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\u003e \u003e Reposting something that came up recently in a private discussion with some\n\u003e \u003e academics:\n\u003e \u003e\n\u003e \u003e Concretely, let's define a prunable MMR with the following grammar. This\n\u003e \u003e definition is an improvement on whats in the python-proofmarshal by\n\u003e \u003e committing\n\u003e \u003e to the number of items in the tree implicitly; an obvious max-log2(n)-sized\n\u003e \u003e proof-of-tree-size can be obtained by following the right-most nodes:\n\u003e \n\u003e What problem does this try to solve, and what does it have to do with bitcoin?\n\nSee the discussion on TXO commitments for how MMR's could be used; a better MMR\nmakes for a better TXO commitment.\n\n-- \nhttps://petertodd.org 'peter'[:-1]@petertodd.org\n-------------- next part --------------\nA non-text attachment was scrubbed...\nName: signature.asc\nType: application/pgp-signature\nSize: 455 bytes\nDesc: Digital signature\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20170223/8a77c8e5/attachment.sig\u003e", "sig": "4160938596d34a7251e2a75e9f847d5824284e011ae828e9caead71250e843574c7d03473f69109575f54412fe01984f11bc0072c7c6ec88d024af78049752ae" }