Re: Back to Merkle Hash Trees...
"Konstantin 'Kosta' Welke" <[email protected]> Sat, 05 Feb 2005 13:31:16 -0000
| Newsgroups | gmane.network.bit-torrent.general |
|---|---|
| Message-ID | <[email protected]> |
On Sat, 5 Feb 2005 00:47:53 +0100, Olaf van der Spek <[email protected]> wrote: >> Kosta >> who still doesnt understand where the big advantage over a list >> of hashed blocks is, anyways > Tiny .torrent size, smaller verification granularity, compatibility with > other merkle tree hashes. Is there some URL somewhere that describes the way Merkle hash trees are supposed to be used in bt2? It seems that a lot of people have very different ideas on how they are used exaclty. Most importantly: Does a .torrent file contain the whole hash tree or just the root hash? Maybe a part of the tree? If the complete tree is in the .torrent, where is the advantage over just a list of hashes? If the partial tree is in the .torrent, is the idea that you only need those parts of the tree that are necessary to download what you want of a file (or directory tree) and leave those other parts out of it? just my ideas how this might work, Kosta 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/