aboutsummaryrefslogtreecommitdiffstats
path: root/docs/federation.md
diff options
context:
space:
mode:
Diffstat (limited to 'docs/federation.md')
-rw-r--r--docs/federation.md6
1 files changed, 4 insertions, 2 deletions
diff --git a/docs/federation.md b/docs/federation.md
index f36eabd..e47da93 100644
--- a/docs/federation.md
+++ b/docs/federation.md
@@ -619,12 +619,14 @@ store of its own from the federation's ([`store.md`](store.md), [Forks](store.md
heads with that version current. Every proposal is a chance to fork: the version is
usually one that didn't pass.
2. A fork is named by its root's ID, which nobody can steer to a given name, the
- federation it came from least of all. It takes only events with its root in their
+ federation it came from least of all; a few of its first digits can be, by trying
+ versions, so an ID is compared whole. It takes only events with its root in their
history: what the stayers sign after it isn't taken there, nor what the fork's
parties sign after it in the federation they left.
3. The others join it as a node joins any swarm, by its ID. A node holding the history
up to those heads builds the root and checks it, says what it holds that those heads
- lack, and, party by party, whether the fork's version gives it the keys it had there:
+ lack, what the fork's version changes of the one current there, its rules and their
+ order among it, and, party by party, whether it gives the party the keys it had there:
a founder may give a party that didn't go keys of its own. A node that doesn't hold
that history takes the root on its operator's word, as its operator names the fork.