You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: src/routing/kad-dht.md
+11-18
Original file line number
Diff line number
Diff line change
@@ -5,7 +5,7 @@ description: >
5
5
overlay network used for peer and content routing in the InterPlanetary File
6
6
System (IPFS). It extends the libp2p Kademlia DHT specification, adapting and
7
7
adding features to support IPFS-specific requirements.
8
-
date: 2025-03-18
8
+
date: 2025-03-19
9
9
maturity: reliable
10
10
editors:
11
11
- name: Guillaume Michel
@@ -25,17 +25,18 @@ adding features to support IPFS-specific requirements.
25
25
26
26
## Introduction
27
27
28
-
`FIXME:`
28
+
The Kademlia Distributed Hash Table (DHT) is a decentralized key-value store
29
+
designed to enable efficient and scalable peer-to-peer routing. It provides a
30
+
structured overlay network that allows nodes to locate peers and content in a
31
+
distributed system without relying on centralized servers.
29
32
30
-
Distributed Key-Value Store
33
+
The primary goal of the Kademlia routing algorithm is to progressively discover
34
+
and interact with nodes that are closest to a given key based on the network's
35
+
distance metric. Once a node has identified the closest peers, it can either:
31
36
32
-
Goal of DHT is to find the closest peers to some key (in a specific geometry). Once this routing to the closest nodes is possible, nodes can interact with these nodes in various ways, including in asking them to store and serve data.
33
-
34
-
### DHT Operations
35
-
36
-
* Peer Routing
37
-
* Content provider advertisement and discovery
38
-
* Value storage and retrieval
37
+
***Locate a specific peer** in the network
38
+
***Find content providers** serving content associated with a CID
39
+
***Store and retrieve values** directly within the DHT, such as IPNS names
39
40
40
41
### Relation to [libp2p kad-dht](https://github.com/libp2p/specs/tree/master/kad-dht)
41
42
@@ -347,10 +348,6 @@ corresponds to the preimage of the Kademlia Identifier, as described
347
348
348
349
`GetClosestPeers` is used for the purpose of Content Routing.
349
350
350
-
### Signed Peer Records
351
-
352
-
`FIXME`: Signed Peer Records are not yet implemented in the IPFS Kademlia DHT.
353
-
354
351
## Provider Record Routing
355
352
356
353
Provider Record Routing is the process of locating peers that provide a
0 commit comments