Skip to main content

The R5N Distributed Hash Table
draft-schanzen-r5n-07

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Martin Schanzenbach , Christian Grothoff , Bernd Fix
Last updated 2025-09-18 (Latest revision 2025-03-17)
RFC stream Independent Submission
Intended RFC status Informational
Formats
Stream ISE state Response to Review Needed
Consensus boilerplate Unknown
Document shepherd (None)
IESG IESG state Expired
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:

Abstract

This document contains the R^5N DHT technical specification. R^5N is a secure distributed hash table (DHT) routing algorithm and data structure for decentralized applications. It features an open peer- to-peer overlay routing mechanism which supports ad-hoc permissionless participation and support for topologies in restricted-route environments. Optionally, the paths data takes through the overlay can be recorded, allowing decentralized applications to use the DHT to discover routes. This document defines the normative wire format of protocol messages, routing algorithms, cryptographic routines and security considerations for use by implementers. This specification was developed outside the IETF and does not have IETF consensus. It is published here to guide implementation of R^5N and to ensure interoperability among implementations including the pre-existing GNUnet implementation.

Authors

Martin Schanzenbach
Christian Grothoff
Bernd Fix

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)