Adds a new HTTP endpoint that can be used to request records for the closest peers to a given key that the routing implementation knows about.
The use-case for this is browser nodes performing random walks to find peers that they can make a circuit relay reservation on, without having to be DHT clients to perform the walk which can be undesirable given all the connection/processing overhead that entails.
I've tried to avoid defining what "closest" means to leave it up to the routing implementation, only that the responses should be "closer" than the optional closerThan parameter which should mean the caller gets useful results for other scenarios.
Adds a new HTTP endpoint that can be used to request records for the closest peers to a given key that the routing implementation knows about.
The use-case for this is browser nodes performing random walks to find peers that they can make a circuit relay reservation on, without having to be DHT clients to perform the walk which can be undesirable given all the connection/processing overhead that entails.
I've tried to avoid defining what "closest" means to leave it up to the routing implementation, only that the responses should be "closer" than the optional
closerThanparameter which should mean the caller gets useful results for other scenarios.