Yeah, we already have DHT Fingers (/Kademlia Routing) (TODO: link to actual rfc/routing table behaviour). Each group holds connections to other known groups all over the XOR address space. A request is routed to the best-fitting (smallest XOR-distance) directly connected group, then that group routes it to the best-fitting directly connected group and so on…
while the message is sent to destination in the fastest way
I’ve read about all request and responses being handled recursively to make them anonymous (TOR-like behaviour). Thus we would only communicate with known groups => no need for complexity. But i guess that’s not a goal anymore/never was a goal (because of bad performance? caching should help mitigate this. Caching isn’t a problem for static files as the file content never changes, caching MD should work as well)?
addition: recusrive as in recursive dns queries