lsd0004

LSD0004: R5N Distributed Hash Table
Log | Files | Refs

commit 9a152fdfb68a4f4d38a66cab187fac44f9d1992b
parent 90d00889a73ddf01032e087a563ed33b88882ebd
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date:   Thu, 17 Aug 2023 14:56:39 +0200

use sup

Diffstat:
Mdraft-schanzen-r5n.xml | 2+-
1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml @@ -597,7 +597,7 @@ Connectivity | |Underlay| |Underlay| | Underlay | ... the respective peer is considered for insertion into the routing table. The routing table consists of an array of k-buckets. Each k-bucket contains a list of neighbors. - The i-th k-bucket stores neighbors whose peer IDs are between distance 2^i and 2^(i+1) from the local peer. + The i-th k-bucket stores neighbors whose peer IDs are between distance 2<sup>i</sup> and 2<sup>i+1</sup> from the local peer. System constraints will typically force an implementation to impose some upper limit on the number of neighbors kept per k-bucket. Upon insertion, the implementation <bcp14>MUST</bcp14> call