📅 Original date posted:2017-08-28
📝 Original message:2017-08-28 19:12 GMT+02:00 Gregory Maxwell via bitcoin-dev <
bitcoin-dev at lists.linuxfoundation.org>:
>
> The bits field can only change every 2016 blocks (4 bytes per header),
> the timestamp can not be less than the median of the last 11 and is
> usually only a small amount over the last one (saves 2 bytes per
> header), the block version is usually one of the last few (save 3
> bytes per header).
>
... and I guess the nonce can be arbitrarily truncated as well, just brute
force the missing bits :-P.
> But all these things improvements are just a constant factor. I think
> you want the compact SPV proofs described in the appendix of the
> sidechains whitepaper which creates log scaling proofs.
>
I think that my blog post on compact spv proofs can be helpful also. It
tries to make the pretty compact formulations in the sidechains paper a bit
more graspable by normal people.
http://popeller.io/index.php/2016/09/15/compact-spv-proofs/
Kalle
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20170828/90056415/attachment.html>;
Kalle Rosenbaum [ARCHIVE] /
npub1uw…55zf7
2023-06-07 18:05:08
in reply to nevent1q…d8fw
Author Public Key
npub1uwweecasakwtk96j3vjmkjenhnhyv4rku382txq0kmexjwuh4w2st55zf7Published at
2023-06-07 18:05:08Event JSON
{
"id": "c7ea13f8d2f20c011c3942f68150370f968c7b1251e6300c7dfdc3dd6763d992",
"pubkey": "e39d9ce3b0ed9cbb17528b25bb4b33bcee465476e44ea5980fb6f2693b97ab95",
"created_at": 1686161108,
"kind": 1,
"tags": [
[
"e",
"ebab8f32a88357e13203768f8d39ec3bac3971205019e130f4ff425883df9695",
"",
"reply"
],
[
"p",
"a23dbf6c6cc83e14cc3df4e56cc71845f611908084cfe620e83e40c06ccdd3d0"
]
],
"content": "📅 Original date posted:2017-08-28\n📝 Original message:2017-08-28 19:12 GMT+02:00 Gregory Maxwell via bitcoin-dev \u003c\nbitcoin-dev at lists.linuxfoundation.org\u003e:\n\n\u003e\n\u003e The bits field can only change every 2016 blocks (4 bytes per header),\n\u003e the timestamp can not be less than the median of the last 11 and is\n\u003e usually only a small amount over the last one (saves 2 bytes per\n\u003e header), the block version is usually one of the last few (save 3\n\u003e bytes per header).\n\u003e\n\n ... and I guess the nonce can be arbitrarily truncated as well, just brute\nforce the missing bits :-P.\n\n\n\u003e But all these things improvements are just a constant factor. I think\n\u003e you want the compact SPV proofs described in the appendix of the\n\u003e sidechains whitepaper which creates log scaling proofs.\n\u003e\n\nI think that my blog post on compact spv proofs can be helpful also. It\ntries to make the pretty compact formulations in the sidechains paper a bit\nmore graspable by normal people.\n\nhttp://popeller.io/index.php/2016/09/15/compact-spv-proofs/\n\nKalle\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20170828/90056415/attachment.html\u003e",
"sig": "2fe6dfbe535dafed05c37b90c1f01bfcc2e565cd5f4424a61ff40de6817aaea62cb951d74da4e6335041857f10316e74aa67ca9af0eabc0256f1a72d7b6448ea"
}