Distributed Hash Table (DHT)
Web3 / infrastructure applications
A Distributed Hash Table is a decentralized data structure that enables peer-to-peer networks to store and retrieve key-value pairs efficiently across multiple nodes without requiring a central server. Each node in the DHT maintains a portion of the overall data, and routing mechanisms allow any participant to locate and retrieve stored information by computing a hash of the desired key. DHTs form the backbone of many decentralized systems, enabling nodes to discover peers, share data, and maintain network resilience even when individual nodes join or leave the network. The distributed nature of DHTs eliminates single points of failure and allows networks to scale horizontally as more participants join. Example: The InterPlanetary File System (IPFS) uses a DHT based on Kademlia to enable content discovery and peer location. When users request files on IPFS, the DHT helps route queries to nodes that store the requested content, allowing decentralized file sharing without relying on centralized servers or indexes. Why it matters for blockchain infrastructure: DHTs are critical for peer discovery and data distribution in blockchain networks, enabling nodes to locate each other and synchronize state without central coordinators, which is essential for network decentralization and resilience.
Explore the full Web3 Glossary — 2,010+ expert-curated definitions. Need guidance? Talk to our consultants.