You might also keep in mind that a peer with the least number of pieces maybe NAT. Pieces are more beneficial if super-seeded to non-NAT clients than to NAT...
... RPC and XML. Implementations of both have been fraught with security holes. RPC is pretty well guarenteed to be dropped at any decent border firewall, as ...
Elliott Mitchell
ehem@...
Feb 2, 2005 3:00 am
6379
... I agree XML is bloated relative to bencoding, but RPC security depends on the systems it hooks to. Changing encoding scheme also shouldn't be too...
... That root node sounds an awfully lot like a tracker... ...and that isn't even the central server I'd worry most about. ... Again, the root node sounds an...
Elliott Mitchell
ehem@...
Feb 2, 2005 6:19 am
6381
I wrote an elaborate piece some time ago about how the whole thing just doesn't really help anything, and decentralization in software is a myth, but my...
Hi. It's been since June that Bram said anything about BT2. Is it progressing? BT needs an upgrade, and the ideas Bram mentioned for BT2 sound promising....
... Either way, it is a merkle hash tree. The question is if it complies to that THEX format. I'd still say so, because in point 3.3 they say "Normal...
Konstantin 'Kosta' We...
kosta@...
Feb 4, 2005 10:41 pm
6387
On Fri, 2005-02-04 at 00:38 +0000, sh4dowmatter wrote: ... IMO, you're improvement is worth doing. Speed and simplicity still count, even if you have to...
... From: "Olaf van der Spek" <OvdSpek@...> Subject: Re: [BitTorrent] Back to Merkle Hash Trees... ... And the associated disadvantages of not having...
... A legitimate concern. Two counterpoints though. The smallest size chunk that anyone has suggested making verifiable is 4K at the high end you might only...
Elliott Mitchell
ehem@...
Feb 5, 2005 6:03 am
6391
... Well... the O(n) overhead is a lot heavier than the O(n log n) overhead, so except on extremely large torrents (read >100G) you aren't going to see a...
John Hoffman
theshadow@...
Feb 5, 2005 6:22 am
6392
... Who said anything about not having the hashes available when needed? ... Isn't that limited by network transfer rate instead of CPU time? ... Isn't that...
... 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...
... No you cant, sha1 is block based and you cant hash less than a block of 64 bytes at a time. So there is an alignment issue. ... There are more significant...
... If the cost of verifying is high, and you rarely expect it to fail, there might be a temptation to pass out pieces before you have verfified them, and...
... sha1 (let alone sha256 - dont have an implementation lying around to test) is pretty CPU intensive.. ok my desktop can manage 130MB/s, though thats only...
... But the extra hashing required to calculate the merkle tree is tiny compared to the normal hashing. So I still consider this point not relevant....
... You completely missed my point. I agree *some* form of verification is required. You've pointed to one alternative, knowing the file size. If the file size...
Elliott Mitchell
ehem@...
Feb 5, 2005 11:44 pm
6402
I'll reexplain it for those that have had a bit of time between their math education and now. ... From: "John Hoffman" <theshadow@...> Subject: Re:...
... From: "Elliott Mitchell" <ehem@...> Subject: Re: [BitTorrent] Back to Merkle Hash Trees... ... Not for me, because think Merkle tress are in general a...
... 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...
Konstantin 'Kosta' We...
kosta@...
Feb 6, 2005 12:38 am
6405
I don't know where you people learned your maths and fancy proofs... But the last time I checked, a tree with k leaves requires k-1 "interior" nodes,...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
