diff options
| author | tv <tv@krebsco.de> | 2026-11-16 04:16:58 +0000 |
|---|---|---|
| committer | tv <tv@krebsco.de> | 2026-11-16 04:16:58 +0000 |
| commit | d1479f8d479c885b55a5c17a4b335c3ee0356606 (patch) | |
| tree | 2cf28d8b06e5c6e42e85ab8812c00c7f448c9dbb /docs | |
| parent | 9c1d33fd1c2cd0a0a90bef1b4984676d04500e12 (diff) | |
federation: the writers a node starts, bounded
Every writer costs every node memory for as long as the epoch lasts, and
nothing bounded the writers a node starts: one listed node starting one
with every change runs every other out of memory before a remake could
be built, which the design called slow, not wrong. A federated swarm
bounds the writers a node starts in an epoch, judged at a change's
history as any rule is: a rule, and stage 1's.
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/federation.md | 14 |
1 files changed, 10 insertions, 4 deletions
diff --git a/docs/federation.md b/docs/federation.md index 6f18feb..7c8da2e 100644 --- a/docs/federation.md +++ b/docs/federation.md @@ -547,6 +547,10 @@ its operator pins. * **Changes it shouldn't apply.** A change is first of all one Automerge itself writes, or it is refused before Automerge sees it, in every swarm *(checked: `document::changes::Written`)*. +* **Writers a node starts.** A node starts at most so many writers in an epoch, a bound + judged at a change's history as any rule is: every writer costs every node memory + (below), and one node starting one with every change would run the others out of + memory, which is more than slow. The rest are recommendations: none breaks a promise, only how fast a node is, or how long nodes stay together. @@ -644,7 +648,7 @@ What an attacker does, and what happens. *Unit*: the judging, with crafted chang | 39 | A writer forked: two changes, one number | Honest nodes split until a fork. Not promised | sim | | 40 | Different changes to different peers | Honest nodes agree once they sync | sim | | 41 | A party withholding its changes or votes | Not promised | — | -| 42 | Flooding: namespace, proposals, history, writers | Slow, not wrong | bench | +| 42 | Flooding: namespace, proposals, history | Slow, not wrong | bench | | 43 | A node taken off its list writes changes at a history where it was on | Taken where valid there; behind what is written under later versions | unit | | 44 | A token from another node, even one its party lists | Refused: a node takes only its own | unit | | 45 | A party lists another party's nodes, or one its party dropped | Nothing changes: a node is its own party's | unit | @@ -680,6 +684,7 @@ What an attacker does, and what happens. *Unit*: the judging, with crafted chang | 75 | A version, set, list, path or value larger than the federation allows | Refused; none can be too large for a sync message | unit | | 76 | Two thirds back a proposal that is no version | It can't be written, nor die; the federation is bound to its version. A node shows that it is none, and clients don't back it | unit | | 77 | A party's vote committed again at a history before the nays that freed it, its clock set between, then a remake | The replay refuses it at first, and takes it once the rest is in | unit | +| 78 | A listed node starting a fresh writer with every change | Refused past the bound on the writers a node starts in an epoch | unit | ## Roads not taken @@ -790,9 +795,10 @@ On a federated swarm: touching what the federation reads (versions, proposals, votes, key sets, node lists), as `access::screen` moves it today for what continuum's rules read; the byte formats (a version's JCS bytes, hashes in paths and how two compare, the envelopes a - version sets, the meta's version), and the sizes a version, a set, a list, a path and - a value may have, each within what a sync message carries. A node that doesn't know - the policy stops taking changes. Until stage 4, a federated swarm takes no remake. + version sets, the meta's version); the bound on the writers a node starts in an + epoch; and the sizes a version, a set, a list, a path and a value may have, each + within what a sync message carries. A node that doesn't know the policy stops taking + changes. Until stage 4, a federated swarm takes no remake. 2. **What counts**, read by the current version and the keys; shown in the API. Reports of the versions a node refused; a tool reporting, from the votes, a party that voted twice. |
