aboutsummaryrefslogtreecommitdiffstats
path: root/docs/topology.md
diff options
context:
space:
mode:
authortv <tv@krebsco.de>2026-11-13 17:06:37 +0000
committertv <tv@krebsco.de>2026-11-13 17:06:37 +0000
commitf6a5c50e0f24736e48c96e9f7a0d14e9d7474b2d (patch)
tree4f8c454ac4293fc2ca29092cc19f7753c7e5887f /docs/topology.md
parent96b4ae2984e7b0b1d9970acbb20b9165b1e3f2f0 (diff)
hyparview: a member with k takes one a neighbour short
A member one neighbour short asks once per `ONE_SHORT_EVERY` (300 s), and a member with `k` refused it. When a member most others had as a neighbour went away, three members ended up each with the other two as neighbours, one short each; each asked once, was refused by a full member, and waited five minutes. Changes pass only between neighbours: the three got none of what was written meanwhile (`active_views_settle_and_heal`, timed out waiting for the same heads). NEIGHBOUR says now whether its sender is one short, and a member with `k` takes such an ask as its `k + 1`th, the most it keeps; one with `k + 1` still refuses. Asks stay as rare as they were, and one is enough but where those asked have `k + 1`. Wire version 50.
Diffstat (limited to 'docs/topology.md')
-rw-r--r--docs/topology.md5
1 files changed, 4 insertions, 1 deletions
diff --git a/docs/topology.md b/docs/topology.md
index 674eaed..1781157 100644
--- a/docs/topology.md
+++ b/docs/topology.md
@@ -32,7 +32,10 @@ can compute every other node's neighbours, writers' trees can be built on it.
agreed to be one (NEIGHBOUR, NEIGHBOUR_REPLY, DISCONNECT), about `k` of them (5 unless
`--neighbours` is set, the paper's size for up to about 10 000 members). Members that
fail leave it, and others are asked; each neighbour is asked again every minute whether
-it still is, so a link lost at one end (a lost DISCONNECT) doesn't stay at the other. The passive view, whom to ask, is drawn from the
+it still is, so a link lost at one end (a lost DISCONNECT) doesn't stay at the other. A
+member one neighbour short says so when it asks, and one with `k` takes it as its
+`k + 1`th: a few members one short, neighbours of each other, would otherwise ask only
+full members and stay an island. The passive view, whom to ask, is drawn from the
member list, not from the paper's JOIN and SHUFFLE (`swarm::hyparview`). There is no
graph every node shares: writers' trees, recorded links, indirect probes and the
dashboard's intended links do nothing.