On Mon, May 15, 2017 at 11:04 PM, ZmnSCPxj via bitcoin-dev
wrote:
> 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.
Ya, lite nodes with
Today someone showed up on IRC suggesting a scheme for to improve the
ability of miners to mine without validation while including transactions
by shipping around an approximate sketch of the txins that were used by a
block.
I pointed out that what sounded like the exact same scheme had been
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
Hi Pieter,
I wanted to say that I thought this write-up was excellent! And efficiently
hashing the UTXO set in this rolling fashion is a very exciting idea!!
Peter R
> On May 15, 2017, at 1:01 PM, Pieter Wuille via bitcoin-dev
> wrote:
>
> Hello all,
Hello all,
I would like to discuss a way of computing a UTXO set hash that is
very efficient to update, but does not support any compact proofs of
existence or non-existence.
Much has been written on the topic of various data structures and
derived hashes for the UTXO/TXO set before (including
Good morning Luke,
Considering the proposal as a whole, I think, it's a little imperfect.
The main problem, is that the end goal is activation, but what the opcode
rewards is signalling.
Consider a miner who signals only if the number of non-signalling blocks in
this retargeting time > 5% of