You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
When receiving a kademlia FIND_NODE request for its own peer id, a js-libp2p node will respond with its own peer record only. According to libp2p kademlia spec, it should reply with the k closest nodes.
The libp2p Kademlia DHT offers the following types of operations:
Peer routing
Finding the closest nodes to a given key via FIND_NODE.
Upon a response:
If successful the response will contain the k closest nodes the peer knows to the key Key. Add them to the candidate list Pn, except for those that have already been queried.
Depending on libp2p/specs#609, nodes shouldn't even include their own peer records in the response (already known to the requester).
The text was updated successfully, but these errors were encountered:
The `FIND_NODE` DHT operation should return the closest peers the
node knows to the value.
It does not need to return itself in the list because the calling
peer already knows about it.
Fixes#2450
The `FIND_NODE` DHT operation should return the closest peers the
node knows to the value.
It does not need to return itself in the list because the calling
peer already knows about it.
Fixes#2450
---------
Co-authored-by: Chad Nehemiah <[email protected]>
Version:
1.0.0
Platform:
all
Subsystem:
kad-dht
Severity:
Low
Description:
When receiving a kademlia
FIND_NODE
request for its own peer id, a js-libp2p node will respond with its own peer record only. According to libp2p kademlia spec, it should reply with thek
closest nodes.Depending on libp2p/specs#609, nodes shouldn't even include their own peer records in the response (already known to the requester).
The text was updated successfully, but these errors were encountered: