Re: Have maps (was Merkle, URLs, etc)

Joseph Ashwood wrote:
> ----- Original Message ----- 
> From: "Elliott Mitchell" <[email protected]>
> Subject: Re: [BitTorrent] Have maps (was Merkle, URLs, etc)
> 
> 
> 
>>>From: Joseph Ashwood <[email protected]>
>>>From: "Konstantin 'Kosta' Welke" <[email protected]>
>>>
>>>>On Sun, 6 Mar 2005 17:36:43 -0800, Joseph Ashwood <[email protected]> 
>>>>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:
    [email protected]

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