lokinet/docs/dht_v0.txt

121 lines
2.5 KiB
Plaintext
Raw Normal View History

DHT messages
these messages can be either wrapped in a LIDM message or sent anonymously over a path
2018-11-08 15:15:02 +00:00
The distance function is distance = A ^ B
This document is currently out of date (probably)
find introduction message (FIM)
2018-11-08 15:15:02 +00:00
variant 1: find an IS by SA
{
A: "F",
2018-11-08 15:15:02 +00:00
R: 0 or 1 if recurisve request,
S: "<32 bytes SA>",
T: transaction_id_uint64,
V: 0
}
2018-07-17 06:41:52 +00:00
variant 2: recursively find many IS in a tag
2018-07-17 06:41:52 +00:00
{
A: "F",
2018-11-08 15:15:02 +00:00
E: [list, of, excluded, SA],
R: 0 or 1 if recurisve request,
2018-07-17 06:41:52 +00:00
N: "<16 bytes topic tag>",
T: transaction_id_uint64,
V: 0
}
2018-07-17 07:30:03 +00:00
exclude adding service addresses in E if present
got introduction message (GIM)
2018-07-17 07:30:03 +00:00
sent in reply to FIM and PIM
{
A: "G",
2018-07-17 07:30:03 +00:00
I: [IS, IS, IS, ...],
2018-11-08 15:15:02 +00:00
K: "<32 bytes public key of router who is closer, provided ONLY if FIM.R is 0>",
T: transaction_id_uint64,
V: 0,
}
2018-11-08 15:15:02 +00:00
The I value MUST NOT contain more than 4 IS.
The I value contain either 1 or 0 IS for PIM and FIM variant 1.
2018-07-17 07:30:03 +00:00
publish introduction message (PIM)
publish one IS to the DHT.
version 0 uses the SA of the IS as the keyspace location.
in the future the location will be determined by the dht kdf
which uses a shared random source to obfuscate keyspace location.
R is currently set to 0 by the sender.
{
A: "I",
I: IS,
R: r_counter,
S: optional member 0 for immediate store otherwise non zero,
2018-07-09 17:32:11 +00:00
T: transaction_id_uint64,
V: 0
}
if R is greater than 0, do a random walk, otherwise if we are
closer to the SA of the IS than anyone else we know in the DHT
store the IS for later lookup.
As of protocol version 0, R is always 0.
If S is provided store the IS for later lookup unconditionally,
decrement S by 1 and forward to dht peer who is next closest to
the SA of the IS. If S is greater than 3, don't store and discard
this message.
find router contact message (FRCM)
find a router by long term RC.k public key
{
2018-06-08 11:54:48 +00:00
A: "R",
2018-07-26 21:08:56 +00:00
E: 0 or 1 if exploritory lookup,
I: 0 or 1 if iterative lookup,
K: "<32 byte public key of router>",
T: transaction_id_uint64,
V: 0
}
2018-07-12 15:46:30 +00:00
TODO: document me
got router contact message (GRCM)
R is a list containing a single RC if found or is an empty list if not found
sent in reply to FRCM only
{
2018-06-08 11:54:48 +00:00
A: "S",
2018-11-08 15:15:02 +00:00
K: "<32 bytes public identity key of router closer, provided ONLY if FRCM.I is 1>",
R: [RC],
T: transaction_id_uint64,
V: 0
}
in response to an exploritory FRCM if the target router is not found the form
{
A: "S",
N: [list, of, router, publickeys, near, target],
R: [],
T: transaction_id_uint64,
V: 0
}