CheckPredecessorDaemon checks whether the node's predecessor has failed Algorithm n.check_predecessor() if (predecessor has failed) <- in our case responds to a FindSuccessor rpc call within 3 seconds predecessor = nil; */.

Download function uses the TransferFile RPC to receive the file chunks which will be stored under _download/nameToStore.

FixFingersDaemon() is called periodically, refreshes finger table entries.

NewChordNode is a constructor for ChordNode struct.

StabilizeDaemon() verifies n’s immediate successor, and tells the successor about n.

ChordNode can be created using `NewChordNode` However, it must be followed either by creating own Chord network using `create` or by joining an existing network using `join`.

IChordNode interface defines all of the functions that Chord will have (which I know at this moment).