aboutsummaryrefslogtreecommitdiffstats
path: root/docs/federation.md
diff options
context:
space:
mode:
authortv <tv@krebsco.de>2026-11-16 14:03:30 +0000
committertv <tv@krebsco.de>2026-11-16 15:06:23 +0100
commit891a5ab58036ee977acf0037cee51b840d39bce4 (patch)
tree59f4f7bef32336ae3ce5bfa4ea28c55a7ba9d26e /docs/federation.md
parente0cac08c5c293f5eb05a5ddf5302b9dc89d9e44d (diff)
docs/federation: votes a node casts by itself
A party may have one of its nodes vote and propose for it, by rules its operator sets and nowhere written in the swarm: following a party it names, backing what that party proposed or backed and voting `false` where it did, by default on versions that only move to a checkpoint; and proposing such a version once conditions its operator sets are met, where nothing else is proposed. The node keeps to what a party's client keeps to, one node a party votes by itself, and it holds a key the party's version names, which a thief takes with it.
Diffstat (limited to 'docs/federation.md')
-rw-r--r--docs/federation.md52
1 files changed, 44 insertions, 8 deletions
diff --git a/docs/federation.md b/docs/federation.md
index ce65ebe..a7da50c 100644
--- a/docs/federation.md
+++ b/docs/federation.md
@@ -392,6 +392,35 @@ a party proposes one where nothing else is proposed on the current version. A
federation's root is its first checkpoint, without heads (Starting a federation), and a
fork's root a checkpoint at the heads it forks at (Forks).
+### Votes a node casts by itself
+
+A party may have one of its nodes vote and propose for it, by rules its operator sets:
+the rules are written nowhere in the swarm, and every node judges what such a node signs
+as it judges any vote or proposal. The design has two in mind:
+
+* **Following**: back a proposal where a party the rule names proposed or backed it, and
+ vote `false` where that party did. By default the rule follows only versions that only
+ 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.
+
+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
+each voting by itself can vote twice; none for a proposal that is no version; and, by a
+rule for checkpoints, none for a version that changes more than its number, what it
+changes and its checkpoint, which it checks against the current one. Where two
+checkpoints are proposed at once, the votes split, as any do; a rule may vote `false` on
+the one it doesn't back, so that one dies and its backers are free.
+
+It signs with a key the party's version names, which the party keeps on that node, not
+apart: one stolen there votes, and writes the party's key set and node list, as the
+party's, until a version names its keys anew (Keys). A party that won't keep one there
+votes by hand.
+
### Nodes
A party lists the nodes that carry for it, by node ID, in its **node list**: a `nodes`
@@ -439,10 +468,9 @@ weren't among the first to go (every party its founders consider honest, say), s
they can follow whenever they like, without asking.
What a party's nodes do of themselves is their operators' business, written nowhere:
-join a fork their operator follows, vote as parties their operator follows voted, vote
-by bounds their operator set, or do nothing without their operator. So a federation that
-cooperates can have a group that leads without being named: the active parties the
-others follow.
+join a fork their operator follows, vote by rules their operator set (Votes a node casts
+by itself), or do nothing without their operator. So a federation that cooperates can
+have a group that leads without being named: the active parties the others follow.
### Shared identifiers
@@ -564,6 +592,10 @@ crafted events. *Sim*: a simulation. *Bench*: measured, not judged.
| 55 | A checkpoint a node can't build, handed to it by peers, or a fork's root it can't check | Taken only where its operator pinned it, or named the fork | unit |
| 56 | Two versions changing one, naming different checkpoints | As 12: each node keeps the one it took, and moves to its checkpoint | unit |
| 57 | A key added back, or a place given back, after a checkpoint | Brings back nothing signed before the checkpoint that counted no more there | unit |
+| 58 | A party a node follows proposes, or backs, a version that changes more than its checkpoint | A rule for checkpoints doesn't back it; one following on any version does, as its operator chose | unit |
+| 59 | Two checkpoints proposed at once, by nodes voting by themselves | The votes split; nays from the nodes backing one make the other dead, and its backers are free | sim |
+| 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 |
## Roads not taken
@@ -612,6 +644,9 @@ crafted events. *Sim*: a simulation. *Bench*: measured, not judged.
needed, but an adversary's node could make one whenever it likes, forgetting what
counts no more and making nodes that were away take one on their operator's word
again; and two at once would part the nodes until their operators chose.
+* **A party's voting rules written in the swarm**, so that every node sees whom it
+ follows. They are its operator's, as the fork its nodes follow is; in the swarm, a
+ stolen key would rewrite them.
* **A place where a party says which fork it went to.** A node following it by itself
would follow a stolen key into a swarm with any policy; parties say where they went as
they like.
@@ -679,10 +714,11 @@ continuum builds and behaves as it does, and its tests pass untouched.
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, and a tool
- reporting, from the votes, a party that voted twice. 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.
+ 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.
5. **Remakes**: compaction only, the snapshot holding the store as it is at its base,