aboutsummaryrefslogtreecommitdiffstats
path: root/docs/peers.md
Commit message (Collapse)AuthorAgeFilesLines
* relay: a STATUS's heads wait at least 50 ms before they are pulledtv4 days1-1/+2
| | | | | | | | | | | | | | A neighbour pulls heads a STATUS listed only if it still lacks them after a round trip to the sender, as they are usually on their way along a writer's tree. With no round trip known, or one measured long ago (busy pairs send no keepalives), it pulled at once; with a short one, a STATUS sent right after a change can overtake it by more than that round trip, delays varying per message. Either way the change came twice (`trees_hold_through_continuous_writes`: c pulled once while every write reached it along x's tree). The wait is the round trip, but 50 ms at least (and 1 s at most, as before).
* dashboard: without LINKS; LINKS removedtv10 days1-3/+2
| | | | | | | | | The dashboard reads every member's links from the members themselves; LINKS and LINKS_REPLY, swarm::links and their wire tags go (wire version bumped). Nodes the browser can't reach are drawn from what the reachable ones measure. Auth plan M3.
* substitutes held longertv11 days1-2/+3
|
* indirect probestv11 days1-2/+10
|
* unlisted members forgottontv11 days1-1/+3
|
* fix doc (working links measured)tv11 days1-1/+2
|
* trees over working linkstv11 days1-3/+5
|
* working links recordedtv11 days1-0/+10
|
* suspend detectedtv11 days1-0/+7
|
* views documentedtv11 days1-0/+11
|
* swarm neighbourstv11 days1-2/+7
|
* slow link a hop moretv12 days1-1/+3
|
* heal is lasttv12 days1-0/+6
|
* offer answerstv12 days1-1/+2
|
* round trips in treestv12 days1-3/+6
|
* suspect pathstv12 days1-1/+4
|
* deflate blob chunkstv12 days1-2/+3
|
* deflate blob chunkstv12 days1-0/+5
|
* epoch tag in synctv12 days1-1/+4
|
* no swarm ID in synctv12 days1-1/+2
|
* announce only to those behindtv12 days1-1/+2
|
* predecessors go alongtv12 days1-1/+5
|
* covered neighbours have ittv12 days1-0/+8
|
* delta from held headstv12 days1-2/+3
|
* offer again ungeneratedtv12 days1-1/+2
|
* stale delta offerstv12 days1-0/+3
|
* delta known to sendertv12 days1-1/+2
|
* one delta at a timetv13 days1-1/+5
|
* document messages that overtaketv13 days1-4/+20
|
* any message taken as deliveredtv13 days1-7/+9
|
* slow round back offtv13 days1-4/+8
|
* tree messages need no answertv13 days1-3/+10
|
* hello again when heard fromtv13 days1-1/+4
| | | | | | While we wait for a peer's HELLO_REPLY, anything else that comes from it makes our HELLO go again at once, at most once a second, instead of when the backoff says.
* unanswered pull frees the slottv13 days1-3/+4
| | | | | | When the answer to a pull is overdue (the sync reply timeout: 1 s in the simtests, 10 s in production), the pull gives up the slot, and the next waiting neighbour is pulled at once.
* no heal while both move ontv13 days1-1/+1
| | | | | | | The heal clock now also restarts when our heads and the peer's have both changed since the last STATUS that showed them differing. While writes go on, two neighbours's heads differ because of changes still on their way, and that alone no longer leads to a heal.
* pull after gracetv13 days1-1/+3
| | | | | | | | Before pulling, a node waits one measured round trip to the announcer (1 s at most) and pulls only what is still missing. If the round trip isn't known yet, it pulls at once, as now. On the clean benchmark links the round trip is a few milliseconds, so those scenarios shouldn't change.
* announcements answered when lackingtv13 days1-2/+3
| | | | | | | A neighbour now answers an announcement only if it lacks some of the announced heads. Heads that merely differ are no longer enough, since they do while writes go on. The check reads the document, so it runs off the message consumer, as the pull check already does.
* unanswered members not reachedtv2026-11-031-5/+10
|
* writers from authorstv2026-11-031-5/+7
|
* reach set for the sessiontv2026-11-031-2/+4
|
* tree changes had alreadytv2026-11-031-1/+3
|
* announce what trees misstv2026-11-031-1/+6
|
* order members by distancetv2026-11-031-4/+6
|
* replace eager links by treestv2026-11-031-9/+2
|
* add writer treestv2026-11-031-0/+16
|
* measure 2-hop neighbourhoodtv2026-11-031-0/+9
|
* introduce eager linkstv2026-11-031-1/+9
|
* skip neighbours with our headstv2026-11-031-1/+4
|
* announcements answered only if heads differtv2026-11-031-2/+3
|
* retry new peers before probingtv2026-11-031-1/+3
|