summaryrefslogtreecommitdiffstats
path: root/docs
diff options
context:
space:
mode:
authortv <tv@krebsco.de>2026-11-19 14:45:14 +0000
committertv <tv@krebsco.de>2026-11-19 15:53:30 +0100
commit5c55f04bd2ccfc545930f6bc3cbb148ab5e34ff3 (patch)
tree9a581a058c646aaf59378106d250d4feb4b85480 /docs
parentc61ee56ad0dad9f3c7468616d89d944eda7f5edb (diff)
federation.md: what the attack table's answers lack yet, and what won't come
Reviewers read the design, not the plans kept apart from it. The attack table says now, where a row's answer isn't the best there could be, what would answer it better and isn't built (*Not yet*): * voting twice (12): nodes keeping the two votes, and forks announced in the swarm, followed where k of m named parties go; * parties that never vote (18): parties that write and don't vote; * a stolen key a version names (23): keys for some acts only, and acts taking two of a party's keys; * one first version, two federations (37): a salt in the first version; * joining from the root (63): a join asking its operator every time, not a restart; * a party named into another's zone (72): names of one label; * writing without bound (73): limits the parties set, perhaps per rule; * a followed party's key, stolen (78): following k of m; * more than 96 parties (79): votes gathered beneath the version event. Roads not taken says why a `true` isn't taken back, nor moved once its proposal is far short, and why no event says a party would back one.
Diffstat (limited to 'docs')
-rw-r--r--docs/federation.md29
1 files changed, 21 insertions, 8 deletions
diff --git a/docs/federation.md b/docs/federation.md
index 8b7c504..83030ff 100644
--- a/docs/federation.md
+++ b/docs/federation.md
@@ -742,7 +742,8 @@ federated; its parties start one, and sign into it what they keep.
What an attacker does, and what happens; what it does to the store, its document and its
remakes, is the store's ([`store.md`](store.md), [Attacks](store.md#attacks)). *Unit*: the
-fold, with crafted events. *Sim*: a simulation. *Bench*: measured, not judged.
+fold, with crafted events. *Sim*: a simulation. *Bench*: measured, not judged. *Not
+yet*: what would answer it better, which isn't built.
| # | Attack | What happens | Test |
|---|---|---|---|
@@ -757,18 +758,18 @@ fold, with crafted events. *Sim*: a simulation. *Bench*: measured, not judged.
| 9 | A version with a field missing or more, a rule under `_continuum`, without a literal first segment, with `**` not last, `{party}` twice, or a writer that is no party of it | No version: passed, a node stops at a version event writing it, as at one it doesn't know (39) | unit |
| 10 | A proposal naming a federation, or saying what, a node doesn't know | Taken as a proposal; asked where a version event names it | unit |
| 11 | `true` on two proposals of one version | The second refused, unless the first is dead at its history | unit |
-| 12 | `true` on two proposals at once, from two nodes | Both taken; two versions changing one may be written; each node keeps the one it took and refuses the other; reported; the parties fork | unit, every order |
+| 12 | `true` on two proposals at once, from two nodes | Both taken; two versions changing one may be written; each node keeps the one it took and refuses the other; reported; the parties fork. *Not yet*: nodes keeping a party's two votes and showing them, so that no checkpoint hides who voted twice; a fork announced in the swarm, which a node follows where k of m parties it names do | unit, every order |
| 13 | `true` and `false` on one proposal at once | Both held; a node that saw only one may write a version. As 12 | unit, every order |
| 14 | A vote cast at a history from before, on a proposal made since | Refused: its proposal isn't in its history | unit |
| 15 | A party's vote signed again, at another history | One vote; voting twice is read from the votes alone, not from where they are in history | unit |
| 16 | A party changes keys after voting or proposing, or beside its vote or proposal | It counts as cast, by its version's keys | unit |
| 17 | Votes split, honestly or not | Nothing passes; nays make the proposals dead, and another passes | unit |
-| 18 | The parties beyond two thirds never vote, or vote `false` on everything | Nothing passes; the others fork | unit |
+| 18 | The parties beyond two thirds never vote, or vote `false` on everything | Nothing passes; the others fork. *Not yet*: parties that write and don't vote, outside the count | unit |
| 19 | A node of the party a version takes out writes that version | Taken: a version counts by its votes, not by who wrote it | unit |
| 20 | The keys an earlier version named pass another proposal on it, or one that died, at a history from before, the votes cast before counting with theirs, so that after a close vote one key voting twice is enough, and raise its number | Refused by every node that took the version after it, and reported; a node that lagged, or joins from the root, may take it: keys voted twice. Refused by every node once a checkpoint above that version passed: a node voting by itself proposes one after every version changing more, unless told otherwise (`--store-propose-versions`) | unit |
| 21 | Two versions changing the one a node reads, coming together | It takes the first it judges, and refuses the other | unit |
| 22 | Values signed with a key a party's set holds, stolen | Count until the party drops the key | unit |
-| 23 | A key a version names, stolen, votes, or writes its party's set or list | Counts while that version is current; the party's own vote beside it is voting twice, answered by a fork | unit |
+| 23 | A key a version names, stolen, votes, or writes its party's set or list | Counts while that version is current; the party's own vote beside it is voting twice, answered by a fork. *Not yet*: keys a version names for some acts only (votes on checkpoints, say), and acts that take two of a party's keys | unit |
| 24 | A write in another party's namespace, at an identifier of another's, or where no rule matches, `null` included | Refused by the rule | unit |
| 25 | A key its party dropped writes, at a history from before the drop, after what the party signed | Counts no more, and replaces nothing the party signed | unit |
| 26 | Two writes of one party at one place, neither in the other's history | The lower ID is the value, until the party writes again after both | unit |
@@ -782,7 +783,7 @@ fold, with crafted events. *Sim*: a simulation. *Bench*: measured, not judged.
| 34 | A fork whose version doesn't change the one current at its heads, or isn't numbered one past it | No fork | unit |
| 35 | A fork at heads of its founder's choosing | Joiners holding the federation are told what those heads lack | unit |
| 36 | A fork's version giving a party that didn't go keys of its founder's | Joiners holding the federation are told, party by party | unit |
-| 37 | Two founders forking one version at one set of heads, or starting a federation from one first version | One store: its root is built byte for byte | unit |
+| 37 | Two founders forking one version at one set of heads, or starting a federation from one first version | One store: its root is built byte for byte. *Not yet*: a salt in the first version, so that a federation for tests and one for real, of one first version, part | unit |
| 38 | A group whose parties list no nodes forks | Its version names their node lists | unit |
| 39 | A federation, or a version, a node doesn't know | Of its root, it holds no store; at a version event writing one that passed, it stops: takes nothing and refuses nothing, until it runs a continuum that reads it, or its operator has it drop that event | unit |
| 40 | Two parties each writing a key set beside the other's vote, crossed | Nothing: votes go by their version's keys | unit |
@@ -808,7 +809,7 @@ fold, with crafted events. *Sim*: a simulation. *Bench*: measured, not judged.
| 60 | Two nodes of one party, each voting by itself | They can vote twice, answered as any party voting twice: a party has one node vote by itself | — |
| 61 | A key a version names, kept on a node that votes by itself, stolen with it | As 23: it counts while that version is current | unit |
| 62 | A party's event spelled anew by another: its `sig` or `key` encoded otherwise, its signature's S not canonical (of ECDSA, the order less `s`, or `r` or `s` with zeros more in front), its blob naming another key | None: `key` and `sig` read back to themselves, the signature is checked strictly (of ECDSA, `s` low and `r` and `s` each its shortest), and the blob's key is `key` | unit |
-| 63 | A node joining from the root is shown a chain old keys grew, beside the one the others took | It takes the first of the two versions it judges, as any node, and reports the other; its operator chooses. Once a checkpoint passed, it joins from a pinned one, where that chain is never taken | unit |
+| 63 | A node joining from the root is shown a chain old keys grew, beside the one the others took | It takes the first of the two versions it judges, as any node, and reports the other; its operator chooses. Once a checkpoint passed, it joins from a pinned one, where that chain is never taken. *Not yet*: a join asking its operator every time, for the current version's hash or a checkpoint; a node restarting with its files isn't joining | unit |
| 64 | Checkpoint heads before the current checkpoint, or at which it isn't current, or one in another's history | No version: a version event naming it is refused | unit |
| 65 | After a checkpoint, a party that backed a second proposal once its first was dead, the nays that freed it withheld by those who cast them | Not named: its client keeps those nays with its `true` | unit |
| 66 | Two clients of one party back two proposals at once, or its operator votes by hand beside the node that votes for it | Voting twice: a party votes from one client, the node that votes for it where it has one, through which it votes by hand | — |
@@ -817,12 +818,14 @@ fold, with crafted events. *Sim*: a simulation. *Bench*: measured, not judged.
| 69 | A key a version names, stolen, writes its party's node list at a history from before the version naming the party's keys anew, beside the list the party writes under that version, several, for the lowest ID | The party's counts: of a party's lists, those written under the latest version come first | unit |
| 70 | A checkpoint's version proposed again, by an event beside its heads | Voters back it all the same, as a proposal lapses with the move, and vote on an event proposing it above its heads, as a node shows them; a version event on votes beside them is refused | unit |
| 71 | Merge events under the base revision, signed by a node its party doesn't list, by a party's key, or spelled otherwise | Refused, or none: a merge event is taken only under a revision with merge events, signed by a node its party's node list names, its `merge` `true`; it counts for nothing | unit |
-| 72 | A version, or a fork's, admitting a party named as a segment of places others write, or changing the rules or their order, so that who writes those places moves, rules unchanged in the first case | Taken, as any version two thirds pass, or any fork: a party's client names each place holding a value whose writer a proposal changes before it is voted on, and a fork's check does for the fork's version | unit |
-| 73 | A party writes a great many places, so that every node holds them, and every checkpoint, snapshot and fork's root names them | Taken where its rules let it write: nothing bounds what a party writes but the rules' places and an event's size; the others take it out by a version, or fork | — |
+| 72 | A version, or a fork's, admitting a party named as a segment of places others write, or changing the rules or their order, so that who writes those places moves, rules unchanged in the first case | Taken, as any version two thirds pass, or any fork: a party's client names each place holding a value whose writer a proposal changes before it is voted on, and a fork's check does for the fork's version. *Not yet*: party names of one lower-case label, so that none reads as a name in another's zone (`x.tv` in tv's) | unit |
+| 73 | A party writes a great many places, so that every node holds them, and every checkpoint, snapshot and fork's root names them | Taken where its rules let it write: nothing bounds what a party writes but the rules' places and an event's size; the others take it out by a version, or fork. *Not yet*: limits the parties set in the version, perhaps per rule: places below it, bytes of a value | — |
| 74 | A party's second `true`, on a proposal made at a history holding its first, which nays ended later | Taken: a vote builds on the nays that freed its party, as well as on its proposal, so that the first is dead at its history; on a checkpoint only where those nays are in the history of its heads, and else the party backs the next | unit |
| 75 | Two thirds take parties out, then two thirds of those, in rounds | Taken: two thirds are of the current version's parties; of nine, four decide alone after two rounds; those taken out fork | — |
| 76 | A key a version names, stolen, asks the other parties to name its party's keys anew, as the party would | Taken where they pass it: they tell the party from the thief by other means than the key, which both hold | — |
| 77 | One place spelled two ways (`ip4/10/243/7/3`, `ip4/10/243/07/3`), each under another rule | Two places: rules match spellings; the application takes one spelling of each | — |
+| 78 | A party that nodes follow, its key stolen, backs checkpoints | The nodes following it back them too, by their voters' rule, once a while after a move at most (`--store-back-after`). *Not yet*: following only what k of m named parties back | — |
+| 79 | More parties than a version may name | None past 96: two thirds of them would be more votes than a version event may name. *Not yet*: votes gathered by events of their own, beneath the version event | — |
## Roads not taken
@@ -838,6 +841,16 @@ fold, with crafted events. *Sim*: a simulation. *Bench*: measured, not judged.
can do at a third of them, and leaves a split for good. With nays a split ends, and
one party voting twice on a close vote can have two versions written; the votes show
who, and the parties fork without it.
+* **Taking back a `true`**, or moving it to another proposal once the first is so many
+ votes short. A `true` standing at one history and taken back at another would let two
+ versions be written with nobody voting twice; one moved only once its proposal is more
+ than m votes short would still let m + 1 parties voting twice split the nodes, and
+ would leave more proposals that can neither pass nor die. A party not ready leaves a
+ proposal be, or votes `false`; past a bad version, the parties fork.
+* **An event saying a party would back a proposal**, binding nobody. Plain writes at a
+ place a rule gives each party say as much, and count for nothing in the votes
+ ([`guides/federation/proposing-and-voting.md`](guides/federation/proposing-and-voting.md),
+ [Counting support first](guides/federation/proposing-and-voting.md#counting-support-first)).
* **A recount without a party that voted twice.** Its second vote can come at any time,
at a history from before, and would undo a version long after it passed; and honest
parties who backed one proposal, then another once the first was dead, would look as