A distributed hash table (DHT) is a system for storing and finding data across many computers in a peer-to-peer network without a central server. Each item is stored under a key, usually produced by a hash function, and each node is responsible for keys that are "close" to its own identifier. To find an item, a node asks the peers it knows that are closest to the key, which point it to peers closer still, so a lookup takes only a few steps even in a very large network.
The best-known design is Kademlia, published in 2002, which measures closeness by comparing identifiers bit by bit. DHTs are used by BitTorrent to find peers sharing a file and by the InterPlanetary File System (IPFS) to locate content. In blockchains they are mainly used for peer discovery: Ethereum's node discovery protocol is based on Kademlia.
Ref 1070001154