[BitTorrent] Have maps (was Merkle, URLs, etc)

Olaf van der Spek OvdSpek at LIACS.NL
Thu Mar 10 15:12:28 EST 2005


Joseph Ashwood wrote:
> ----- Original Message ----- 
> From: "Elliott Mitchell" <ehem at m5p.com>
> Subject: Re: [BitTorrent] Have maps (was Merkle, URLs, etc)
> 
> 
> 
>>>From: Joseph Ashwood <ashwood at msn.com>
>>>From: "Konstantin 'Kosta' Welke" <kosta at fillibach.de>
>>>
>>>>On Sun, 6 Mar 2005 17:36:43 -0800, Joseph Ashwood <ashwood at msn.com> 
>>>>wrote:
>>>
>>>[Optimal case for binary trees?]
>>>
>>>>In the case of "I need to verify this one piece to be able to share 
>>>>it".
>>>
>>>Actually the optimum case for that is having the verification in the 
>>>node,
>>>regardless of branching. this then leads to the overhead to verification 
>>>=
>>>depth, binary trees will be deepest, they are not optimal.
>>
>>Incorrect.
>>
>>The binary tree will be deeper, however you only need to send one hash
>>per level.
> 
> 
> Actually you will need 2, otherwise you cannot complete the hash computation 
> for the next level.

But one of those two is from 'below' and can be calculated by yourself.


 
Yahoo! Groups Links

<*> To visit your group on the web, go to:
    http://groups.yahoo.com/group/BitTorrent/

<*> To unsubscribe from this group, send an email to:
    BitTorrent-unsubscribe at yahoogroups.com

<*> Your use of Yahoo! Groups is subject to:
    http://docs.yahoo.com/info/terms/
 





More information about the BitTorrent mailing list