New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Populate routing table with closest nodes to self #9

Open

sjaensch opened this issue Aug 29, 2020 · 0 comments

Milestone

Support for DHT

Owner

sjaensch commented Aug 29, 2020 •

edited

Loading

From the BEP:

Upon inserting the first node into its routing table and when starting up thereafter, the node should attempt to find the closest nodes in the DHT to itself. It does this by issuing find_node messages to closer and closer nodes until it cannot find any closer.

We'll need to do #4 for this.

sjaensch added this to the Support for DHT milestone

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment