Given the IP address, and any other data you decide, of any single node, a node must be able to join or form a network with that node.

Unit testing. You must demonstrate that the core parts of your implementation work as expected by writing unit tests. Note that unit tests never cross process boundaries, which means that they do not send network messages, read or write files, require user input, etc. Unit tests prove that the internal constructs of an application behave as expected, such as that the calculation of XOR distances is correct, or that contacts are inserted at the correct places in buckets, and so on. See Appendix A for a brief tutorial. We expect a test coverage of at least 50%

Lab report. You must continously work on and update a lab report. The required contents of the report are outlined later in the Method section.

Object distribution. The networks your nodes form must be able to manage the distribution, storage and retrieval of data objects, as described in the Kademlia paper.

• Storing objects
• Finding objects

Implement the PING message

When part of a network, it must be possible for any node to upload an object that will end up at the designated storing nodes.

Takes a single argument, the contents of the file you are uploading, and outputs the hash of the object, if it could be uploaded successfully.

Command line interface. Each node must provide a command line interface.

• put
• get
• exit

When part of a network, each node must be able to retrieve the contact information of any other node in the same network.

Containerization. You must be able to spin up a network of nodes on a single machine.
The network must consist of at least 50 nodes, each in its own container. You may spin
up and take down the network any way you like, but you will likely save a lot of time if you either
use a script or an orchestration solution to start and stop the network.

Terminates the node.

When part of a network with uploaded objects, it must be possible to find and download any object, as long as it is stored by at least one designated node.

Takes a hash as its only argument, and outputs the contents of the object and the node it was retrieved from, if it could be downloaded successfully.

Network formation. [5p]. Your nodes must be able to form networks as described in the KademLia paper. Kademlia is a protocol for facilitating Distributed Hash Tables (DHTs).

• Pinging
• Network joining
• Node lookup