rift-dht

Distributed hash table for peer discovery in the riftd P2P protocol.

Part of the riftd project — serverless P2P voice + text chat over UDP.

What's in this crate?

rift-dht enables wide-area peer discovery without central servers:

• Kademlia DHT — Built on libp2p's battle-tested implementation
• Peer Announcement — Publish your presence to the network
• Peer Lookup — Find peers by channel or peer ID
• Bootstrap Nodes — Connect to the network via known entry points
• Automatic Routing — Efficient peer routing tables

Usage

use rift_dht::DhtNode;

let dht = DhtNode::new(config).await?;

// Announce presence
dht.announce(peer_id, channel_id).await?;

// Find peers in a channel
let peers = dht.find_peers(channel_id).await?;

Related Crates

Citation

If you use riftd in academic work, please cite:

de Beer, R. (2026). Predictive Rendezvous: Time–Intent–Deterministic Peer Coordination Without Infrastructure. Zenodo. https://doi.org/10.5281/zenodo.18528430

License

Licensed under either of Apache License, Version 2.0 or MIT license at your option.