From bf410e006fb2c64d2de133ca1bc9daf3e08aa38f Mon Sep 17 00:00:00 2001
From: Mark Qvist
Date: Thu, 20 May 2021 17:18:38 +0200
Subject: [PATCH] Updated docs
---
README.md | 3 ++
docs/manual/_sources/index.rst.txt | 4 +-
docs/manual/_sources/understanding.rst.txt | 17 ++++----
docs/manual/_sources/whatis.rst.txt | 6 +++
docs/manual/index.html | 46 ++++++++++-----------
docs/manual/objects.inv | Bin 1443 -> 1462 bytes
docs/manual/searchindex.js | 2 +-
docs/manual/understanding.html | 30 +++++++++-----
docs/manual/whatis.html | 6 +++
docs/source/index.rst | 4 +-
docs/source/understanding.rst | 13 +++---
docs/source/whatis.rst | 6 +++
12 files changed, 84 insertions(+), 53 deletions(-)
diff --git a/README.md b/README.md
index 4b496b2..924d731 100755
--- a/README.md
+++ b/README.md
@@ -32,6 +32,9 @@ For more info, see [unsigned.io/projects/reticulum](https://unsigned.io/projects
- Reticulum can handle a few bytes of data or files of many gigabytes
- Sequencing, transfer coordination and checksumming is automatic
- The API is very easy to use, and provides transfer progress
+ - Efficient link establishment
+ - Total bandwidth cost of setting up a link is only 409 bytes
+ - Low cost of keeping links open at only 0.62 bits per second
## Where can Reticulum be used?
Over practically any medium that can support at least a half-duplex channel with 1.000 bits per second throughput, and an MTU of 500 bytes. Data radios, modems, LoRa radios, serial lines, AX.25 TNCs, amateur radio digital modes, ad-hoc WiFi, free-space optical links and similar systems are all examples of the types of interfaces Reticulum was designed for.
diff --git a/docs/manual/_sources/index.rst.txt b/docs/manual/_sources/index.rst.txt
index 0439b1c..bafc699 100644
--- a/docs/manual/_sources/index.rst.txt
+++ b/docs/manual/_sources/index.rst.txt
@@ -10,9 +10,9 @@ the development of Reticulum itself.
whatis
gettingstartedfast
- examples
- reference
understanding
+ reference
+ examples
Indices and Tables
diff --git a/docs/manual/_sources/understanding.rst.txt b/docs/manual/_sources/understanding.rst.txt
index a34371b..7c711e6 100644
--- a/docs/manual/_sources/understanding.rst.txt
+++ b/docs/manual/_sources/understanding.rst.txt
@@ -354,11 +354,10 @@ recap what purposes this methodology serves. We first ensure that the node answe
is actually the one we want to communicate with, and not a malicious actor pretending to be so.
At the same time we establish an efficient encrypted channel. The setup of this is relatively cheap in
terms of bandwidth, so it can be used just for a short exchange, and then recreated as needed, which will
-also rotate encryption keys, but the link can also be kept alive for longer periods of time, if this is
-more suitable to the application. The amount of bandwidth used on keeping a link open is practically
-negligible. The procedure also inserts the *link id* , a hash calculated from the link request packet,
-into the memory of forwarding nodes, which means that the communicating nodes can thereafter reach each
-other simply by referring to this *link id*.
+also rotate encryption keys. The link can also be kept alive for longer periods of time, if this is
+more suitable to the application. The procedure also inserts the *link id* , a hash calculated from the link request packet, into the memory of forwarding nodes, which means that the communicating nodes can thereafter reach each other simply by referring to this *link id*.
+
+The total bandwidth cost of setting up a link is 409 bytes (more info in the :ref:`Binary Packet Format