Here is Kademlia algorithm:

1. you ask the closest nodes you know about, about a key.

2. some will answer either data, some will respond with the even closer nodes they know about.

3. you repeat step 1 for the nodes you were told about from step 2 until you run out of nodes you haven't visited already.

You can implement this in a month in a new programming language that you are still learning. Better yet you can graph one of the 100s of implementations and get access to millions of nodes.

Now, what is the simplest algorithm for the Outbox model if I am trying to dind the Outbox relay of a key that hasn't published their profile to a relay I am already connected to?

Is it only simple when we all have one relay in common? Because everything is simple when there is one central reliable source of truth.

nostr:note1ft33hptz4csg4p7kmdvx692fra5m07ufz5ye5mtyrngqz2s6rzuqc6gvs8