Tier Nolan [ARCHIVE] on Nostr: π
Original date posted:2019-10-15 π Original message:On Tue, Oct 15, 2019 at ...
π
Original date posted:2019-10-15
π Original message:On Tue, Oct 15, 2019 at 7:29 AM Braydon Fuller via bitcoin-dev <
bitcoin-dev at lists.linuxfoundation.org> wrote:
> So I don't think you can use the height in the coinbase for that
> purpose, as it's not possible to validate it without the previous
> headers. That's common for more than just the height.
>
It is a property of blockchains that the lowest digest for a chain
represents the total chainwork.
Estimate total hash count = N * (2^256) / (Nth lowest (i.e. strongest)
digest over all headers)
To produce a fake set of 10 headers that give a higher work estimate than
the main chain would require around the same effort as went into the main
chain in the first place. You might as well completely build an
alternative chain.
Working backwards for one of those headers, you have to follow the actual
chain back to genesis.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <
http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20191015/449fd686/attachment.html>
Published at
2023-06-07 18:21:04Event JSON
{
"id": "d988a7cc7dd53d15811341b0e809df2e82690664b1b24249c0580221bd4c39a6",
"pubkey": "46986f86b97cc97829a031b03209644d134b939d0163375467f0b1363e0d875e",
"created_at": 1686162064,
"kind": 1,
"tags": [
[
"e",
"a9a6913f6fc9138fe7aab169ce2974e6f08bf4a75cd5918afea0770bbfe2c32f",
"",
"root"
],
[
"e",
"f9f4ffd04ae081ecc129931c08b73cfd26b05946c41c95924324066ff4ddab24",
"",
"reply"
],
[
"p",
"4995923bdd6657e6f16f87fa2c66ee60c7fbc82ae1658289a557fd3c9826cf6f"
]
],
"content": "π
Original date posted:2019-10-15\nπ Original message:On Tue, Oct 15, 2019 at 7:29 AM Braydon Fuller via bitcoin-dev \u003c\nbitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\n\u003e So I don't think you can use the height in the coinbase for that\n\u003e purpose, as it's not possible to validate it without the previous\n\u003e headers. That's common for more than just the height.\n\u003e\n\nIt is a property of blockchains that the lowest digest for a chain\nrepresents the total chainwork.\n\nEstimate total hash count = N * (2^256) / (Nth lowest (i.e. strongest)\ndigest over all headers)\n\nTo produce a fake set of 10 headers that give a higher work estimate than\nthe main chain would require around the same effort as went into the main\nchain in the first place. You might as well completely build an\nalternative chain.\n\nWorking backwards for one of those headers, you have to follow the actual\nchain back to genesis.\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20191015/449fd686/attachment.html\u003e",
"sig": "5e03784a885773752d6481ffa66eea7ec0cbb610250d40e5ee20dfe26feed79a2640321943978a0942333eb9643d827a997bb5484cefdfe1d19351664853db60"
}