aboutsummaryrefslogtreecommitdiffstats
path: root/docs/peers.md
diff options
context:
space:
mode:
authortv <tv@krebsco.de>2026-11-18 12:48:29 +0000
committertv <tv@krebsco.de>2026-11-18 13:59:42 +0100
commitd130c0612b4c63f2d30da65ebcc231018c1f2606 (patch)
tree8700f2d53351cbbecbe772ea7701bf6240d5210c /docs/peers.md
parent0bfe07af92a775b0e896e0fc5a989a1d9b65f7b3 (diff)
docs: references to another document's section linked to it
Where a document names a section of another after linking to it ("([`store.md`](store.md), Pinned checkpoints)"), the name links to that section too, by the id both GitHub and cgit's about filter give its heading; paragraphs that grew past the width are wrapped anew, links and code kept on one line each.
Diffstat (limited to 'docs/peers.md')
-rw-r--r--docs/peers.md23
1 files changed, 12 insertions, 11 deletions
diff --git a/docs/peers.md b/docs/peers.md
index f5b6ab6..e71d726 100644
--- a/docs/peers.md
+++ b/docs/peers.md
@@ -13,18 +13,19 @@ says where it is (`mycelium:<public key>`). The identity layer (`transport::iden
between the node and its transports keeps the two apart, so everything below speaks of
node IDs. A node may have several transports, and reaches a peer on one both have
(module `transport::paths`). With several, it measures them: every 30 s (or every
-keepalive interval, if that is longer) each gets a PING (the keepalive's, or one of its own), answered by a PONG over the same path, which
-gives its round-trip time. A peer's only path is measured the same way once messages
-go over it (a busy pair sends no keepalives). The
-configured order decides until both are measured; then the node changes to another
-path when it is a quarter faster (and at least 5 ms), so it doesn't flap. A send that
-fails goes to the next path at once, and a path whose sends fail, or whose PINGs go
-unanswered three times in a row, is down: used only when no other works. A path that
+keepalive interval, if that is longer) each gets a PING (the keepalive's, or one of its
+own), answered by a PONG over the same path, which gives its round-trip time. A peer's
+only path is measured the same way once messages go over it (a busy pair sends no
+keepalives). The configured order decides until both are measured; then the node changes
+to another path when it is a quarter faster (and at least 5 ms), so it doesn't flap. A
+send that fails goes to the next path at once, and a path whose sends fail, or whose PINGs
+go unanswered three times in a row, is down: used only when no other works. A path that
takes messages and drops them shows sooner: when what went to the peer goes unanswered
-(the PING that asks again, below, or an overdue sync answer), its other paths come
-first until that one answers a PING again, and all of them are pinged at once. A node on
-several transports bridges nodes that share none ([`transports.md`](transports.md), Several transports):
-the topology links it on each of its transports (below).
+(the PING that asks again, below, or an overdue sync answer), its other paths come first
+until that one answers a PING again, and all of them are pinged at once. A node on several
+transports bridges nodes that share none ([`transports.md`](transports.md),
+[Several transports](transports.md#several-transports)): the topology links it on each of
+its transports (below).
```mermaid
sequenceDiagram