aboutsummaryrefslogtreecommitdiffstats
path: root/docs
diff options
context:
space:
mode:
authortv <tv@krebsco.de>2026-11-06 05:56:20 +0100
committertv <tv@krebsco.de>2026-11-06 05:56:20 +0100
commit77ffa8807d0cf1f06bc040052f6a1873536a0255 (patch)
tree8523852a8f9a59d7c27c8e94ff5d72ec30d69e31 /docs
parent545a8848a97b77899c96a8047f98d7e2f1931dab (diff)
fix doc (working links measured)
Diffstat (limited to 'docs')
-rw-r--r--docs/peers.md3
1 files changed, 2 insertions, 1 deletions
diff --git a/docs/peers.md b/docs/peers.md
index 7eb89a4..ff332c6 100644
--- a/docs/peers.md
+++ b/docs/peers.md
@@ -403,7 +403,8 @@ far as they have the same inputs. The member list's graph, `k` and the recorded
are in the document;
whom a member reaches and its round trips, it tells its neighbours (its parent among
them); but whether a member a hop closer reaches the writer's side only its own
-neighbours know, and a node that doesn't takes it as reaching it. Where they differ, a
+neighbours know, and a node that doesn't takes it as reaching it (where a link stays
+down, its record takes it out of the graph, and with it out of the question). Where they differ, a
change goes twice, or the parent counts the child as covered by another while the child
counts on it: then nobody sends, and the slow round brings the change. So does it where
the parent doesn't reach a member that reaches it and picks it (one-way reachability):