commit 7050153ff18dd8b7aa37a5675f109293bc496dc7
parent 0fb6f2c1af4afd9bbdae51051e5fe26d2fbe971e
Author: Julius Bünger <buenger@mytum.de>
Date: Mon, 12 Aug 2024 14:37:15 +0200
cong: add details on network generation
Diffstat:
1 file changed, 16 insertions(+), 3 deletions(-)
diff --git a/developers/apis/cong.rst b/developers/apis/cong.rst
@@ -11,6 +11,13 @@ service. Here we document the design decisions and parts that are about to
change.
..
+ TODO (from project plan)
+ - cryptographic protocol:
+ - key exchange
+ - key management
+ - unified address format for L2O and libp2p
+
+..
TODO write a short overview
- peer ids
- libp2p
@@ -227,12 +234,17 @@ Peer ids will be generated from the set of a peer's current addresses. Once a
peer obtains the same set of addresses it shall be using the same peer id. To
achieve this behavior, the current string representation of addresses is
sorted, the sorted representation hashed and the peer id generated from the
-hash.
-.. TODO details?
+hash. We call the hash 'network generation hash'. The hash can be used to
+quickly identify and recognise a set of addresses that was used in the past.
Once a peer id changes, all communication via open channels shall immediately
cease. To signal this, the mq is to be used.
-.. TODO details?
+To identify all queued messages that are to be cancelled, the 'network
+generation id' is used. (This was decided to be implemented as a simple counter
+of 64 bit.)
+
+..
+ 64 bit: similar size to pid/hash
..
- adress bundle (transport communicators implement decision?)
@@ -355,6 +367,7 @@ api:
- signing data with the peer id
+
.. _libp2p-Underlay:
libp2p Underlay
