lsd0004

LSD0004: R5N Distributed Hash Table
Log | Files | Refs

commit db89ead0f21e9d18fc8d374d985795df8f6af243
parent a1beda531e0f6d6e138d5a14cf774ee933f2b32a
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date:   Fri, 23 Dec 2022 19:14:58 +0900

Typos

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

diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml @@ -277,7 +277,7 @@ The specific semantics of the above operations as provided by R<sup>5</sup>N for applications are defined in <xref target="overlay"/>. The handling of blocks and their validation and storage is defined in - <xref target="blockstorage". + <xref target="blockstorage"/>. </t> <t> In a trivial scenario where there is only one peer (the local host), @@ -316,10 +316,10 @@ </t> <t> Across this document, the functional components of an R<sup>5</sup>N - implementation are divided into block processing (<xref target="blockstorage"), - message processing (<xref target="p2p_messages") and routing - (<xref target="routing"). - <xref taget="figure_r5n_arch" illustrates the architectural overview of + implementation are divided into block processing (<xref target="blockstorage"/>), + message processing (<xref target="p2p_messages"/>) and routing + (<xref target="routing"/>). + <xref target="figure_r5n_arch"/> illustrates the architectural overview of R<sup>5</sup>N. </t> <figure anchor="figure_r5n_arch" title="The R5N architecture.">