Advertisement Jump to content
Sign in to follow this  

Kademlia Implementation

This topic is 4983 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hi, for my final exams I'm writing and designing a p2p filesharing tool, focussed on the serverless approach using the XOR metric of Kademlia. I think I have quite well understood the theory of connecting nodes and searching for keys, but a question still remains: How to implement a XOR based network in a filesharing application where each user serves n different files with completly different hashes without relation to his own hash? In Kademlia each node holds data with similar hashes (called keys) as the hash of the node itself (called node id). Node XY has a lot of documents to offer, but the hashes generated from the document-names (via SHA-1) will most likely have nothing to do with the hash of the node with is a requirement for the idea behind Kademlia. So how do we find nodes that have file XY if we just compare the hash of the files with the (unique) hashes of the nodes to jump closer? Because the nodes whose hash (ID) is closest to the hash of the search string obviously won't have requested informations... Sorry for the bad explaination but it's quite hard to describe the situation if your native language is not english and I hope that someone in here knows the Kademlia protocol quite well ;). PS: Please don't forward me to emule or other software because the source is a pain to understand *g*. Thanks ~Daywalker

Share this post

Link to post
Share on other sites
Sign in to follow this  

  • Advertisement

Important Information

By using, you agree to our community Guidelines, Terms of Use, and Privacy Policy. is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!