š
Original date posted:2017-05-15
š Original message:Good morning Pieter,
>4. Use cases
>
>* Replacement for Bitcoin Core's gettxoutsetinfo RPC's hash
>computation. This currently requires minutes of I/O and CPU, as it
>serializes and hashes the entire UTXO set. A rolling set hash would
>make this instant, making the whole RPC much more usable for sanity
>checking.
>* Assisting in implementation of fast sync methods with known good
>blocks/UTXO sets.
>* Database consistency checking: by remembering the UTXO set hash of
>the past few blocks (computed on the fly), a consistency check can be
>done that recomputes it based on the database.
Another use case I can think of is a potential "chain-flip" hard fork of block header formats, where the UTXO hash rather than merkle tree root of transactions is in the header, which would let lite nodes download a UTXO set from any full node and verify it by verifying only block headers starting from genesis.
Regards,
ZmnSCPxj
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20170515/7e39b541/attachment.html>;
ZmnSCPxj [ARCHIVE] /
npub1g5ā¦3ms3l
2023-06-07 18:01:13
in reply to nevent1qā¦g6g2
Author Public Key
npub1g5zswf6y48f7fy90jf3tlcuwdmjn8znhzaa4vkmtxaeskca8hpss23ms3lPublished at
2023-06-07 18:01:13Event JSON
{
"id": "014365faeda2bece44fbf3f5707dd78d2ac3f7788e479a03638ea4dc9dc81d57",
"pubkey": "4505072744a9d3e490af9262bfe38e6ee5338a77177b565b6b37730b63a7b861",
"created_at": 1686160873,
"kind": 1,
"tags": [
[
"e",
"2462c5efea084ebfedb9b64774e4a3c5d144e23fcea0a84ec9dd98127404e039",
"",
"root"
],
[
"e",
"35fb5041cfde35a07e6d1796eeec90ee1bfc9c5f428242c4b8062985f98d1dbe",
"",
"reply"
],
[
"p",
"6185f02289f12c01c6f7c80cdc0331a01eae9c6356f228be12efdb7fb395bc19"
]
],
"content": "š
Original date posted:2017-05-15\nš Original message:Good morning Pieter,\n\n\u003e4. Use cases\n\u003e\n\u003e* Replacement for Bitcoin Core's gettxoutsetinfo RPC's hash\n\u003ecomputation. This currently requires minutes of I/O and CPU, as it\n\u003eserializes and hashes the entire UTXO set. A rolling set hash would\n\u003emake this instant, making the whole RPC much more usable for sanity\n\u003echecking.\n\u003e* Assisting in implementation of fast sync methods with known good\n\u003eblocks/UTXO sets.\n\u003e* Database consistency checking: by remembering the UTXO set hash of\n\u003ethe past few blocks (computed on the fly), a consistency check can be\n\u003edone that recomputes it based on the database.\n\nAnother use case I can think of is a potential \"chain-flip\" hard fork of block header formats, where the UTXO hash rather than merkle tree root of transactions is in the header, which would let lite nodes download a UTXO set from any full node and verify it by verifying only block headers starting from genesis.\n\nRegards,\nZmnSCPxj\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20170515/7e39b541/attachment.html\u003e",
"sig": "7ae5db86d9116174e8183aa102034d94a6860f2f2f77aa406e81a87b24c6067c86b6664e696caa0c18803845663d05b61c58ffcd519c3e828816a78ca63da9c5"
}