Distributed Algorithm Nodes 2 parts

Job ID: 36819086

Budget: $250 – $750 USD

PART 1:
for this use the code in the example repo under Sockets/SimplePeerToPeer
Right now you start a bunch of peers and then enter which peers are in the network as
"user".

1. Come up with a way, that a new node can be added at any time and will automatically register with the other nodes (more explanation later)
2. A node can register if another node is not responding anymore (offline) and let the
other nodes know that that peer is gone
The network should be a full peer-to-peer and not use a leader.

Part 2:

The task is to implement a simplified/adjusted consensus algorithm between a number of
nodes. We assume there is one leader node which all the other nodes can talk to. We will
skip the part where each node can potentially talk to all the other nodes, so no peer to
peer network here.
Basic structure: Client sends a request to the leader node, the leader then asks the other
nodes for consent, receives the answers and handles accordingly

see attached PDF