...
As in most peer-to-peer systems, at least one node H must be known up front. Our node N handshakes with H (which gets N added to H's peer table, if possible). If N queries H for N's own key, it will receive NH's peers which are closest to HN. After that, H N can query those newly added nodes for other nodes in empty rows of N's peer of its peer table to get a fuller picture of the network.
...