Git-Mirrors/veilid-dot-com
1
0
Fork 0
mirror of https://gitlab.com/veilid/veilid-dot-com.git synced 2025-01-30 16:03:25 -05:00
Code Issues Packages Projects Releases Wiki Activity

Update rpc.md

Browse Source
This commit is contained in:
Adam Leskis 2023-09-10 16:26:58 +00:00
parent fef26aa27d
commit f5c029fd87
No known key found for this signature in database
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
pages/docs/rpc.md
View File

@ -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 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 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 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. previous RPC.
#### DHT Schema #### DHT Schema