On Thu, Sep 13, 2012 at 06:49:49PM +0100, Matthew Mitchell wrote: > A merkle tree root is found by hashing the two children together and those > children are found the same way until you get to the greatest level down the > tree. This means you can validate children as being correct as long as they > hash together to form the root. This means you do not need all the > transaction hashes to validate segments of the block, you only need the root > hashes for all the segments you want. Let's say there are 8 transactions and > you want to verify 4 segments (2 transactions each), The merkle tree looks > like this (Might not work depending on the font):
> I hope that made sense. I'm quite sure Gregory thoroughly understands how Merkle trees work and why they are useful. His question was about the use case. Let me try to answer his question, by making some assumptions about your intentions. Correct me if I'm wrong - I haven't read all details. You want to parallellize block downloads, while at the same time preventing re-download of transactions that are already known. To do so, a requesting node would first request (for example) the 8 level-3 hashes, then start 8 parallel threads to download the transactions from presumably 8 different peers. Each thread then fetches the transaction id's that correspond to its own 1/8th of the block, and requests the transactions whose txid is not yet known. Comparing this with Gregory's own suggestion (just fetch the entire txid list at first, and then (again as parallellized as needed) fetch the unknown transactions from several peers), this does indeed have an advantage: you need to download (relatively) far less data before the threaded part can start. If this is what you propose, it is certainly meaningful, but the gains aren't very large, in my opinion. However, my impression while reading your proposal was at times that you intend to process the different layers of the Merkle tree iteratively after starting the initial parallel segments. I don't think that is useful, as you'll need the actual txids anyway before deciding whether they need to be downloaded at all, it adds several round-trips, and once you have downloaded the intermediate merkle hashes for about 8 levels, you've already transferred more data than the transactions themselves. I think Gregory also assumed something like this, making him question why it's useful. Anyway, this whole paragraph is one assumption, so if it's not the case, ignore me. Can you clarify what you mean? Preferably by giving a concrete sequence of exchanged messages, with a given purpose? PS: the reason Satoshi used a Merkle tree for the transactions in a block was to allow a short piece of data (the hashes along a path in the tree) to prove a transaction belongs to it - I doubt he intended it for parallellizing downloads (though it certainly opens some opportunities here). -- Pieter ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ _______________________________________________ Bitcoin-development mailing list Bitcoin-development@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/bitcoin-development
