aboutsummaryrefslogtreecommitdiffstats
path: root/docs/guides/federation
diff options
context:
space:
mode:
Diffstat (limited to 'docs/guides/federation')
-rw-r--r--docs/guides/federation/designing-rules.md7
-rw-r--r--docs/guides/federation/keys.md4
2 files changed, 10 insertions, 1 deletions
diff --git a/docs/guides/federation/designing-rules.md b/docs/guides/federation/designing-rules.md
index bd577cd..d8654f9 100644
--- a/docs/guides/federation/designing-rules.md
+++ b/docs/guides/federation/designing-rules.md
@@ -62,6 +62,10 @@ Keep party names apart from the shared spellings: a party named `wiki` takes `wi
where a `{party}` rule comes before the rule giving it to lass. Put the rules naming
shared places first, and let no party be named like one of them.
+Rules match spellings: an address written `ip4/10/243/7/3` and one written
+`ip4/10/243/07/3` are two places, which two rules may give to two parties. Take one
+spelling of each (no zeros in front, lower case), as no rule can tell them apart.
+
## What rules cost
A version holds all its rules, and every change of one is a version, which takes the
@@ -69,6 +73,9 @@ parties' votes. A rule per shared name is a vote per name, and makes every versi
much larger: give zones and blocks by rules where the spelling allows, and leave literal
rules to what is shared.
+A version is one event, all its rules with it, of at most 256 KiB: a rule per name holds
+a few thousand names.
+
Nor does a rule bound how many places below it a party writes, or how large a value is
but by an event's size (256 KiB): every node holds what counts, and every checkpoint
names it, 32 bytes an event. A party writing more than the others will hold is taken out
diff --git a/docs/guides/federation/keys.md b/docs/guides/federation/keys.md
index add7cb3..f21171f 100644
--- a/docs/guides/federation/keys.md
+++ b/docs/guides/federation/keys.md
@@ -110,7 +110,9 @@ set that party wrote count no more.
to pass a version naming the party's keys anew, at once; then write the party's set and
node list under it, as a list the thief wrote stays until the party writes one under
the version that replaced the key. If the thief voted twice meanwhile, nodes may have
- taken two versions: the parties answer that by forking.
+ taken two versions: the parties answer that by forking. The thief can ask as well, as
+ the party would, holding the same key: the other parties make sure who asks by other
+ means (in person, a key of the party's set the thief lacks) before passing it.
## The node key