From f5c029fd87c68fe17420cd37e9e7a63f15037656 Mon Sep 17 00:00:00 2001 From: Adam Leskis Date: Sun, 10 Sep 2023 16:26:58 +0000 Subject: [PATCH] Update rpc.md --- pages/docs/rpc.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/pages/docs/rpc.md b/pages/docs/rpc.md index 8fb5bea..86fd2d9 100644 --- a/pages/docs/rpc.md +++ b/pages/docs/rpc.md @@ -45,7 +45,7 @@ We built a better DHT by making both search and data locality more relevant. Vei Locating a node by its ID. Here the node with the prefix 0011 finds the node with the prefix 1110 by successively learning of and querying closer and closer nodes. The line segment on top represents the space of 160-bit IDs, and shows how the lookups coverge to the target node. Below we illustrate RPC messages -made by 1110. The first RPC is to node 101, already known to 1110. Subsequent RPCs are to nodes return by the +made by 1110. The first RPC is to node 101, already known to 1110. Subsequent RPCs are to nodes returned by the previous RPC. #### DHT Schema