Expand description
Distributed Hash Table implementation Distributed Hash Table (DHT) Implementation
This module provides a Kademlia-based DHT for distributed peer routing and data storage. It implements the core Kademlia algorithm with proper distance metrics, k-buckets, and network operations for a fully decentralized P2P system.
The implementation includes S/Kademlia security extensions for enhanced protection against various attacks on the DHT infrastructure.
Modules§
- ipv6_
identity - IPv6-based DHT Node Identity System
- skademlia
- S/Kademlia Security Extensions
Structs§
- Consistency
Report - Consistency check report
- DHT
- Main DHT implementation with S/Kademlia security extensions
- DHTConfig
- DHT configuration parameters
- DHTNode
- DHT node information
- DHTStats
- DHT statistics
- DHTStorage
- DHT storage for local records
- Inbox
Info - Inbox information returned to users
- Inbox
Message - Inbox message stored in DHT
- Inbox
Message Index - Message index for efficient inbox querying
- Inbox
Metadata - Inbox metadata stored in DHT
- Key
- DHT key type with proper Kademlia distance calculation
- Lookup
State - DHT lookup state for iterative queries
- Message
Attachment - Message attachment metadata
- Message
Ref - Reference to a message in the index
- Record
- DHT record containing key-value data with metadata
- Repair
Result - Result of a repair operation
- Routing
Table - Kademlia routing table
- SerializableDHT
Node - Serializable DHT node for network transmission
Enums§
- DHTQuery
- DHT query types
- DHTResponse
- DHT response types