diff options
| author | tv <tv@krebsco.de> | 2026-11-19 14:44:31 +0000 |
|---|---|---|
| committer | tv <tv@krebsco.de> | 2026-11-19 15:53:25 +0100 |
| commit | c61ee56ad0dad9f3c7468616d89d944eda7f5edb (patch) | |
| tree | 275db3f4e6f2ed980871aa7fe301e195eb54048c | |
| parent | 33be6b959c9777c40ca2b16507e9f4f60d6d2d44 (diff) | |
docs: purges in rounds, a version's size, a thief asking, one spelling
What the docs left unsaid, each with a row of the attack table:
* two thirds are of the current version's parties, so taking parties
out in rounds leaves fewer to decide: of nine, four alone after two
rounds; those taken out fork (row 75);
* a version is one event, its parties and rules with it, within
256 KiB: a federation giving each name a rule of its own holds a few
thousand names (federation.md, the rules guide);
* a thief holding a key a version names can ask for the party's keys to
be named anew as well as the party, and the others tell them apart by
other means than the key (row 76, the keys guide);
* rules match spellings, so `7` and `07` are two places, which two
rules may give to two parties; the application takes one spelling of
each (row 77, the rules guide).
| -rw-r--r-- | docs/federation.md | 12 | ||||
| -rw-r--r-- | docs/guides/federation/designing-rules.md | 7 | ||||
| -rw-r--r-- | docs/guides/federation/keys.md | 4 |
3 files changed, 21 insertions, 2 deletions
diff --git a/docs/federation.md b/docs/federation.md index 23522e6..8b7c504 100644 --- a/docs/federation.md +++ b/docs/federation.md @@ -251,7 +251,9 @@ A version is none if a field is missing or more (but for `checkpoint`, which it leave out), if it names more than 96 parties (two thirds of them would be more votes than a version event may name), if it gives a party more keys than a key set may hold or more nodes than a node list, or a rule a path longer than a write's may be, or if it breaks -any of the above. A proposal is taken whatever it holds: whether it is a version is asked +any of the above. A version is one event, its parties and rules with it, so it fits in +256 KiB: a federation giving each name a rule of its own holds a few thousand names. A +proposal is taken whatever it holds: whether it is a version is asked where a version event names it, so that nodes knowing more of what a version may say don't part from those knowing less. A node can't tell a version that is none from one a later continuum reads: at a version event writing one that passed, it stops @@ -318,6 +320,11 @@ each a place for it ([`guides/federation/proposing-and-voting.md`](guides/federation/proposing-and-voting.md), [Counting support first](guides/federation/proposing-and-voting.md#counting-support-first)). +Two thirds are of the current version's parties. A version taking parties out leaves the +rest to decide by two thirds of fewer: of nine, six take three out, four of the six take +two more, and four decide alone after two such rounds. Those taken out fork, as any +outvoted party. + Once a proposal passed on the current version, a node writes it as soon as it holds it passed, by a **version** event, `{"deps": […], "version": <hash>}`, which no party signs: any node may write it, and the same version written by several is one (below). @@ -813,6 +820,9 @@ fold, with crafted events. *Sim*: a simulation. *Bench*: measured, not judged. | 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 | — | | 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 | — | ## Roads not taken diff --git a/docs/guides/federation/designing-rules.md b/docs/guides/federation/designing-rules.md index bd577cd..d8654f9 100644 --- a/docs/guides/federation/designing-rules.md +++ b/docs/guides/federation/designing-rules.md @@ -62,6 +62,10 @@ Keep party names apart from the shared spellings: a party named `wiki` takes `wi where a `{party}` rule comes before the rule giving it to lass. Put the rules naming shared places first, and let no party be named like one of them. +Rules match spellings: an address written `ip4/10/243/7/3` and one written +`ip4/10/243/07/3` are two places, which two rules may give to two parties. Take one +spelling of each (no zeros in front, lower case), as no rule can tell them apart. + ## What rules cost A version holds all its rules, and every change of one is a version, which takes the @@ -69,6 +73,9 @@ parties' votes. A rule per shared name is a vote per name, and makes every versi much larger: give zones and blocks by rules where the spelling allows, and leave literal rules to what is shared. +A version is one event, all its rules with it, of at most 256 KiB: a rule per name holds +a few thousand names. + Nor does a rule bound how many places below it a party writes, or how large a value is but by an event's size (256 KiB): every node holds what counts, and every checkpoint names it, 32 bytes an event. A party writing more than the others will hold is taken out diff --git a/docs/guides/federation/keys.md b/docs/guides/federation/keys.md index add7cb3..f21171f 100644 --- a/docs/guides/federation/keys.md +++ b/docs/guides/federation/keys.md @@ -110,7 +110,9 @@ set that party wrote count no more. to pass a version naming the party's keys anew, at once; then write the party's set and node list under it, as a list the thief wrote stays until the party writes one under the version that replaced the key. If the thief voted twice meanwhile, nodes may have - taken two versions: the parties answer that by forking. + taken two versions: the parties answer that by forking. The thief can ask as well, as + the party would, holding the same key: the other parties make sure who asks by other + means (in person, a key of the party's set the thief lacks) before passing it. ## The node key |
