bittorrent

问题 I'm trying to understand how Kademlia works in regards to finding a resource. There is pretty good description of now to build a node tree which is closest to the self node, how to find the distance between nodes, how to initiate the process etc. What I don't understand is how the file infohash fits into this picture. All descriptions tell us how to get into the play and build your own part of the distributed hash table but it is not it. We are doing this to actually find a resource, a file

问题 Are there any decent BitTorrent libraries for Java? I need to program a simple torrent client, but it would be great if I didn't have to write everything from scratch. 回答1: Snark by Three Rings is a very lightweight bitorrent library that will give you basic torrent features. Was originally written by Mark Wielaard. A github source can be found here https://github.com/akerigan/born-again-snark 回答2: Turn's TTorrent is a pure Java bit torrent library. 回答3: I have created a Bitlet Fork on Github

问题 I'm using C++ to parse the info hash of a torrent file, and I am having trouble getting a "correct" hash value in comparison to this site: http://i-tools.org/torrent I have constructed a very simple toy example just to make sure I have the basics right. I opened a .torrent file in sublime and stripped off everything except for the info dictionary, so I have a file that looks like this: d6:lengthi729067520e4:name31:ubuntu-12.04.1-desktop-i386.iso12:piece lengthi524288e6:pieces27820:¡´E¶ˆØËš3í