On 4/10/13, Peter Todd <p...@petertodd.org> wrote: > Oh, and while we're at it, long-term (hard-fork) it'd be good to change > the tx hash algorithm to extend the merkle tree into the txouts/txins > itself, which means that to prove a given txout exists you only need to > provide it, rather than the full tx. > > Currently pruning can't prune a whole tx until every output is spent. > Make that change and we can prune tx's bit by bit, and still be able to > serve nodes requesting proof of their UTXO without making life difficult > for anyone trying to spent old UTXO's. The idea is also part of UTXO > proof stuff anyway.
I thought about this before, I like the idea very much. Would such a fork be controversial for anyone? Would anyone oppose to this for some reason I'm missing? -- Jorge Timón http://freico.in/ ------------------------------------------------------------------------------ Precog is a next-generation analytics platform capable of advanced analytics on semi-structured data. The platform includes APIs for building apps and a phenomenal toolset for data science. Developers can use our toolset for easy data analysis & visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter _______________________________________________ Bitcoin-development mailing list Bitcoin-development@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/bitcoin-development
