Distances for K-Buckets

Each Kademlia node keeps a list of n k-buckets, where n is the number of bits in a key/node ID.

For i <= 0 < n, the i-th k-bucket for a node contains up to k (IP address, UDP port, Node ID) triples for nodes of distance between 2ⁱ and 2ⁱ⁺¹ from itself.

In other words, the nodes in originNode's i-th k-bucket have IDs such that longestCommonPrefixLength(originNode.id, kbucketNode.id) = i.

Hover over a leaf node to view the ID candidates for each k-bucket.