Karlan wrote: > :Also, because I am writing my own P2P network, I would like to see your > :views on THEX, and tree hashing (such as good byte resolutions for file > :sizes, and depth resoultion). I, personally, do not like using > :standards such XML in an environment such as this; however, I still > :understand the purpose, but the overhead just seems to much.......... > > > Raphael Manfredi wrote: > > In Gnutella, the binary hash tree is made up by using 1kB file blocks. > The tree is then made by hashing the hash of those blocks up to the root. > In general, servents limit the depth of the tree to 10 levels. You don't > need to store physically the whole tree, just the leaves, and the root hash > maybe, and can recompute the tree on demand as there's only a small amount > of data to hash. >
Is there something I am missing about hashing mathematics, (because I don't understand the prepending of 0x01 and 0x00 to the hashes....) or would my assumption be correct if I said: interoperability through programs which use different block sizes is impossible without recalculating the tree from the start again.....? Also, depth 0 would be root hash, or the block hash......? There are still somethings about the THEX document I didn't understand, so any clarification would be appreciated ------------------------------------------------------- This SF.Net email is sponsored by xPML, a groundbreaking scripting language that extends applications into web and mobile media. Attend the live webcast and join the prime developer group breaking into this new coding territory! http://sel.as-us.falkag.net/sel?cmd=lnk&kid=110944&bid=241720&dat=121642 _______________________________________________ Gtk-gnutella-devel mailing list Gtk-gnutella-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/gtk-gnutella-devel
