From dd720b2556fa64bd07dc1d087b502ac4ab0f7899 Mon Sep 17 00:00:00 2001 From: tv Date: Thu, 19 Nov 2026 01:48:58 +0000 Subject: vote: propose a checkpoint after so many versions The votes cast before count at a history from before too: a proposal that died, or a rival, needs there only the votes it lacked, and after a close vote one key voting twice is enough, at any time until a checkpoint above the version that followed. Nodes that took that version refuse it; one lagging behind, or joining from the root, may take it. `federation.md` said it took the keys of two thirds of the parties. A node voting by itself proposes a checkpoint once so many versions were written since its store's (`--store-propose-versions`), as the design lists: with 1, after every version, so that what keys voting twice grow beside a version ends at a checkpoint above it. `federation.md` says how little a rival version takes, row 20 too, and the guides the option. --- docs/federation.md | 16 +++++++++++----- 1 file changed, 11 insertions(+), 5 deletions(-) (limited to 'docs/federation.md') diff --git a/docs/federation.md b/docs/federation.md index 1d77e4f..ceb1064 100644 --- a/docs/federation.md +++ b/docs/federation.md @@ -336,9 +336,13 @@ chain the node took. won't wait fork. * **Two versions changing one** are written only where keys voted twice: a party voting `true` and `false` on one proposal, each shown to some, or `true` on two; or the keys - an earlier version named, for two thirds of its parties, passing another proposal on - it at a history from before the version that followed: some party among them backed - that one too (two shares of two thirds share a party). Each node keeps the version it + an earlier version named passing another proposal on it at a history from before the + version that followed: some party among them backed that one too (two shares of two + thirds share a party). The votes cast before count at such a history too, so it takes + only the votes a proposal lacked there: after a close vote, one key voting twice, its + `true` on a proposal that died where its `false` isn't in the history, can be enough, + at any time until a checkpoint above the version that followed, as the votes it builds + on are all before that version. Each node keeps the version it took and refuses the other, so nodes holding the same events still read the same policy, and an event whose history holds both is refused, as no version is current there; the sides are apart, and a node that lagged behind, or joins, may be shown @@ -520,7 +524,9 @@ as it judges any vote or proposal. The design has two in mind: * **Proposing a checkpoint**: propose a version that only moves to a checkpoint, at heads the node has held for a while, once conditions its operator sets are met: so many events or bytes held beyond its checkpoint, so many versions since it, or so long - by its own clock, by which nothing anyone judges goes. It proposes only where no + by its own clock, by which nothing anyone judges goes. One after every version ends, + at the checkpoint, what keys voting twice could grow beside that version at a history + from before it. It proposes only where no proposal on the current version holds it back, as such a version lapses what is: one it would back that can still pass; one that can still pass that a third of the parties back, someone but its proposer among them; or one new, held for less than a while, whose @@ -694,7 +700,7 @@ fold, with crafted events. *Sim*: a simulation. *Bench*: measured, not judged. | 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 | | 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, for two thirds of its parties, pass another proposal on it at a history from before, and raise its number | Refused by every node that took the version after it, and reported; a node that lagged may take it: keys voted twice | 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: nodes may propose one after every version (`--store-propose-versions 1`) | 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 | -- cgit v1.3.1