Re: Back to Merkle Hash Trees...

Elliott Mitchell wrote:
> One you might think about helping me murder is the "THEX" design various
> folks have been advocating. THEX distinguishes leaves from internal nodes
> by appending a byte depending on whether it is leaf or payload; *that*
> is bogus!  (kills alignment, makes testing expensive)

It's not. You do not have to put the byte physically in front of the 
block. You can 'hash' the byte and then the block.

And it's required in general because otherwise you couldn't tell the 
difference between hash data and user data (if you only know the root 
hash and not the file size).

> http://www.open-content.net/specs/draft-jchapweske-thex-02.html
> 
> 



 
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/