Pick one and press Start, then click Next › to step through it.
Watch for
The lookup's distance to the target dropping sharply each hop — and the value landing on exactly the k closest nodes to its key.
More about this scenario
You'll learn
How a DHT routes to any key in about log(N) hops and decides which nodes hold which values.
How it runs
Each JOIN slots a node into k-buckets by XOR distance. LOOKUP repeatedly asks the closest known nodes for ones even closer, shrinking the distance each hop. PUT stores on the k nodes closest to the key's ID; GET runs the same lookup to find them.