Re: Merkle, URLs, etc

> 
> 
> Justin Cormack wrote:
> > 
> > Olaf wrote: 
> > 
> >>Justin Cormack wrote:
> >>
> >>>Olaf wrote: 
> >>>
> >>>
> >>>>Joseph Ashwood wrote:
> >>>>
> >>>>
> >>>>>Binary Merkle Trees: Are heavily flawed, and the only suggestion made to fix
> >>>>>it was to send the grandchildren as well, which completely defeats the point
> >>>>>of the child nodes, making the child nodes pure overhead, they serve no
> >>>>>purpose except to enlarge the tranfer and raise the CPU time.
> >>>>
> >>>>A merkle tree with the same granularity as BT1 does have about the same 
> >>>>overhead.
> >>>
> >>>
> >>>But then its basically equivalent to your get info hash extension... Or
> >>
> >>You mean get_info/info?
> >>No, it's not.
> >>
> >>
> >>>any other scheme where the first thing you do is get a full hash tree...
> >>
> >>No, because you do not get the entire tree up front.
> > 
> > 
> > If its flat you have to get it up front, you cant do anything else.
> 
> Who said it's flat?

Sorry, misinterpreted your earlier comment. Ignore it.



 
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/