mirror of
https://gitlab.com/veilid/veilid-dot-com.git
synced 2024-10-01 01:05:53 -04:00
Update rpc.md
This commit is contained in:
parent
fef26aa27d
commit
f5c029fd87
@ -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
|
||||
|
Loading…
Reference in New Issue
Block a user