lsd0004

LSD0004: R5N Distributed Hash Table
Log | Files | Refs

commit 4886651a86127367f7ed89034e29fc386e25c323
parent 0f7d3d3a279acaf55113ae046c7f410e68b40a43
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date:   Mon,  2 Sep 2024 16:06:30 +0200

typos

Diffstat:
Mdraft-schanzen-r5n.xml | 4++--
1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml @@ -289,7 +289,7 @@ <dt>HELLO block</dt> <dd> A <tt>HELLO block</tt> is a type of <em>block</em> that is used to store and retrieve <em>addresses</em> of a <em>peer</em>. - It are used by the peer discovery mechanism in <xref target="find_peer"/>. + It is used by the peer discovery mechanism in <xref target="find_peer"/>. </dd> <dt>HELLO URL</dt> <dd> @@ -378,7 +378,7 @@ communicate. DHTs usually use greedy routing to store data at the peer(s) closest to the key. In cases where a DHT cannot connect peers according to the construction rules of - its routing algorithm, the topology may ends up with + its routing algorithm, the topology may end up with multiple (local) minima for a given key. Using canonical greedy routing from a particular fixed location in the network, a node may then only be able to publish and