Search IconIcon to open search

Kademlia DHT

Last updated Jun 7, 2022 Edit Source

Summarization of the Kademlia paper

A peer-to-peer distributed hash table (DHT)

Participating computers each have a node ID in the 160-bit key space. Key-value pairs are stored on nodes with IDs “close” to the key for some notion of closeness. A node-ID-based routing algorithm lets anyone efficiently locate servers near any given target key.

Core ideas

Interactive Graph