http://idk.i2p/javadoc-i2p/org/klomp/snark/dht/KRPC.html
Specified by: ping in interface DHT findClosest public List < NodeInfo > findClosest (byte[] ih,
int max) Local lookup only Parameters: ih - a 20-byte info hash max - max to return Returns: list or empty list (never null) getPeersAndAnnounce public Collection < Hash > getPeersAndAnnounce (byte[] ih,
int max,
long maxWait,
int annMax,
long annMaxWait,
boolean isSeed,
boolean noSeeds) Get peers for a torrent, and announce to the closest annMax nodes we find.