When searching for some value, the algorithm explores the network in several steps. Each step approaches the key until the contacted node returns the value or no more closer nodes are found. Like many other DHTs, Kademlia contacts only $O(\log n)$ (see Big O notation) nodes during the search out of a total of $n$ nodes in the system.