diff options
| -rw-r--r-- | docs/federation.md | 12 |
1 files changed, 7 insertions, 5 deletions
diff --git a/docs/federation.md b/docs/federation.md index 83030ff..e13ff8a 100644 --- a/docs/federation.md +++ b/docs/federation.md @@ -580,10 +580,11 @@ as it judges any vote or proposal. The design has two in mind: heads the node holds, where they are no more than an event may name (a node merges them first, under a revision with merge events, [Nodes](#nodes)), 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. 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 + many events or bytes held beyond its checkpoint, so many versions since it that change + more than moving to a checkpoint (one, unless its operator says otherwise), or so long + by its own clock, by which nothing anyone judges goes. One after every such 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 @@ -889,7 +890,8 @@ yet*: what would answer it better, which isn't built. 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. + they like. Following only where k of m parties a node names went would take more than + one key, and isn't built yet ([Attacks](#attacks), row 12). * **Merges**: a fork at heads of several stores, keeping what counts on each side. Its version names every party's keys anew, so that a party writes its key set again before anything a key of its set signed counts; and a value a party replaced on one |
