This is an implementation of a distributed hash table (DHT) based on the Kademlia routing protocol. It is the final project submission for the lecture "Peer-to-peer Systems and Security" offered at the Technical University of Munich. More elaborate documentation is found in the final report handed in. This is my first time using GO, expect some yet unpolished code and style inconsistencies. This is a copy of the repository used for the submission, as the universities with all my projects gitLab is not publicly accessible. Further points to be implemented: - activate hashing keys before storing them (currently removed for debugging) - add more checks whether nodes are still alive or not other than routing table buckets filling # Running To run an instance of the DHT, in needs to be called with `-c