Skip to content

Commit dc718c7

Browse files
intro
1 parent 53fc4a7 commit dc718c7

File tree

1 file changed

+11
-18
lines changed

1 file changed

+11
-18
lines changed

src/routing/kad-dht.md

+11-18
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ description: >
55
overlay network used for peer and content routing in the InterPlanetary File
66
System (IPFS). It extends the libp2p Kademlia DHT specification, adapting and
77
adding features to support IPFS-specific requirements.
8-
date: 2025-03-18
8+
date: 2025-03-19
99
maturity: reliable
1010
editors:
1111
- name: Guillaume Michel
@@ -25,17 +25,18 @@ adding features to support IPFS-specific requirements.
2525

2626
## Introduction
2727

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.
2932

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:
3136

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
3940

4041
### Relation to [libp2p kad-dht](https://github.com/libp2p/specs/tree/master/kad-dht)
4142

@@ -347,10 +348,6 @@ corresponds to the preimage of the Kademlia Identifier, as described
347348

348349
`GetClosestPeers` is used for the purpose of Content Routing.
349350

350-
### Signed Peer Records
351-
352-
`FIXME`: Signed Peer Records are not yet implemented in the IPFS Kademlia DHT.
353-
354351
## Provider Record Routing
355352

356353
Provider Record Routing is the process of locating peers that provide a
@@ -659,10 +656,6 @@ protocol](https://github.com/libp2p/specs/blob/master/ping/ping.md).
659656
If a DHT server receives an invalid request, it simply closes the libp2p stream
660657
without responding.
661658

662-
## Backpressure
663-
664-
TBD
665-
666659
## Client Optimizations
667660

668661
### LAN DHT Swarms

0 commit comments

Comments
 (0)