Kademlia is a design for a distributed hash table (DHT), a way for a large peer-to-peer network to store and look up information without a central server. It was described by Petar Maymounkov and David Mazières in 2002. Every node and every stored item has an identifier of the same length, and the "distance" between two identifiers is calculated with the bitwise XOR operation. Each node keeps lists, called k-buckets, of peers at increasing distances, and a lookup proceeds by asking ever-closer peers until the target is found, usually in a number of steps that grows only logarithmically with network size.
Kademlia is used by the BitTorrent DHT, by IPFS through the libp2p networking stack, and in modified form by Ethereum's node discovery protocol. Other blockchain projects, including Harmony, have used Kademlia-style routing to pass messages between nodes and shards.
Ref 1070001205