|14:22:50| <The_8472> <Soultaker> Doesn't that work very badly for torrents with only a few peers? <- no, if you have very few peers they'll all end up in the closest k-bucket to the key. and a lookup will return all of them
|14:23:37| <The_8472> i don't know much about mainline's DHT, but if it does path-caching (or widening of the k-bucket) it would only happen if the key is heavily crowded, i.e. it's a big swarm
|14:24:11| <The_8472> Azureus' DHT uses another technique to avoid clustering in the swarm. but pex alone does a good job there too
|14:24:56| <The_8472> <DWKnight> you'll typically have between 100 and 300 "closest" nodes most of the time <- k * log2(n) on average i'd say ;)