aboutsummaryrefslogtreecommitdiffstats
path: root/src/transport
diff options
context:
space:
mode:
authortv <tv@krebsco.de>2026-11-15 03:53:39 +0000
committertv <tv@krebsco.de>2026-11-15 03:53:39 +0000
commit4667fbf86fac9693753608d6cfc7ed0bee5ef9af (patch)
treea43ce506d7fd995980e0c2b1d6b38c5ae74785c3 /src/transport
parent58efa560c03da03a6c10eaa7efc212fab28ebab2 (diff)
federation: forks are proposals, following is private, housekeeping by any member
- A swarm becomes federated by writing the federated policy with its first version, at genesis or later; what was written before counts only where a party signed it as the first version allows. - A rule's writer is `true` or `false` for every party or none, and `share` two whole numbers ([2, 3]), so nothing needs parsing or rounding. - At most `limits.proposals` of one party's proposals on one version are held at a time; it deletes one to make room. - The keys a version sets are written as the party's keys by the change that makes the version current; the version holds them for nothing else. - What doesn't count may be deleted by any member, judged by what counted at the deleting change's history; the writer that made it stale deletes it, others only what they find stale. An envelope signed with a key still held can be put back where nothing is. - Every proposal is a chance to fork: a group follows one by writing it as the current version of a chain named by its hash. No forks path. - What a party's nodes do of themselves (following others, voting by bounds) is their operators' business and written nowhere.
Diffstat (limited to 'src/transport')
0 files changed, 0 insertions, 0 deletions