aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authortv <tv@krebsco.de>2026-11-16 15:19:13 +0000
committertv <tv@krebsco.de>2026-11-16 16:27:09 +0100
commit72cd96142338d4ed8f3c4a5f914fd6ee51e7b9d3 (patch)
tree34eba87ce4746ba59187d294b4f26eaf869d8aa7
parente51e44d41d9ab6a0e0869970c23b8818c7398d46 (diff)
docs/federation: what a party's client keeps, and checkpoints held back
With each `true` it casts, a party's client keeps the votes that made its party's earlier proposal dead, so that once a checkpoint left them out, nothing names its party as voting twice; and a party votes from one client, as two backing two proposals at once is voting twice. A node proposing a checkpoint by itself waits only for proposals that can still pass, and one that nobody but its party backs is ended by the nays of the party a node follows and its followers. Stage 3 builds the client: signing events, keeping its votes and the nays that freed it, and signing again what a move refused.
-rw-r--r--docs/federation.md33
1 files changed, 22 insertions, 11 deletions
diff --git a/docs/federation.md b/docs/federation.md
index 1efe562..138a46c 100644
--- a/docs/federation.md
+++ b/docs/federation.md
@@ -241,7 +241,11 @@ proposal is on, and the proposal, by their hashes.
* **A vote counts as cast**: signed with one of the keys its version names for its
party, whatever keys the party writes since. So a vote is checked from itself and its
version alone, by a client too, and nothing takes it back. A party's client keeps what
- its party voted, and votes by that, never by what a node shows.
+ its party voted, and votes by that, never by what a node shows. With each `true` it
+ casts, it keeps the votes that made its party's earlier proposal on that version dead,
+ so that, once a checkpoint left them out, nothing names its party as voting twice. A
+ party votes from one client: two of its clients backing two proposals at once is
+ voting twice, as two of its nodes each voting by itself is.
* **A proposal passes** once at least two thirds of its version's parties voted `true`
(3·yes ≥ 2·parties). It is **dead** once so many voted `false` that the rest can't
pass it (3·(parties − no) < 2·parties). A party whose `true` and `false` on one
@@ -436,10 +440,13 @@ as it judges any vote or proposal. The design has two in mind:
move to a checkpoint (Checkpoints); its operator may have it follow on any version,
which hands that party the node's vote.
* **Proposing a checkpoint**: propose a version that only moves to a checkpoint, at
- heads the node holds, 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 nothing else is
- proposed on the current version, as such a version lapses what is.
+ 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 nothing
+ that can still pass is proposed on the current version, as such a version lapses what
+ is. A party that keeps a proposal alive nobody else backs holds back every automatic
+ checkpoint, until nays make it dead; the party a node follows votes it `false`, and
+ its followers with it.
Such a node keeps to what a party's client keeps to: one yes at a time; never `true` and
`false` on one proposal, so a party has one node vote by itself, as two of its nodes
@@ -662,6 +669,9 @@ crafted events. *Sim*: a simulation. *Bench*: measured, not judged.
| 68 | A party's event spelled anew by another: its `sig` or `key` encoded otherwise, its signature's S not canonical, its blob naming another key | None: `key` and `sig` read back to themselves, the signature is checked strictly, and the blob's key is `key` | unit |
| 69 | A node joining from the root is shown a chain old keys grew, beside the one the others took | It takes neither, and reports; once a checkpoint passed, it joins from a pinned one, where that chain is refused | unit |
| 70 | Checkpoint heads before the current checkpoint, or one in another's history | No version: a version event naming it is refused | unit |
+| 71 | 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 |
+| 72 | Two clients of one party back two proposals at once | Voting twice: a party votes from one client | — |
+| 73 | A party keeps a proposal alive that nobody else backs, holding back automatic checkpoints | The party a node follows votes it `false`, and its followers with it, until it is dead | sim |
## Roads not taken
@@ -784,12 +794,13 @@ continuum builds and behaves as it does, and its tests pass untouched.
and a checkpoint its operator pins; members by the federation, a node's party in its
configuration and its own entry, shown in the handshake before that entry exists,
nodes syncing with members only (a wire change), neighbours by party, and no token
- from another node; the API putting events and showing what counts; reports of the
- versions a node refused, its operator having it drop what it took, a tool reporting,
- from the votes, a party that voted twice; votes a node casts by itself, by its
- operator's rules. Until stage 5, a federated swarm takes no remake: from stage 4 on,
- one that grows too large starts afresh by a fork whose version names the same
- parties, keys and rules.
+ from another node; the API putting events and showing what counts; a party's client,
+ signing events, keeping its votes and the nays that freed it, and signing again what
+ a move refused; reports of the versions a node refused, its operator having it drop
+ what it took, a tool reporting, from the votes, a party that voted twice; votes a
+ node casts by itself, by its operator's rules. Until stage 5, a federated swarm takes
+ no remake: from stage 4 on, one that grows too large starts afresh by a fork whose
+ version names the same parties, keys and rules.
4. **Forks**: a store whose root is a checkpoint at another's heads, named by its root,
checked by the nodes holding that history; merges, forks at heads of several stores.
5. **Remakes**: compaction only, the snapshot holding the store as it is at its base,