diff options
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/federation.md | 9 |
1 files changed, 7 insertions, 2 deletions
diff --git a/docs/federation.md b/docs/federation.md index ae010fb..669527d 100644 --- a/docs/federation.md +++ b/docs/federation.md @@ -410,7 +410,9 @@ else does: 4. a version behind the current one; 5. of the writes at a place that 1 and 2 leave, one another of them has in its history, and of those left, all but the one with the lowest ID; and so of a party's key sets, - and of its node lists. + and of its node lists, once those written under an earlier version than another of + them are left out: one written under a version that names the party's keys anew + replaces whatever an old key wrote at a history from before it. So a place's value, a party's set and its list are each the latest its party signed that counts: what the party signed after replaces what it signed before, whatever order the @@ -546,7 +548,9 @@ each as its party's ([`store.md`](store.md), [Members](store.md#members)); anoth list does nothing for a node. A party's list counts until the party writes another or a version names one anew, whatever keys its version names since, so that no change of keys leaves a swarm without members; a list a stolen key wrote stays until the party writes one -under the version that replaced that key, which it can at once, through any member. A node +under the version that replaced that key, which it can at once, through any member, and +which a list the stolen key writes at a history from before that version, whatever its +ID, doesn't replace ([What counts](#what-counts), 5). A node puts whatever events it is given, its party's and others' alike: what counts is who signed an event, not which node put it. So a party without nodes of its own writes through any node that takes its events. @@ -725,6 +729,7 @@ fold, with crafted events. *Sim*: a simulation. *Bench*: measured, not judged. | 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 | — | | 67 | A party keeps a proposal alive that nobody else backs, to hold back automatic checkpoints | Holds back none: a node proposes a checkpoint beside a proposal it wouldn't back that nobody backs but its proposer | sim | | 68 | A checkpoint proposed at heads that leave out what was written since: a key set dropping a stolen key, say | Not backed: clients and nodes back a checkpoint only where what they held for a while is among its heads, in their history, or above them; a node shows what they lack | unit | +| 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 | ## Roads not taken |
