aboutsummaryrefslogtreecommitdiffstats
path: root/docs/peers.md
diff options
context:
space:
mode:
authortv <tv@krebsco.de>2026-11-05 21:35:33 +0100
committertv <tv@krebsco.de>2026-11-05 21:35:33 +0100
commit91c91a4cee04bb15eeeefb78223c7c72694dd2e2 (patch)
tree970e4cc253434be7875f837a0f40da3949218fb9 /docs/peers.md
parentb0ddfeccbc04a39196717e81daa5dc3aa0f42c69 (diff)
slow link a hop more
Diffstat (limited to 'docs/peers.md')
-rw-r--r--docs/peers.md4
1 files changed, 3 insertions, 1 deletions
diff --git a/docs/peers.md b/docs/peers.md
index eefb0cc..29512a5 100644
--- a/docs/peers.md
+++ b/docs/peers.md
@@ -351,7 +351,9 @@ built on the graph the member list gives (as if every member reached every other
on whom each member says it reaches. Members are ordered by their distance from the
writer over that graph, then whether they reach a member a hop closer, then by key; a
member's parent is the neighbour it reaches that comes before it, the closest to the
-writer first, then one that reaches closer, then the one it said it has the shortest
+writer first (a link at least two round-trip buckets slower than its fastest to one
+counting a hop more: a slow circuit to the writer is passed over for a fast link to a
+member as close), then one that reaches closer, then the one it said it has the shortest
round trip to, then by pair score. Coming before rules out
cycles; taking only one it reaches routes around links that don't work: where a writer
behind NAT reaches a single member, that one comes first among those as far from it,