Once connected to a first peer in the DHT network, the DHT node must lookup its own key and fill its routing table's buckets.
One way to implement it is to run the routing table refresh. Alternatively it is possible to lookup for its own key, and for random peer ids in each of its bucket, in order to populate the buckets.
iand
commented
1 year ago
Once connected to a first peer in the DHT network, the DHT node must lookup its own key and fill its routing table's buckets.
One way to implement it is to run the routing table refresh. Alternatively it is possible to lookup for its own key, and for random peer ids in each of its bucket, in order to populate the buckets.
cc: @iand
Related to https://github.com/plprobelab/go-kademlia/issues/2 and https://github.com/plprobelab/go-kademlia/issues/45