aboutsummaryrefslogtreecommitdiffstats
path: root/docs/peers.md
diff options
context:
space:
mode:
authortv <tv@krebsco.de>2026-11-05 01:27:07 +0100
committertv <tv@krebsco.de>2026-11-05 01:27:07 +0100
commitb67ee4d3d59434f5a911b4eb0ee815ac9bcad3fe (patch)
treebcb1679617a2162f4c519053b42303aef5ef3acd /docs/peers.md
parent889e23ee1eb8a209efe7c1eae86aa39091560149 (diff)
predecessors go along
Diffstat (limited to 'docs/peers.md')
-rw-r--r--docs/peers.md6
1 files changed, 5 insertions, 1 deletions
diff --git a/docs/peers.md b/docs/peers.md
index 4ee3c16..9ef570b 100644
--- a/docs/peers.md
+++ b/docs/peers.md
@@ -361,7 +361,11 @@ doesn't carry them again. Without that, with writers in turn, each change coming
another tree, the node's view of a neighbour stays as of its last message to it, and
the next carries all it got since, nearly all of it brought by the neighbour's other
parents (with 50 nodes and writers in turn, about ten changes per message, one of them
-new). Should one lack them after all, it asks, as above.
+new). Should one lack them after all, it asks, as above. But what the node passes on
+to a child carries those of them the passed-on changes build on, if counted so within
+the last 2 s: with writers in turn each change builds on the last writer's, which may
+still be on its way along another tree, and the child would have to ask for it, a round
+trip later.
As nobody waits for these answers, messages overtake each other on slow links. Three
things keep that from sending changes twice (`document::sync`):