# Federation: a design A design, not what the code does: none of this is built. It says how a swarm can be kept by parties that don't trust each other, for a first use: the krebs registry of users, their hosts, and the hosts' names, addresses and keys ([krebs/kartei](https://github.com/krebs/kartei)), today plain files in a git repository that one maintainer merges into. Claims about the code as it is are marked *(checked)* where they were read in the code, *(docs)* where they are taken from the docs, and *(assumed)* otherwise; the last section lists them. How sure each part of the design is, is said with the promises. ## Optional A swarm is federated if its genesis change carries the federated policy (below). Everything here holds under that policy, and nothing else changes: * A swarm started as today has no such policy and stays as it is: its rules, its users with their capabilities, its remakes by the members' votes, its tokens, and what its nodes send and do. * The code is apart where it would cost. Judging reads the policy as it does today and takes the federated rules under the federated one only; the resolved registry is kept there only; envelopes carry their new fields there only. The wire's version goes up for every swarm, as with every change to it. * Shown at every stage by the existing tests passing untouched, and by the cost of judging a change (`bench_screening`) staying where it is for a swarm without a policy and with today's. ## The parties and the adversary A **party** is a user and the nodes that carry for it. The user holds SSH keys and signs; its nodes commit what it signed and sync with the others' nodes. Some users are the swarm's **roots**: at first whoever starts it. Nobody owns the swarm, and any party may be malicious, alone or together with others, a root too. What an adversary can do: * run nodes, and once it is in, bring in users of its own; * craft any change: under any actor, with any dependencies (so "made long ago", as the document sees it), any operations; * send different changes to different peers, send none, or pass on only some; * delay or drop messages between any nodes for as long as it likes, short of forever between honest nodes; * choose its node keys, and so where its nodes fall among the members; * steal a key of another party (a user's key, a node's key), as a case of its own. What it can't: forge an Ed25519 signature, or find two changes with one hash. Out of scope: keeping the registry from being read (every party reads all of it), hiding who talks to whom, and a party's own machine taken over whole (then the adversary is that party). The design asks one thing: that an honest federation bears whatever the malicious do. It rules nothing about what happens on a party's own nodes, which nobody could enforce: whom an operator lets in, what it lets them do, what it leaves out when it reads. What it sees to is that nothing coming from any node breaks a promise for the others. ## What is promised To an honest node, whatever the others do, with any number of them malicious (3 to 5 but for what the voters can do to a user, said with each and below): 1. **Only valid changes.** Every change it holds passed the rules, judged as its writer saw the document (at its dependencies). 2. **The same document.** Two honest nodes holding the same changes hold the same document, and resolve it (Resolving, below) to the same registry. 3. **Signed by its user.** Whatever the resolved registry shows in a user's namespace was signed with a key that was that user's when it signed, or is as the root change has it. What it shows as held by a user, the user claimed with such a key, or a rule keeps for it, or a decision gave it (7). A key is a user's by what its own keys signed, or by a decision that gave it first keys anew. 4. **One holder.** The resolved registry gives each name of each kind to one user at most, and each user name to one user. 5. **First come, first served, once a root saw it, and for good once the voters did.** A claim is **settled** once a node of a root committed a change after receiving it, with no other claim of that name standing there: every other claim of it, whenever it shows up and whatever it says it saw, is late. A settled claim is a root's word, and what a root can still do to it is not promised against (below). It is **final** once a third of the voters' nodes saw it hold the name for as long as the policy says: from then on nobody else holds that name, whatever shows up, whatever a root does, whatever is cut off, until its user releases it or is gone, its own key is cut off, or the voters deal with it (7). 6. **Nobody waits for anybody.** An honest user's valid write needs no vote and no other party's consent; it counts at once, and reaches every honest node its nodes reach. And for what the swarm decides together, with the fractions the design recommends and fewer than a third of the voters malicious (the voters are the users an epoch's root change names; a voter is honest here if its user is and the nodes that carry for it are): 7. **Decisions by two thirds.** A proposal (a remake, a number, the policy, first keys for a user that lost its own, a name) is decided only once more than two thirds of all the voters voted for it, and nodes of that many held those votes together. So none is decided that no honest voter voted for, and a side of a partition decides only with nodes of that many voters on it. Of the decisions of one matter every node acts on the same one, the last. A remake changes nothing in what counts: every node builds the next epoch itself, from the changes it holds. Nobody is moved against its will: a decision is refused by choice. What is not promised: * **One history at all times.** Both sides of a partition go on. A name claimed on both sides goes to the side a root was on, or is contested until one side releases it or the voters decide. * **That a name is never contested**, before it is final. Before a claim is settled, a claim made out of its sight contests it. After, a root does, by saying it saw another first; and so does anyone, through one honest node of a root or of the claimant that hadn't received the claim yet and is given the other first. * **A settled name against the roots.** One root contests it. To take it, every root that saw it first has to turn: each cuts off the node that saw it. A final name is out of their reach. * **A name another gave up**, before it is final: whoever released it, or let it go down past its limit or by a cut of its own, takes it back by cutting off the key that signed that, where a root's node had seen it hold the name (Claims). * **Protection from a stolen key** before its user notices: what was signed with it counts until a key above it cuts it off; then all of it stops counting (Cuts), and a user it created or vouched for goes out as by an unvouch, its names waiting until it is gone; but a user another vouches for stays in, with what it claimed: a thief's accomplice keeps the thief's sock in, and so does a root's node that witnesses for it after the cut, in the open. Past what became final meanwhile, and past a remake, it stays. * **Agreement in the classic sense, for what users write.** There is no quorum there, so no n ≥ 3f+1: promises 1 to 4 and 6 hold against any number of malicious parties, and 5 from when a root saw the claim. Only decisions take two thirds, and only the voters make them. * **A name against the voters.** Two thirds of them give a user's first keys anew. Meant for a user that lost them, it hands a name to whoever they say: in the open, over the days a vote takes. The same two thirds free the names of a user that is out, or give them to another, say who has a contested name, and decide a policy that covers a name no more. And a third of them, stamping as they like, make a user that is out gone, a claim final, and what a policy uncovered dropped, at once. A third is one where there are up to three voters: a few maintainers at the start are each that third. And a limit lowered for a day gives the names claimed meanwhile, in sight of what fell past it, to their claimants for good. * **A name through a long partition.** A user unvouched on one side of a partition that outlasts `gone` is gone, though someone vouched for it in time on the other. Two claims that each became final on a side of one that outlasts `final` are contested, until one is released or the voters say whose the name is. * **That everyone follows a decision.** A party refuses one it won't bear, and goes on without it, with those who think alike: two epochs, by choice (Refusing a decision). * **A user put out by the swarm.** Nobody is put out by a vote: a user is in while one user that counts vouches for it (Unvouching). So a user is out when those who vouched for it say so: one root, for a user only that root created. * **Decisions against a third of the voters.** A third or more of them keep anything from being decided, and by voting both ways get two proposals of one matter decided and choose which is the later. So does a node that carries for a third of them, until they name another (Decisions). * **When a proposal is decided.** One that had the votes and lacks records of nodes hangs over its matter: whoever holds the last record chooses the day. The voters end that by deciding a later proposal of the matter (Decisions); not for a remake. * **A remake the voters changed their minds on.** A vote for a remake isn't released, and a voter has one an epoch. So a remake that hangs comes on the day its last record does, for the rest of the epoch, and those who voted for it vote for no other. A node follows a remake at once only within `remakeAge` of taking its base up; past that, it waits in the epoch until the new epoch's carry records count for more than a third of the voters (Partitions). Every node holds that number, but each took the base up when it reached it, and gets the decision when it does: whoever holds the last record can show it when some honest nodes are past that and some aren't, and splits them. The split shows, and heals once those carry records count for more than a third; until then those that followed stay, or go back by their operators' word, their users signing again what they wrote there. And voters who split their votes between two remakes, neither getting more than two thirds, end the epoch's remakes: those left go apart (Going apart). One voter can split them: clients keep honest votes on one remake, but a twin proposal made while honest voters vote, within the same minutes, splits those. * **Decisions without the voters.** With a third of an epoch's voters not taking part (gone, silent, without a node that carries for them), nothing more is decided there; what users write goes on. Those left go apart (Going apart). * **Anything of 7 with one voter.** A swarm that one user starts has that user as its only root and voter until a remake names others: it decides alone, and what a third of the voters see, it sees alone. * **Time across a remake.** A length of time that had begun when a remake came starts anew after it. What became gone, final or dropped after a remake's base stays so where the nodes of a third of the voters carried it over (Remakes). * **A bound on what an epoch's document costs.** What is valid as written every node holds until a remake: statements past a limit, writers started past `limits.writers`, a change of a few bytes that holds a million operations, a snapshot built for every remake's base. Each costs memory and time, and nothing bounds how many reach a node as part of others' histories: a limit and a party's budget bound how fast a node takes them from the party itself. Who did it shows, under its nodes' signatures. * **A swarm that never splits.** A node that forks its own actor (two changes with one number) splits the honest nodes that took one from those that took the other, until one side drops its own (Partitions). It is found, proven and named; it isn't prevented. How sure: 1 to 4 follow from how changes are judged today plus rules of the same shape, and from Kleppmann's result that a hash-linked change graph whose validity depends on a change and its history alone converges whatever the faulty nodes do (*Making CRDTs Byzantine Fault Tolerant*, 2022): high, given the conditions under Why it holds. 6: high. 5 is this design's own construction, argued below: medium for settled, and for final as sure as the lengths of time are, which are read from the nodes' stamps: medium, less where clocks are off. 7 is the two-thirds argument with votes that take days: medium. 5 and 7 want the tests named under Attacks, and someone trying to break them. ## The design It builds on the strict policy ([`access.md`](access.md), Values signed by their users): values as envelopes their users sign, which every node checks against the registry as the writer saw it. What it adds: users come in by being vouched for, and go by being unvouched; each has its namespace; names of declared kinds are held by one user each; what a key signed can be cut off after the fact; and the swarm decides by its voters' votes. ### The policy, in the genesis change A federated swarm's policy is `{"version": 2, "values": "signed", "users": "vouched"}`, with what the rules read beside it in `_continuum/access`: the kinds of names (`claims`), the paths in namespaces whose values are signed (`userSigned`, as today), and the **numbers**. All of it is in the swarm's genesis change, with the roots, the voters, and the users it starts with. ("Root" here is always a user: an epoch's first change, the genesis change or a remake's snapshot, is its **root change**.) * Nothing is ever written before the policy, so nothing is judged by none. * Every node is given a root change and takes no other: the genesis change (`--genesis-root`), or, in a swarm that was remade, the ID of a later epoch. That is what a party trusts, not what its seeds say. * A node that doesn't know the policy doesn't sync at all. (Today it receives without judging *(docs)*, which here would let anything in.) The policy changes by a decision: each number by itself, the rest as a whole (The policy changes by a decision). **The numbers.** The quantities of this design are numbers of the policy. The design recommends; the genesis policy sets each, and a decision changes any of them to any value: | Number | Recommended | What it says | |---|---|---| | `window` | 7 days | how long a vote runs | | `gone` | 30 days | after how long seen out a user is gone; none: its names wait until a vouch or a decision | | `final` | 30 days | after how long seen holding a name a claim is final; none: never | | `uncovered` | 90 days | how long what a policy no longer covers stays aside before it is dropped; none: until its user takes it away | | `archiveRetention` | 90 days | how long a node answers for an epoch it left, at least | | `stamp` | 1 day | how often a node that is up renews its alive stamp | | `baseAge` | 10 minutes | how much of what a node holds a remake's base may lack | | `remakeAge` | 30 days | how long after taking its base up a node still follows a remake | | `witness` | 1 minute | how long a root's node lets a claim wait before it writes | | `limits.keys` | 64 | keys a user has at once | | `limits.nodes` | 64 | nodes carrying for a user at once | | `limits.users` | 16 | users a user created that stand; a root: no limit | | `limits.vouches` | 64 | vouches of a user that stand | | `limits.proposals` | 8 | proposals of a user that are open | | `limits.writers` | 1024 | writers a user's nodes start in an epoch before more are put off | | `limits.name` | 255 | bytes of a name | | `limits.entry` | 4096 | bytes of a node's member entry | | a kind's `limit` | none | names of the kind a user holds by a claim | | `fractions.decide` | 2/3 | a decision takes more than this share of all the voters | | `fractions.seen` | 1/3 | the share of the voters whose nodes must have seen a thing for long: a user out, a claim holding, a thing uncovered | What today's genesis change sets for the swarm as a whole (how many neighbours, the topology, the dissemination *(checked: `swarm::bootstrap`)*) are numbers of the policy too. The relays aren't: in a federated swarm they are each node's configuration (`--libp2p-relays`), addresses its operator lists, which come and go, nothing in the document, which nobody may write plain. Nothing constrains them, and a number that makes no sense has the result it has. A time of nothing is "at once"; a limit of nothing lets nothing more in; a `baseAge` of nothing takes a base that lacks nothing. Three end deciding itself: a `fractions.decide` of 1, `limits.proposals` at 0, a `window` of nothing; a `remakeAge` of nothing ends remaking, as nobody follows a remake at once. What is left then is refusing that decision, or going apart. A proposal that leaves a number without a value where it needs one is no proposal. More than a share is strictly more; a share of the voters, for what was seen for long, is the fewest voters that are that share at least, and one at least. Where this text says two thirds and a third, it means the two fractions as recommended. What is promised of decisions is argued for those; a swarm that sets others has what its numbers carry (Why it holds). What a node does for itself alone (how fast it takes a party's changes) is its own setting. ### Users: statements, keys, nodes `_continuum/users//` holds the **statements** about and by a user, each an envelope kept under its SHA-256, never replaced or deleted: the register only grows. A statement is signed by one user and says one thing: | Statement | Signed by | Says | |---|---|---| | `create` | another user (the creator) | the name, its first keys | | `vouch` | another user | "I vouch for this user too", naming it by its ID (no keys) | | `unvouch` | the signer of a `create` or `vouch`; a root, for what is the seats' | that one taken back (Unvouching) | | `key` | the user | one more key | | `retire` | the user | a key, and the cut after which what it signed doesn't count | | `node` | the user | a node that carries for it; or one that stops, with a cut | | `release` | the user | a claim, a vote or a proposal of its own given up; or itself | | `claim` | the user | a name it wants (Claims; in the name's own register) | | `propose`, `vote` | a voter (a fork: any user) | Decisions | * **A statement says where it was signed.** Its payload names the changes its signer had seen, by their hashes (`seen`), as a cut does, and a change that carries it must have them in its history. One statement is **in sight of** another if the other is in the history of what it names. That, and not the change that happened to carry it, is a statement's place wherever its place matters: carried a second time, by anyone, it is where it was. Its envelope names the register as its path. * **A user is its creation.** The `create` statement's digest is the **user ID**, and every envelope the user signs names it, with the name, the swarm and the epoch it was signed in. Two creations of one name are two users with two sets of keys; which has the name is decided below, and a key listed in both signs for the one its envelope names. * **A user the root change holds** has the ID given there, and needs no creation. It may be there without keys (a registry moved in from elsewhere): then it is in, has its name and what the root change holds in its name, and nobody signs for it, until a root's `create` for that name gives it its first keys. That is no other user. Such creations are claims of one thing, ordered as claims of a name are (Two claims), with the roots' nodes alone as their witnesses (a user's nodes carry for it by its keys, which these decide): one signed in sight of another that stands is refused, one late against another is late for good, and of two that contest each other neither gives keys until the voters say which (they give first keys anew: Decisions). So a root that comes later than another to give keys gives none, and of two that answer at once, each root's node seeing its own first, neither does. No root releases its `create`: once one gives keys, they are the user's, which gives itself up as any user does. * **A user's own name, by its own key.** A user claims its own name as a name of the kind `user`, signed with its own key: a claim of what it has already. It counts toward no limit, a user has one at a time, and it holds the name on where its creation no longer does (its creator's key cut off: Cuts). It is valid only where a rule of the kind `user` would let the user itself create that name: a name kept for one creator's creations goes with that creator's cut, and where only the roots create users, a user's name rests on its creation, which a root's cut takes back only where no other root's node had seen it (Cuts). A rule that changes by a decision uncovers own-name claims as it uncovers any claim. A creation of the name in its sight is refused, as a claim is. Clients make it right after a creation. * **Keys form a tree.** A user's first keys are those its creation names. A `key` statement adds one, signed with a key the user has, which is **above** the new one, as are the keys above itself. Any number over time; at once as many as `limits.keys` says. Use: the first keys stay offline, and add the keys of the devices. Any key signs for its user, but for one thing: giving the user up takes a first key. * **A node carries for a user** once the user named it and the node agreed: the node itself commits the `node` statement that names it, in a change that holds nothing else but its member entry. A node commits changes only while it carries for a user, and any node commits any user's statement but a `node` statement, which the node it names commits: a node can choose when it commits one, and on what, but not what its signer says it saw, so which node commits a statement, or whose, says nothing of it. So every change is some party's: its node's signature proves the node ([`access.md`](access.md), signatures required), and the user's statement binds the node to the user. At once as many nodes a user as `limits.nodes` says. * **A user without a node** names another party's, which carries for it too if it agrees. That node's changes witness for both, and it takes proposals up for both: for the swarm, such a user is the party that carries for it. Nothing is signed in its place. It names nodes of more than one party where it can: each records for it, so no one of them alone keeps it from counting, nor chooses the day. * **Writers.** A node writes as a writer (an Automerge actor), a fresh one each time it starts, rejoins or drops *(docs)*, and when a change of its own writer that it didn't make reaches it signed with its own key: a copy of its files writes as it too. Unsigned, such a change is anyone's forgery, and switches nothing *(checked: `access::screen`)*. Every writer costs every node memory while the epoch lasts, in proportion to the document's history: about 4 bytes per change *(measured upstream)*. So a federated node keeps its writer over a clean stop, and each node counts the writers each user's nodes start in the epoch: past `limits.writers`, a change that starts another is put off by every node that would take it from that user's nodes, until a remake. A node's writers count for one user: the one its member entry names, of those it carries for, where each writer starts (a writer counts for the user it was counted for, until a cut leaves it out), its own word, carried over a remake with the entry; naming none of them, the user of the `node` statement naming it with the lowest digest, of those that count there, so that its operator names one to choose. So a user past its limit puts off the nodes whose writers count for it, and no other that carries for it too. It is never refused: put off is each node's doing, its operator may take what it puts off (`POST /admin/put-off/take`, naming the user), and a change that reaches a node within another's history is taken. Writers a node started outside a cut it was stopped with count for nobody: a thief's node costs its victim nothing once cut off, and where the count falls back below the limit so, every node takes what it put off for that user, read again from the changes, nobody acting: late, with what was built on it. A writer is a run, not a write: with a thousand, three nodes each crash or rejoin daily for most of a year. A node whose writers count for a user past it is put off as a whole, with what it carries for others and its records of proposals, until a remake or its operator takes what is put off; how many a user's nodes started shows (`GET /registry/users`), for a remake to come first. * **A party's budget.** A node takes changes from a party's nodes no faster than a budget, its own setting: what is over waits, and nothing is refused for it. For a budget a party is a user with the users below it that no line reaches but through it, as the graph stands where the node reads it: creating users makes no second budget. A node carrying for several users draws on each. * **Past a limit.** A user's statements of one kind are counted from the first: each has, and states, the number after the highest of those it was signed in sight of, and of two with one number the one with the lower digest comes first. A statement is past its limit if as many of that kind come before it as the limit allows. What was given up (a key retired, a node stopped, a claim released, a proposal decided or released) or is left out by a cut comes before nothing, whenever that was: so what a thief signed with a stolen key stands in nobody's way once the key is cut off. What comes to count that way, later than it was signed, gets nothing by it: a claim gives way to what was claimed in sight of it meanwhile (Claims). It doesn't count while it is past its limit. The limit is the one that holds where the registry is read: lowered, it leaves out the last. So for every limit: keys beyond the first, nodes, creations, vouches, proposals, a kind's claims. Across a remake, what the snapshot holds comes first, then what is carried over, by the numbers it states, then what is signed in the new epoch (Remakes). * **Names** of users are 1 to 64 of `A-Z a-z 0-9 . _ @ -`, as today, less the top-level keys the swarm uses otherwise (`_continuum`). Which of them may be created, and by whom, the kind `user` says (Claims). ### Vouching, lines, the roots A user creates whom it likes, within a limit (`limits.users`), and vouches for whom it likes, within another. The new user signs, claims and creates in turn from its creation on: in any change that has the creation in its history. Users and what they signed for each other form a graph, the roots at its top. A **line** of a user is a chain of creations and vouches that count, from a root down to it. A user is **vouched for**, and in, while it has a line. So rings away from the roots hold nobody, and a vouch by a user whose own lines all pass through the one it vouches for adds none. When its creator goes (unvouched, cut off, out), a user that another vouched for stays in, by that line, without doing anything. When the last goes, it is out (Unvouching). A line says who is in, and nothing else. Who vouched for whom gives nobody a say about another's names (the witnesses of a claim are its user's nodes and the roots': Two claims), and says nothing about who connects to whom (Reaching the others). What it does give: a creator's limit bounds how many users come in through it, and each shows below it, for all to see, and goes with it when it goes. Bringing someone in means handing over, out of the document, what a party needs to connect and to start (the root change, some seeds, the swarm key where there is one), and writing the `create`. **The roots** are the users the epoch's root change names as such: in a genesis change the user who starts the swarm, or those the file it starts from names; then those a remake names (Remakes). They change with a remake only, so a root is one for its whole epoch. What sets a root apart: * It is in by its seat: it needs nobody's vouch while it holds one, and nobody's unvouch puts it out. A user that held a seat and holds none any more is in like anyone, by a line: one that leaves its seat has someone vouch for it, or is out. * The lines start at the roots. What a root signed for another (a `create`, a `vouch`) counts while its signer holds a seat, and is the **seats'** after: it counts while there are roots, whoever they are. A user the root change holds without a creator is in by the seats too. Its signer takes back what it signed while it holds a seat. What is the seats' the roots take back together: it is taken back once each of them unvouched it. So where there are several, no root alone puts out a user the root change holds. * Its nodes' changes witness every claim, which is what settles one. * It creates users without a limit. What is the seats' counts toward nobody's limit. * It holds the names a rule gives to a root, while it holds its seat. A remake that leaves a root out says which root has each of them from then on: its claim is made over, and no such name is ever without a holder. What a user signed before it was a root stays its own. A root can't write in another's namespace, nor take a name that is final. It can contest any name that isn't, in the open. With several roots, any one that is up settles claims, any one that lies contests them, and none takes a name alone. A root that is away, or turns on the others, is left out by the voters at the next remake; what is final stays as it is meanwhile. ### Lengths of time The document orders what was written: a change's history is what its writer had seen. It measures no time. The nodes' alive stamps do, each by its own node's clock *(checked: `alive`, Unix ms)*. So a length of time is read between two stamps of one node, and what that node had seen at each, from the stamps' histories. A thing has been **seen for** a length of time, at a set of changes, once a third of the voters (`fractions.seen`; the voters: Decisions) each have a node with two alive stamps that far apart or more, the thing so at both and at every stamp of that node between. The earlier stamp is in the later one's history, and between them are that node's stamps that have the earlier in their history and are in the later's: so a stamp that shows up afterwards, built on neither, lies between nothing. A thing is so at a stamp as that stamp's own history resolves. A length of nothing takes one stamp. A node counts for one voter in this, though it carry for several: as many voters have seen a thing as can each be given a node of their own. It is read from the changes alone: the stamps are changes in the history, each renewal one. * A node that is up renews its stamp as often as `stamp` says, whatever else is written or isn't. (Today the interval follows what members publish in their entries *(checked: `swarm::members`)*; in a federated swarm it is the policy's.) So nobody does anything to be seen, and there are always stamps to read time from. While no node writes at all, no time passes: nothing is seen for longer by it. * The length that counts is the number's as it holds in the later stamp's history. What was seen for long stays so: gone, final and dropped never go away. * A remake starts every length anew: what was being seen is seen from the new epoch's first stamps on. What had been seen for long stays so (Remakes). No clock is compared with another. A third, because decisions are argued against fewer than a third of the voters being malicious: so few show nothing by themselves, whatever they stamp. And no more than a third, because everyone it takes must be there: two thirds may have left, and the rest still see it. ### Unvouching A user takes back a `create` or a `vouch` it signed: `unvouch`, naming it. Nobody else can; what is the seats', the roots take back together (Vouching). What it does, exactly: * **From the unvouch on, as far as the user had been seen.** What the user signed counts through this creation or vouch if the unvouch was signed in sight of it, or if a node of the unvoucher or of a root committed a change with it in its history and not the unvouch. Everything else it signs is past the point. So an unvouch that says it saw little undoes nothing that its signer's own nodes, or a root's, had seen. * **Another vouch keeps the user.** With another line, the user stays in, with everything it has. * **Else the user is out, from there.** Nothing of it counts: its namespace doesn't, its nodes witness nothing, and what they commit in sight of the unvouch is refused. Its names **wait** for it, its user name among them: its claims stand, so nobody else claims them, and nobody holds them. One thing it keeps: where it is a voter, it votes on, and its nodes record proposals (Decisions). Who votes is a remake's word, not its vouchers'. * **Those it brought in go with it,** from the same point: a user all of whose lines ran through it is out too, with the same consequences, unless another user that counts vouches for it, before or after. * **A vouch brings a user back,** with its names and what it signed in between, as long as it isn't gone. What another claimed meanwhile, in sight of a claim of the user's that didn't count then, stays the other's (Claims). * **Out for long is gone.** A user is **gone** once it has been seen out for `gone` (Lengths of time). Then its claims and its creation stand no more: whoever comes first claims its names, and no vouch brings it back. It comes in again by being created anew. * **Or by a decision.** While a user is out, the voters free its names or give them to another (Decisions), at once and whatever `gone` says. Where the policy sets no `gone`, the names wait until a vouch or a decision. * **What it did before stays done.** Releases it signed stand, and so does what others built on them. * **Out of sight.** What the user signs saying it saw nothing of the unvouch, or on the far side of a partition, is valid as written, so nodes hold it; it is past the point, and doesn't count. A node takes changes of an unvouched user's nodes only as part of another party's history, never from those nodes, so they can't make it work; but for their records of proposals, where the user is a voter (Decisions). So whoever relied on a user that is out has that long to find another who vouches: for itself, and for those it brought in. Until then nothing it holds is taken, but by a decision. **Only who signed takes back.** A vouch is its signer's word, and nobody else takes it back: not the users above the signer either, who answer for the signer, whom they brought in. One of them that wants a user out unvouches whom it brought in itself. That takes all below along, and those worth keeping get another's vouch while their names wait. Were it otherwise, a root, above everyone, would put out whom it liked, and for good: every line passes one. **Nobody is put out by a vote.** A user is in while one user that counts vouches for it, and no decision changes that. Against a user that keeps within the rules and harms all the same (squats names up to its limits, gets others' names contested) there is: the voters saying who has a contested name; its vouchers unvouching it; and a root unvouching the user it created above it, with all below, who then need other vouches. A vouch from anyone brings it back. A user gives itself up by a `release` of its own creation, signed with a first key. That puts it out by its own word: its names wait, and it is gone once seen so for `gone`. Until then a cut takes the release back like any other statement, the voters' cut too, where the first key was stolen. ### Namespaces A user's namespace is the top-level key with its name. One rule: below ``, only envelopes signed by a user of that name, at the depths `userSigned` lists (for the registry, `["*", "hosts", "*"]`: a host is one signed value). A value there is replaced as today, by an envelope naming the one it replaces (`prev`): the value that shows there where it is signed. Where several count there (written at once), it names any one of them, and replaces them all, as a write in the document does. Nothing plain is written anywhere but a node's own member entry, its own records of proposals and its carry record. Delegating (another user writing below `/shared`, say) would be a statement in the user's register granting a capability within its namespace: for later; the rule has room for it. ### Claims: names held by one user What must be unique across users (a host's name, an address, a top-level domain) is **claimed**. The swarm declares the kinds, as data in the policy: ```json { "name": { "chars": "a-z0-9-", "rules": [ { "match": "**.{user}.*", "by": "{user}" }, { "match": "*.*", "by": "{voters}" }, { "match": "*", "by": "{root}" } ] }, "ip4": { "chars": "0-9", "rules": [ { "match": "10.243.*.*", "by": "*" } ], "limit": 256 }, "user": { "chars": "a-z0-9_-", "rules": [ { "match": "*", "by": "*" } ] } } ``` * **A name is written as it is used**: `toaster.tv.r`, `10.243.0.7`. It is one key in the document, and a rule's `match` is written the same way. Both are split into segments at the kind's `separator` (a dot, unless the kind names another) and compared segment by segment: `*` fits any one segment, `**` one or more (once in a rule), `{user}` one segment, taken as a user's name, anything else itself. * **Structure, not meaning.** Continuum doesn't ask what a segment is: `10.243.foo.bar` fits `10.243.*.*`. Nor does it know that two spellings mean one thing (`::1`): names are compared as written. What a name means is the application's, which claims one spelling and reads no other. A name is `limits.name` bytes at most, and no path: it has no `/`. * **Its characters.** A kind may say what its names' segments are made of (`chars`: characters and ranges of them). A name with any other isn't one of the kind, so the `10.243.foo.bar` above is none where `ip4` says digits. Recommended wherever case means nothing: lower case only, so that `TV` is no name beside `tv`. The kind `user` says so for the users' names, within what continuum takes for one. * **The first rule whose `match` fits says who may hold the name** (`by`): a user, or one of a list; anyone vouched for (`"*"`), first come, first served; the user whose name stands where `{user}` does; a root (`"{root}"`); or whom the voters give it to, by a decision (`"{voters}"`). No rule, no holder. * A name a rule gives to `{user}` is **kept**: it is that user's without a claim, since nobody else could claim it, and it is nobody's while there is no such user. Its user may claim it all the same. Such a claim doesn't count toward the kind's limit while the name is kept, and is what holds the name on if a policy stops keeping it. * So above: everything below `tv.` is tv's, for any top-level domain, whatever tv claimed. A name right below a top-level domain (`wiki.r`) is given by the voters. A top-level domain is a root's to claim. An address goes to whoever comes first, 256 a user. * The kind `user` is the users' names themselves: its rules say who may create which (a swarm can keep names for one creator). Above, anyone creates a name of one segment. `_continuum/claims///` holds the statements about one name, again only growing: `claim` (by the user who wants it) and `release` (by that user, of its claim: how a name is given up). A claim **stands** while it counts, isn't released, its user isn't gone, a rule of the policy lets its user, and no decision freed the name or gave it to another. The claims of a user that is out stand as they stood: a rule that lets anyone lets anyone who isn't gone. A claim is taken, as its writer saw the document, if a rule lets the user, the user is within the kind's limit, and no claim of that name stands there. That is first come, first served wherever one claim was made in sight of the other: the later one is refused by every node. **In sight of a claim that didn't stand.** A claim is taken where it was committed. The registry asks again, among all the changes a node holds, whether the other stood where the claim was signed: in the history of what the claim says its signer saw, with the decisions there, and with the witnesses there that have it count though the claim's carrier left them out (an unvouch reaches only as far as its signer's nodes and the roots' hadn't seen: Unvouching). If it stood, the claim gives way, as if it had been refused. If it didn't only by an unvouch or a cut (its user's line, or the key that signed it, left out there), the two are ordered as claims out of each other's sight (Two claims), over all the changes: what the claimant says it saw is its to say, and the witnesses it leaves out of that history are still witnesses. So the nodes of the other's side that had it count while the claim wasn't there make the claim late, for good, and a root's node that had it count only after the fact makes both late: they contest each other. Else the other gives way, for good: whatever has it count or stand again later (a vouch that brings its user back with what it signed meanwhile, a limit raised, a rule that lets its user again, a witness made after) doesn't bring it back over the claim. One thing does bring an earlier claim back over a later one: it was down only by a release, by a cut, or by statements past which it fell (its limit) that a cut has left out since, and a root's node had seen it hold the name before it went down. It is then read as never down, and the later one gives way, unless it is final (below). That is what a user has against a thief who released its names, or claimed before them to push them past their limit; and it holds for the user's own doing too: a name it gave up so by its own key it takes back by cutting that key off. A claim that was cut off before anyone saw it hold, to wait for someone to claim the name, comes back over nothing. The registry shows such a later claim as held while a release, a cut, or the statements past which the other fell stand. A claim says nothing else. What the name is for is in the namespace: a host's entry names its addresses and names, and they count while its user holds them. ### Two claims out of each other's sight Two users claim one name at once, or on two sides of a partition, or one of them pretends to: it crafts a claim that says it saw nothing of the other's. No node can tell these apart, and both claims are valid as their writers saw the document, so every node holds both. What decides is who can be shown to have seen what. The witnesses for a claim are its **side**: the nodes of its user and of the roots. * Of two claims neither of which was signed in sight of the other, one is **late** against the other if a change committed by a node of its side (one carrying for its user or for a root when it committed it) has the other in its history, standing there, while the claim itself wasn't there yet, or didn't stand there: the claimant's side had seen the other hold the name while the claim didn't. Whether a claim stood there is read from that history; one that was down there only by a release or a cut that a cut took back since is read as standing. Where one was signed in sight of the other, sight decides alone (Claims). * A claim that is late against another, and not the other against it, is late for good: it doesn't stand, and its user claims anew. So nobody waits in line for a name with a claim that says it saw nothing: when the holder releases it, is gone, or the voters free it, whoever comes first then has it. Two claims that are each late against the other both stand. * A user's own claims of one name are one: they don't contest each other nor make each other late, and the name is the user's while any of them stands, ordered against others by the earliest. So it doesn't matter from which node, or whose, a user claims, nor how often. * Of the claims of a name that stand, those remain that give way to none. If one remains, its user holds the name, or has it wait while it is out. If none or several do, the name is **contested**: nobody holds it, until releases leave one, or the voters say whose it is (Decisions). Being late is read from the changes alone, so every node finds the same. It goes away only with its witness: where the node that committed the change is stopped with a cut from before it (Cuts). What this gives: * **Settled.** Every node writes its member entry as often as `stamp` says, and a root's node also when a claim reaches it that it hadn't seen, `witness` apart at most. Such a change has in its history everything the node had received. The roots' nodes are on every side. So once a root's node wrote after receiving a claim, while it held no other of that name that stood, every other claim of the name is late against it: one surfacing later, however little it says it saw, and one that was there and comes to count later. The claim is **settled**, within `witness` of reaching a root's node. A node tells (`settled`, below). * **Several roots.** Any one of them settles a claim. Two that received two claims in different orders make each late against the other: contested, as two claims made at once are, and one releases. So with more roots a claim is settled though one is away, and two made within the same moment are contested more often. * **A user that is up is bound by its own node**: after its node wrote once with a claim in its history, it never holds that name against it, short of stopping that node with a cut from before. * **To take a name from a claim**, a rival needs the claim to be late and its own not to be: a node of the claimant or of a root that wrote after receiving the rival and before the claim, and no root's node that wrote after the claim and before the rival. Once a root saw the claim, the second can't be, short of that root cutting its node off. * **Before a claim is settled**, a claim out of its sight contests it, or holds, where a root's node received that one first. Honest users claiming at once see "contested", and one releases. While no root's node is up, a claim isn't settled, and whichever of two reaches one first when it is back holds. * **A node that comes back** (started, or cut off for a while) writes nothing before it caught up with the peers it keeps (its user's other nodes, its seeds): until it holds the heads each of them had when it reached it, as the first STATUS says, whatever they write after, or `witness` passed. A peer that keeps sending keeps it silent no longer. So it is the harder to hand a node a rival before the claim it would have seen first. * **Final.** A claim is **final** once it has been seen holding the name for `final` (Lengths of time). From then on no other claim of the name holds it or contests it, whatever a witness says and whatever is cut off: not a rival that a root says it saw first, not an earlier claim whose release is cut off, not one that shows up with a witness of its own. It ends as a claim does (released, its user gone, by the voters), and it doesn't count where the key that signed it is cut off from before it. Final takes no root: a claim nobody contested for that long is final though no root ever saw it. A final claim gives way to none and is late against none, but for another final one: two final claims of one name contest each other, however they came to be, until one is released or the voters say whose it is. * **A name a root keeps contested** never becomes final by time: final takes holding the name. The voters say whose it is (Decisions), name by name; or they end all of that root's contests at once, by giving its first keys to someone who stops its nodes with a cut from before them. So within a minute a name is its claimant's against any claim that says it saw nothing, as far as a root's node had the claim first. And within `final` against everything else: until then a root can still contest it, in the open, and so can whoever hands a node of a root or of the claimant a rival before the claim. A root that does is left out at the next remake. A user's name is claimed the same way: the `create` statement is the claim, its side the nodes of its creator, of the new user and of the roots. Two creations of one name out of each other's sight are decided as above; while it is contested, no user has the name, and neither namespace counts. A user that doesn't have its name still holds what it claimed where anyone may claim: those claims stand, so contesting a user's name frees none of them. What a rule gives to a name (a kept name, a name only `tv` claims) is nobody's while the name is. ### Cuts: what stops counting A **cut** is a set of changes, named by their hashes: "as far as I saw". A statement is within the cut if a change that carries it is in the history of the cut. Whether it is doesn't depend on who asks or when: a change's history is fixed by its hash. * **Retiring a key** names the key and a cut. What the key signed within the cut counts as before; what it signed outside doesn't count, for anyone, whenever it shows up. A statement signed with a retired key and offered later, saying it saw little, is outside the cut. That is how retiring reaches a node that was away: it needs no order of arrival. * **Who retires what.** A key above another retires it with any cut: a user whose device key was stolen cuts it off from before the theft. A key retires itself only from where it stands (its cut must hold everything it signed that the retiring change's history holds): rotating, not rewriting. No key retires one beside or above it, so a stolen device key can't cut off the keys above it, nor undo what it signed before. * **What a cut keeps, it names.** Beside the cut, a `retire` lists by digest what the key signed within it since the epoch's root change, and every node checks the list where the statement is taken, as it checks a number. So what a retirement keeps holds also where the changes its cut names aren't there: after a remake. A node's stop lists what its cut keeps the same way, and so does a decision's cut of a user's first keys. A list is 32 bytes for each statement and value kept, since the root change: what a remake resets. * **A node that stops carrying** is named with a cut the same way, by the key that named it or one above: what it committed outside the cut is nobody's, as a witness or as a carrier. * **A cut never reaches its own statement.** A `retire`, a stop and an `unvouch` count by the key that signed them and the node that carried them as these were where the statement was judged, and are left out only by a cut of that key set by another statement. So a key retires itself, a node commits its own stop, and a retirement counts though the node that carried it carries only by what the retired key signed. * **What a cut takes back.** Everything the key signed outside it: a claim, a release, and also what that key cut off itself; a vouch and a creation as its signer's unvouch would (below). The keys it retired and the nodes it stopped count again, and a user it unvouched is in again. That user's claims from before stood all along, its names waiting; what it signed while it was out comes to count later than it was signed, so a claim of it gives way to what was claimed in sight of it meanwhile. What became gone, and what a decision dealt with, stays so. * **A vouch or a creation taken back.** A `vouch` or a `create` outside a cut stops counting as an unvouch by its signer would, signed where the statement that set the cut was (a decision's: its proposal): what the user signed counts through it where that statement was signed in sight of it, or where a node of the signer or of a root committed a change with it in its history and not that statement (Unvouching): a signer that turns on what it created cuts as it would unvouch, and the roots' nodes witness against both. A root's node that witnesses so for a thief's sock keeps the sock in, in the open. With another vouch standing, the user stays in, with its keys, its claims and the users it brought in. Without, it is out from there: its names wait, final ones too, and it is gone once seen out for `gone`, unless a vouch comes. * **A creation is also a claim.** A `create` outside a cut is taken back as the claim of the user's name too; not as the user: its ID and first keys are what the creation names, and a vouch names a user by its ID. A root's creation is not taken back where a node of another root had it in its history and not the statement that set the cut: there it stays the claim of its user's name, and, for a user the root change holds, its first keys. So a root that turns takes back only a creation the other roots' nodes hadn't seen, minutes old, never a name settled or final; and a thief of a root's key keeps what it created in their sight, for the voters to undo (Decisions). Its name the user keeps where it claimed it with its own key (Users), that claim ordered from where it was signed; else it is without a name, as a user that lost its name, and its namespace doesn't count until it has one. What stops counting stays in the document, and every node holds the same. It is left out when resolving. In a namespace, where a value that doesn't count replaced one that does, the one that does is read again (Resolving). The price: a key above retiring one below with an early cut takes back what that key signed since, a release among them, further back than an unvouch reaches; a vouch or a creation no further than its signer's unvouch would, signed where the retirement was, with the same witnesses, so a user brought in goes out, its names waiting. Whoever relies on another's statement relies on that, until what it holds is final: a second vouch is what keeps a user in, whatever becomes of its creator's keys. And a user's first keys have none of its own above them: above those are the voters, who give a user first keys anew by a decision (Decisions). Any key of a user signs for it, so a device key in the wrong hands unvouches whom the user brought in and releases its names. A key above takes all of that back with a cut, as far as nothing final was built on it. Only giving the user itself up takes a first key. A cut reaches no further back than the epoch (Remakes). ### Leaving a user out when reading A side note, since it is no part of the design: nothing here lets the swarm bar a user, and nobody is put out by a vote. What a party does about a user it can't unvouch (one that squats, a root that contests its names) is its own: whoever reads the registry may leave out whom it likes, from where it likes, and reads on without them. That changes nothing any node takes or refuses, so it splits nothing; it also means two parties that leave out differently read two registries where a name is contested. A node bars no node for the swarm either: it stops its own with a cut, and refuses as peers whom its operator says. ### Decisions Some things are the swarm's to decide: its numbers and the rest of its policy, a user's first keys where it lost its own, the names of a user that is out, whose a contested name is, names the rules leave to the voters, and when to compact, with who votes and who the roots are from then on. They are decided by votes of users, signed by them, over days. **Who votes.** The **voters** are the users the epoch's root change names. A genesis change names the user who starts the swarm, or those the file it starts from says. A remake names those of the next epoch: its proposal lists them, by their IDs. So who votes is decided by those who vote, with each remake; nothing that happens after a proposal is signed takes a user off its list or puts one on; and a swarm that one user started is that one's to decide until its first remake. A voter votes for its epoch, with the keys the document has for it, whether it is in, out or gone: who is in is its vouchers' word, who votes is the remake's. What to weigh in a list: * Every voter named counts toward what a decision takes, whether it takes part or not: more than two thirds of all of them. One that never votes stands in the way like one voting against. With a third of them not voting nothing is decided, and no remake either, which is what would name others. * So a list names those who take part: recommended, the users who voted or signed anything in the epoch, which a client makes from the document. All users may be on it; in a registry of many of whom few care, that is the last thing decided. * A swarm remakes while two thirds of its voters still take part. Past that, those left go apart, naming who votes among them (Going apart). So that the line is seen coming, `GET /registry/decisions` shows for each voter when it last voted and when a node of its last stamped. * What is seen for long takes a third of the voters each with a node of their own. A voter without one is whoever carries for it: where one node carries for a third of a list, that node has the say a third has. * Whoever brought users in brought voters in, where the list has them: a user that created sixteen is seventeen of it. The voters see a list before they vote for it (`GET /registry/decisions`), and propose one of their own where they don't like it. A change in who votes takes a remake because a remake is what puts the votes of before out of reach (below). **How.** 1. A voter **proposes**: a statement naming its matter and what is to hold. A matter is one thing that can be one way only: one number, the rest of the policy, one user's first keys, one name. The proposals of a matter are numbered: each has, and states, the number after the highest of its matter that it was signed in sight of. Any number of proposals are open at a time, on one matter too; `limits.proposals` of one voter's at most. A proposal is open until it is decided, its proposer releases it, or one of its matter with a higher number is decided. 2. Voters **vote** for it: each a statement signed by the user, saying when the vote runs out, `window` from signing unless the user says sooner; a node counts no vote for longer than `window` from when it first held it. A voter has one vote on a matter at a time; `release` takes one back, as far as it gets there first: a node that holds the vote without its release counts it, and a proposal may be decided with a vote whose release was on its way. A vote is meant when signed. A vote for a remake is otherwise: it names its base, runs while the epoch lasts, and isn't released (Remakes). 3. A node that carries for a voter **takes the proposal up** once it holds votes for it by more than two thirds of all the voters (`fractions.decide`), none released, each still running by the node's clock, and the proposal says its signer saw all that the node held `window` before the proposal reached it. It records so, once, under `_continuum/decisions//`. It takes up only a proposal with a higher number than any of the matter that it took up, or that it holds as taken up by another node of its voters. Every node judges the record: its history must hold votes for the proposal by that many voters, none released there. (A remake is taken up by its base instead, and its record judged without votes: Remakes.) A record counts for each voter its node carries for, and a voter once, however many of its nodes record. The node of a voter that is out commits its records all the same, and nothing else, and peers sync with it for that: every voter has nodes of its own, and nobody's record stands in for another's. 4. The proposal is **decided**, and is a **decision**, once a record of it has in its history, itself among them, records that count for more than two thirds of all the voters (a remake is decided by its records and the votes naming its base: Remakes). Who carried for whom and what the fraction was are read where each record was written, from its history. That is read from the document, the same by every node, and never goes away while the epoch lasts. **At once.** Nothing waits for a vote's days to end. With the votes there, the nodes take the proposal up as it reaches them, and it is decided as fast as they sync. **The last holds.** Several proposals of one matter can be open, and voted on, at a time, and more than one can come to be decided: voters change their minds. Of the decisions of a matter, the one with the highest number **holds** (across a remake, those carried over come before those of the new epoch: Remakes). Two with the same number, made out of each other's sight, are both decided only where the nodes of a third of the voters took both up, which an honest node doesn't; then the one with the lower digest holds. A decision closes the proposals of its matter with a lower number: clients offer no vote on them. **A node carrying for many.** A record counts for every voter its node carries for. So a node that carries for a third of the voters, and keeps its records back, holds up every decision, and chooses the day of those it is needed for. Its voters end that by naming another node, which commits the `node` statement naming it and records for them; a voter carried by nodes of two parties depends on neither alone. Nothing is lost meanwhile: the votes count, with the records of any node the voter names after. `GET /registry/decisions` shows how many voters each node carries for. **What hangs.** A proposal that had the votes and is short of records (nodes were down, or keep theirs back) can still be decided, and whoever holds the last record chooses the day: a record can be made to look as old as its maker likes, so no rule ends its time. Two things bound it. A node takes up only what is higher than it took up, so what is decided late changes what holds only where no proposal with a higher number was decided since. And it shows: `GET /registry/decisions` has what was taken up, by whose nodes, and how many it is short of. The voters end it by deciding a later proposal of the matter, saying the same or something else: that one holds, whatever comes after. Not so a remake: its votes aren't released, and nothing but its last record ends it (Remakes). **Where a decision counts.** A change is judged by the decisions decided in its history, so one made out of sight of a decision is valid as it was written, and every node holds it. The registry is resolved by the decisions that hold among all the changes a node holds: a limit that was lowered leaves out what is past it, wherever that was signed. Every node acts on the decision that holds, the same from the same changes, unless it refuses it (Refusing a decision). **By any node.** A proposal, a vote and their release are taken in any node's change: the signature is the voter's. So a voter votes at whatever node it reaches, or signs a vote that someone carries to one. A vote kept back counts while it runs, as its signer wrote, and no longer. What brings a vote from a person to a node (a client, a page, paper) is the application's. **From the past.** Votes kept back until they ran out, or crafted to look old, are held while they run by no honest node, so nothing takes their proposal up but its makers' nodes, and their records are judged like any: they need the votes of two thirds of the voters. With that many keys stolen later, a decision of then is made up within the epoch, and holds if it gets the highest number of its matter; the voters decide a later one. A remake puts everything before its base out of reach. A remake's vote doesn't run out: kept back, it counts when it comes, as its signer wrote. The votes are the users' own, signed with their keys, and take the days people take. Taking up is their nodes', and takes as long as syncing does. One time is compared across machines: a vote's end, written by the voter's client and read by the nodes' clocks. A window of days bears clocks that are minutes apart. **What is decided.** * **A number**: any number of the policy, the fractions among them, to any value. Each number is a matter of its own. * **The policy**, the rest of it, as a whole (The policy changes by a decision). * **A user's first keys**, for a user that lost them or had them stolen. The proposal names the user, the first keys it is to have, and a cut for those it has: what they signed outside the cut doesn't count, as with a key above them (Cuts). The voters are above every user's first keys. A user that lost its keys comes in again under another name, so that it has a voice and the voters know whom they give the name back to. Decided, it signs under its name as before, with its names, its lines and those it brought in, and releases the other name. * **A name of a user that is out**, while it waits: each name a matter. The proposal names the user and the name, and that it is free or who is to have it. A name freed is anyone's to claim from the decision on; the user's own name freed, the user is gone. A name given is the user's claim made over: the user the decision names holds it where that claim was, releases it like its own, and it doesn't count toward its limit. A user that is vouched for again has back what no decision dealt with. What another claimed in sight of the claim while it didn't stand (the user was gone meanwhile) stays the other's, as with anything that comes back. * **Whose a name is**, where it is contested, by two final claims too. The proposal names one of its claims: decided, every other claim of the name gives way to it, final or not, and it is final. * **A name the rules leave to the voters** (`"{voters}"`): given to a user, who holds it as by a claim and releases it like one; it doesn't count toward its limit. Released, it is given anew. * **A remake**, and with it who votes and who the roots are in the next epoch (below). An epoch has one. A decision stays, whatever is cut off after: a vote signed with a key that is retired later, from before, stays in it. The days a vote takes are the time to cut a stolen key off. ### Remakes A federated swarm compacts by a remake its voters decide. A remake throws history away and names who votes and who the roots are in the next epoch, and does nothing else: what the next epoch holds isn't voted on. It is the registry as it resolves, which every node works out itself. * **The proposal** lists the voters of the next epoch by their IDs, names its roots (those there are, unless it names others; and for a root it leaves out, which root has each name a rule gives a root), names the node of its proposer that is to be its **coordinator**, and the switch delay. One that names no root is no proposal: nobody would be in. * **The base.** The coordinator names the base in its record of the proposal, by its heads, at once. * **Taking the base up.** Every node takes the base up where the base holds all that the node held `baseAge` before the base reached it, so that a remake can't leave out what the swarm has; or, however old, where records of that base count for a third of the voters, of whom one at least is honest, votes or none. A voter's node records it, with the ID of the epoch it built from it (Continuum changing under a swarm); any other node notes when it took it up, which `remakeAge` counts from, and builds the snapshot only once the remake is decided. Taking a base up chooses nothing: a node takes up every base that passes, one record a proposal (two proposals that name one base have a record each), and switches only to the one decided. Each costs a voter's node a snapshot of the document; a voter has `limits.proposals` open at once, and its budget paces them. * **The votes name the base.** A voter votes for a remake once a node of its took the base up, and its vote names the base. It has one such vote an epoch, never released. A record counts for a voter only where that voter's vote names the record's base. So two bases are both decided only where more than a third of the voters signed votes for both, which no honest voter does: a coordinator that names two bases, to two nodes of each voter, gets one decided or none, and shows: clients offer no vote for its proposal. A client offers a vote only for a base whose records count for more than two thirds of the voters, which every node then takes up, and shows the other remakes under way beside it: a vote is spent only on a base every voter's node can take up. Of the remakes under way that name the same voters and roots it offers one, by a rule every client applies alike (the one with the most votes, then the lowest digest). * **Decided** for a base and an ID, once a change has in its history records of the proposal naming them, and votes for it naming the base, that together count for more than two thirds of the voters. A record is judged without votes: it is written when its node takes the base up, before them, and they are read beside it, not in its history. * **A remake that hangs**, short of votes or records, is decided once they come: every node takes up a base a third took up. Nothing else ends it: its votes aren't released, so whoever holds its last record chooses its day for the rest of the epoch, and those who voted for it vote for no other. A node follows it at once only within `remakeAge` of taking its base up; past that, once the new epoch's carry records count for more than a third of the voters (Partitions). Voters who split between two remakes, neither getting more than two thirds, end the epoch's remakes: those left go apart (Going apart). No node, having switched, moves again by itself: where it finds another remake of the epoch it left decided, it shows it, and its operator says which (`POST /admin/epochs/choose`). * **Every node builds the snapshot** itself once the remake is decided, from the base as it holds it, and switches after the switch delay its proposal names. The snapshot holds the registry as it resolves at the base: * the policy that holds, with its numbers; * the voters and the roots, as the proposal says; * the users that count, and those out and not gone, each with its name (or that it is contested, and with which), ID, keys, nodes, and who created and who vouches for it, or that it is in by the seats; * the claims that stand, the names decisions gave, and what the order among the claims of a name rests on: which gives way to which, which is late against which, which is settled, which final; and of a user the root change holds, roots' creations that contest each other, with what their order rests on, until the voters give it first keys; * the values in the namespaces that count, as the envelopes they are; * what is uncovered and not dropped; * the proposals that are open, with their votes; * the member entries of the nodes that carry for a user it holds, and the epochs' metadata, as today; * the digest of every statement the base holds, for this one epoch. * **What it leaves out**: all history, and with it everything that is over or didn't count. A claim released, and its release. A key retired, a node stopped, an unvouch, each with its cut: what they left out is out for good. A user gone. A proposal that is decided or closed, its votes and the nodes' records: what holds is in the policy and the registry. So after a remake the document's size goes by what stands (users, their keys and nodes, names held, values, members), and for one epoch by 32 bytes for each statement there was; not by what ever happened. Within an epoch nothing is removed: a release is a statement like any other, signed, and a document keeps its history. The remake is what deletes. * **Nothing it dropped is written again.** An envelope is taken in the epoch it names and, carried over, in the next. So that what a remake left out (a stolen laptop's key and node, retired since) can't be handed in again in the next epoch as signed in the one before, the root change lists the digests of all the statements the base held, and of the values deleted there, and an envelope among them is refused. The epoch after drops the list. * **Carried over.** A node that switches first catches up with the peers it keeps in the epoch it leaves, as a node that comes back does. Then, before it takes anything in the new epoch, it commits its **carry record**, every node that switches, whoever it carries for (out voters too: the heal counts their nodes), `_continuum/carried/`: the digests of the envelopes it holds that the base lacks, whoever signed them (statements, values, proposals, votes and their releases), and what it held of them, as the snapshot states it for the base: which claim it held as late against which, or as giving way to which; which statements of a user since unvouched, or whose creation or vouch was cut off, count through the unvouch or the cut; which users it held as gone, which claims as final and what as dropped, beyond the snapshot. One record a node and epoch, of digests and of what the node held. Nothing tells it from a later change of the node, and nothing has to: it witnesses by what it names, not by when it was committed. A node that came to carry after the base commits, with its record, the `node` statement that named it (rule 2). * **Then the envelopes, once.** After its record the node takes from its peers, and writes again, as they are, the envelopes its record names that the epoch doesn't hold yet. Any node commits such an envelope (a `node` statement only the node it names), and only where a carry record in the change's history names it: what no node held when it switched isn't taken in the new epoch. It is taken as it is signed, and never refused for what stands in the new epoch: whether it counts is resolved. So an envelope comes into the new epoch about once, and what each node witnessed comes as 32 bytes a node. * **A carry record witnesses** as the node's changes did in the epoch before: as a change with what it names in its history, standing or not as it says. Against a claim, where a node of that claim's side committed it; for an unvouch, or a vouch or a creation cut off, where a node of its signer or of a root did: the epoch's it leaves, whose roots and voters the record speaks for. So a claim that turns up later as signed in the epoch before is late against what a root's node's record names, and nothing rests on the order a node writes in. Against a claim the snapshot holds, what is carried over gives way. * **Its order and its numbers.** Of a user's statements of one kind, and of the proposals of a matter, those the snapshot holds come first, then those carried over, by the numbers they state, then those signed in the new epoch. So a number nobody could check (a statement signed after the switch as of the epoch before) orders nothing but its own signer's statements among themselves, and a proposal carried over never outranks one of the new epoch. * **Its values.** A value carried over counts while no value its user signed in the new epoch is at its place: whoever writes in the new epoch has the last word over what the epoch before held, seen or not. Of several carried over to one place, one that another replaces is left out (Resolving). * **A cut carried over** is the list its statement carries (Cuts): what the key signed within the cut since the root change counts on, and nothing else of that key that the snapshot doesn't hold. * **Decisions after the base** aren't in the snapshot. Their proposals and votes are carried over, and a node that held one decided takes it up again in the new epoch, whether its votes still run or not: it is decided there once the nodes of two thirds of the voters switched. Until then the registry resolves without it, and what is signed meanwhile with a key the decision cut off is outside that cut once it holds again. Where the remake changed the voters so that its votes are too few, it is proposed again. A remake's own proposal and votes aren't carried over: they are of their epoch, which has its one remake. * **Seen for long, over a remake.** What was gone, final or dropped at the base is so in the snapshot. What came to be so after the base, each node that carries for a voter says in its carry record. What the nodes of a third of the voters of the epoch it leaves say, a node counted for one voter, is so. Every other length starts anew. * **A remake decided late** sends every node to a base that old. What was signed since comes along, about once: every node's carry record names what it holds and what it held of it, decisions among it. What it costs is the lengths of time that had begun, and whatever only a node witnessed that didn't come along. * **What a remake makes final.** A cut reaches no further back than the snapshot. What a key signed that counted at the base counts for good, though the key be cut off later from before; so for an unvouch. The days a vote takes are the time to cut off a stolen key and to sort out what is contested. After, what a thief did stands until it is undone by hand. * **A node that was away** comes back as said below (Coming back after remakes). * **A node that joins** is given a root change to start from, by whoever brings its user in: the genesis change, or the ID of a later epoch. * **No other kinds.** `replace` and `import` put content nobody signed: they start a new swarm. For the registry the document is small: a statement is under a KiB, a node's alive stamp with its digest and signature some 350 bytes, so a hundred nodes stamping daily write some 13 MiB a year. A remake a year is plenty for its size. What a remake also does is name the voters and the roots; a swarm whose users come and go remakes for that. ### Coming back after remakes A node that was away holds an epoch the swarm left, one remake back or several. Its peers name their epoch in the handshake and don't sync with it; `GET /admin/epochs` shows the epochs they name, and which of them the roots' nodes are in. A federated node never rejoins because peers advertise an epoch, however many do. It gets there in one of two ways: 1. **By the archives, on nobody's word.** A peer answers for an epoch it left as long as it keeps that epoch's document: `archiveRetention` at least, longer if its operator says, and every epoch on a node kept as an archive. Peers say in the handshake which epochs they keep. From such a peer the node syncs the rest of the epoch it is in, judging every change; sees the remake decided; builds the snapshot itself; and is in the next epoch, whose ID is the snapshot's hash. So on, epoch by epoch, as far as peers keep them: with an archive within reach, from any epoch to the swarm's, and for a node that joins, from the genesis change. Where the walk ends in another epoch than the node's peers are in, the node stops and shows it, for its operator to say which (`POST /admin/epochs/choose`): an archive can keep changes back, and a decision of long ago can be made up with keys stolen since. Keeping an archive is an application's; continuum answers for what a node keeps. 2. **By an ID, on its operator's word.** Where no peer keeps the epoch any more, the node can't check how the swarm got from there to here. Its operator gives it the ID of the epoch to go to (`POST /admin/epochs/rejoin`), from a party it trusts: as when the node first joined, whoever brought its user in. The node rejoins as today: it downloads that epoch's snapshot from any peer, checked against the ID, and syncs what was written since. Either way, what follows: * **What it holds and the swarm never got.** What was signed in the epoch just before the one the node arrives in is carried over: the node commits its carry record when it arrives, and writes again what the epoch lacks. What was signed further back isn't: an envelope is taken in its epoch and the next, no later. Its own user's go to the quarantine, and the client lists them for the user to sign again. A claim signed again is a new claim, after what was claimed since. * **What it finds of its user**, as the snapshot has it. There, with its keys, nodes and names: the node carries for it as before, and writes its member entry anew. Or out, its names waiting. Or gone, and so not in the snapshot: then no node takes the node's changes, it shows why, and its user comes in again as anyone does. * **As a voter or a root** the user is what the epoch it arrives in names it. * **Its old document** goes to the archive, as today. A node moves to an older epoch, or to another of the same age that doesn't hold by the rule above, only by its operator's word (`POST /admin/epochs/back`, `POST /admin/epochs/choose`). ### The policy changes by a decision The policy but for its numbers is one matter. A proposal carries it whole: the version, the kinds with their rules, `userSigned`. As with every decision, a change is judged by the policy decided in its history, and the registry is resolved by the one that holds. No remake comes with it. A remake throws history away, a change of policy changes the rules, and neither needs the other. * **A policy a node doesn't know.** A node knows a policy if it knows everything in it (Continuum changing under a swarm). One that doesn't can't take the proposal up, so a policy is decided only once nodes of two thirds of the voters know it. A node that doesn't know a policy that holds stops syncing, as under any policy it doesn't know, says why, and goes on once it is upgraded. Or its operator refuses the decision (below). * **What the policy no longer covers** is **uncovered** where the decision holds: a claim that no rule lets its user make any more (the kind is gone, or the rule, or the name is now kept for another or left to the voters), a name a decision gave that the rules no longer leave to the voters, a value at a path `userSigned` no longer lists. It doesn't count. Every node shows it aside, under `_continuum/uncovered//` at the path it had, and no longer where it was. * **A kept name has no claim behind it.** Where a policy stops keeping a name for its user and lets anyone claim it, it is the first comer's at once, unless its user claimed it before: that claim stands like any other. * **Only its user takes it away**, and nobody changes it: a value by an envelope that puts nothing in its place (`null`), a claim by its `release`. Each names the path the thing had. Nothing else is written there. * **For as long as `uncovered` says.** Once it has been seen uncovered for that long (Lengths of time) it is **dropped**: no node shows it any more, and nothing brings it back. At 0 it is dropped at once. Until then, a later policy that covers it again has it count again, where it was. * **Where it is.** Within an epoch a rule moves nothing: a move is a change someone has to write, and every node would have to write the same one. So what is uncovered stays in the document where it was written, shown aside by every node while the policy that holds doesn't cover it. A remake moves it: the snapshot holds what is uncovered and not dropped under `_continuum/uncovered//`, and leaves out what was dropped. Where a later policy covers it again, every node shows it where it was, and the remake after puts it back. * **Whole, not merged.** Two proposals of a policy are two policies, and the later holds: what one changed isn't worked into the other. ### Going apart: a fork by choice Whoever the swarm's decisions leave behind goes on apart, with those who want the same: with an only root that went before the first remake, with a third of the voters gone so that nothing is decided, with two thirds of them turned against the rest, or for a policy the others won't have. A fork is proposed, and binds nobody: * Any user proposes it, one at a time: the policy to go on with (the one that holds, or another), and, if it likes, who votes there and who the roots are. Where it names none, they are as in a remake. Voters may vote for it: that shows who would go, and decides nothing. * The proposer's node names the base, as a remake's coordinator does, when its user says so, votes or none. * A node follows if its operator says so (`POST /admin/fork`, naming the proposal and the base): it builds the snapshot at the base with what the proposal says, carries over what it holds beyond the base, and goes on in that epoch. A node that doesn't stays in the epoch it is in, which goes on as it was. * Both sides have the same history up to the base and the same swarm ID, and from there different epochs. Their nodes don't sync, and leave each other out as neighbours. A statement signed on one side counts for nothing on the other: it names its epoch. What was signed in the epoch both came from counts on both, and a node carries for its user on a side only by writing there. * On each side the voters are those its epoch names, the ones that went the other way among them. A side that keeps two thirds of them remakes, and names those who stayed. A side with fewer decides nothing until it names its own, by a fork of its own. It moves nobody, and takes nothing along but the history: each party chooses its side. ### Refusing a decision A decision binds the nodes that follow it, and no node has to. By default a node follows every decision. Its operator has it refuse: * **By bounds** (`--bounds`, a file; `GET` and `PUT /admin/bounds`): for any number of the policy, the least and the most the node goes along with. A decision that holds and sets a number outside them is refused. Bounds that the policy breaks as the node starts with them refuse nothing: the node shows them. * **By hand** (`POST /admin/decisions/refuse`, naming the proposal): any decision of the epoch the node is in. * **By how late a remake comes** (`remakeAge`, the policy's): how long after it took a base up, by its own clock, a node follows a remake decided on it at once. One decided later it doesn't, until the new epoch's carry records count for more than a third of the voters (Partitions). What refusing does: * **Before.** While a proposal's votes run, a node whose bounds it breaks says so in its member entry, so the voters see who would go (`GET /registry/decisions`). * **The epoch without it.** A node that refuses a decision moves to the epoch built where its proposal was signed (at the changes the proposal says its signer saw, which no honest node took it up without holding all it had held `window` before): the registry as it resolves there, the policy, the voters and the roots as they are there, and the digest of the proposal refused, which makes it no other epoch and no proposal there. Every node that refuses the same decision builds the same epoch, whenever it does. So those who think alike meet there without arranging it. * **What it takes along.** As with a remake, the node carries over what it holds beyond that base, decisions among it but the one refused. So refusing costs what a remake costs whose base is a window older than the proposal was taken up, and however long the decision hung after. * **After**, as after any fork: the same swarm ID and the same history up to the base, different epochs, no syncing between them. On each side the voters are those the epoch names, and a side with too few of them names its own, by a fork. A node moves to the other side by its operator's word. * **A remake** is refused by staying: the epoch a node is in goes on as it was. So every number is the swarm's to set, and each party's to bear or not. A decision that lets one voter decide for all is followed by those who don't mind. This is how Bitcoin changes its rules. Nobody decides for anyone: nodes run the rules their operators chose. A change comes into force once enough of those who count signal that they run it, at a height named beforehand. Nodes that won't have it keep their rules, and with them their chain, the same up to there. And a transaction that would count on both chains is kept to one by naming its chain. Here the signalling is the nodes taking a proposal up, which takes knowing its policy; refusing is keeping one's rules; the height is the base; and the epoch in every envelope keeps a statement on its side. ### What each payload holds The fields each rule reads; a version adds none that a rule reads without a policy saying so (Continuum changing under a swarm). Names of fields are the design's, the encoding the first stage's. **Every envelope** (a statement): `swarm` (the swarm's ID), `epoch` (the epoch it is signed in), `path` (its register, under its own digest), `kind`, `user` and `userId` (its signer: the name it had when it signed, and the ID; a `create`'s signer is the creator), `seen` (the hashes of the changes its signer had seen), `number` (the number of its kind among its user's statements: Users), `key` (the public key that signs) and the signature, over all the rest. Beside those, by kind: | Kind | Fields | |---|---| | `create` | `name`, `keys` (the first keys, public); a root's, for a user the root change holds: `for`, its ID there | | `vouch` | `for`, the ID of the user vouched for | | `unvouch` | `of`, the digest of the `create` or `vouch` taken back | | `key` | `key`, the key added (the signing key is above it) | | `retire` | `key`, the key retired; `cut`, change hashes; `keeps`, the digests it keeps within the cut (Cuts) | | `node` | `node`, the node's ID; a stop: `stop`, with `cut` and `keeps` | | `release` | `of`, the digest of the claim, vote or proposal given up; or `self`, the user giving itself up (signed with a first key) | | `claim` | `claimKind` and `name` | | `propose` | `matter`, `holds` (below), `matterNumber` (its number among its matter's proposals: Decisions) | | `vote` | `proposal`, its digest; `ends`, when it runs out; for a remake `base` (its heads), with no `ends` | A proposal's `matter` and what it `holds`: | Matter | `holds` | |---|---| | `number`, naming it | the value | | `policy` | the rest of the policy, whole | | `firstKeys`, naming the user | the keys, and a `cut` for those it has | | `name`, naming an out user and the name | free, or the user ID it is given to | | `whose`, naming a kind and a name | the digest of the claim that is to hold it | | `votersName`, naming a kind and a name | the user ID it is given to | | `remake` | `voters` (IDs), `roots` (IDs, and for each root left out which root has each name a rule gives it), `coordinator` (a node's ID), `switchDelay` | | `fork` | the policy to go on with, and, if it likes, `voters` and `roots` | A fork is no matter: a vote for one counts toward nothing, shows who would go, and leaves a voter's one vote a matter alone. **What a node writes plain**, each signed by the change it is in, as a node's change is: * **A record of a proposal**, `_continuum/decisions//`: `proposal`; of a remake, `base` (heads) and `epoch` (the ID it built from it, a voter's node); of a fork, `base`, the proposer's node. * **A carry record**, `_continuum/carried/`: `from` (the epoch it left), `digests` (of the envelopes it holds that the base lacks), and what it held of them: `late` and `givesWay` (pairs of claims' digests), `through` (statements that count through an unvouch or a cut: their digests), `gone` (user IDs), `final` (claims' digests), `dropped` (what is uncovered: digests). * **A member entry**, of the shape its policy's version gives it, within `limits.entry`: what it is today (its addresses, what it reaches, whether it is ready, its alive stamp), and `writersFor` (the user its writers count for: Users) and `digest` (the registry as it resolves at the change's dependencies: Continuum changing under a swarm). ### What every node judges A change is first of all one that Automerge itself writes, or it is refused before Automerge sees it, in every swarm *(checked: `document::changes::Written`)*: its bytes are the ones Automerge encodes for it; its first operation is numbered one after the highest of its dependencies; it is its actor's first, or builds on the one before; every operation it names was made in its history and is what it is named as (the object written into, the element of that list, a value or an object at that place); and every operation is one Automerge's transactions write, but for tables and marks, which continuum doesn't write and are refused too *(checked, and generated: `what_passes_leaves_automerge_sound`)*. Automerge 0.12 applies changes that are none of these, and then panics, saves a document that doesn't load, or holds another change than it was given *(measured upstream)*. All of it is asked of the change and its history, as the rules are. A change is valid if, in the document at its dependencies: 1. It has no dependencies and is the root change the node was given (the genesis change, or the epoch's snapshot). Else: 2. Its committer is a node that carries for a user there, one that isn't out and hasn't stopped there, proven by the node's signature. Or the change is the one by which a node comes to carry: it holds a `node` statement naming its committer, by a user that isn't out there, the committer's member entry and, after a remake, its carry record, and nothing else. Or it holds nothing but the committer's own record of a proposal, or its carry record, and the committer carries for a voter that is out. 3. Apart from the node's own member entry (of the shape the policy's version gives it, within `limits.entry`), its own records of proposals and its carry record, it writes only envelopes, each naming the swarm, its epoch, its path, its user and user ID, and for a statement what its signer saw (`seen`, changes in this change's history) and, where statements of its kind are numbered, the number that gives it, signed with a key that is that user's there and not retired there. Any node commits it, but a `node` statement, which the node it names does. 4. In a register (`_continuum/users/`, `_continuum/claims//`): only a new entry under its own digest. Under `_continuum/decisions/`: only the node's own record, once, of a proposal that is there: of a remake, the base its coordinator's record names (the coordinator's own names it) and the ID built from it; of a fork, its proposer's node's own, naming the base, without votes; of any other, with votes for it in the change's history by more than `fractions.decide` of the voters, none released there. Under `_continuum/carried`: only the node's own carry record, once an epoch. Nothing replaced, nothing deleted, nor anything that holds a register. 5. A `create`: its name is one the kind `user` takes, and neither a creation of it nor a user's claim of it as its own name stands there, a rule of the kind lets the signer, and the signer isn't past its limit there; or it is a root's, for a user the root change holds, that has no keys there. `key`, `node`, `vouch`: not past their limits there; a `vouch` for a user that isn't gone there. `unvouch`: by the signer of what it takes back, or by a root for what is the seats'. `retire`, a node stopping: by a key above, or by the key itself as said under Cuts, the cut in the change's history, and its list what the key signed within it. `release`: by the user of what it releases; of the user itself, with a first key; never of a root's `create` for a user the root change holds. 6. A `claim`: of the kind `user`, only by the user of that name, of its own name, while no claim of its own of it stands there, where a rule of the kind lets the user create that name. Else the kind is declared, the name is one of it, a rule lets the signer, the signer isn't past the kind's limit there, and no claim of that name stands there. One that doesn't count there doesn't stand there. 7. In a namespace: at a listed depth, an envelope by a user of that name, replacing what is there (`prev` naming one of the values that count there, where several do); nothing within one, nothing replacing what holds one. At a place the policy no longer covers: only its user's envelope that puts nothing there. 8. `propose`, `vote`: by a voter, with a key the document has for it (a fork: proposed by any user that isn't gone there); a proposal not past its user's limit there (a fork: the only one of its user that is open); a vote where the user has none on that matter that isn't released; for a remake, naming the base a record of that proposal names, and the voter's only one in the epoch. 9. `_continuum/access`, the swarm ID, the epochs, and what the root change sets for the swarm as a whole: never. **What is carried over**: an envelope naming the epoch before this one is held to less, and comes one way only: in a change that has in its history a carry record naming its digest. Any node commits it (a `node` statement only the node it names). What it says its signer saw isn't looked at, and its number orders only among what is carried over. Of 5 to 8 only what the envelope itself shows is asked: its signature by a key that is its user's there, its register, for a value that its `prev` is a value the snapshot or another carried over holds there, and that the root change doesn't list its digest. Whether it counts is resolved. Where a rule goes by a user's name (6, 7) and the name has several creations there, a user that lost it, as far as the change's history shows (another remains, Two claims), is refused; while none remains, each of them may write. So a user whose late creation of a name is known can't scribble over the namespace, and one whose name a liar got contested goes on writing, for those who leave the liar out to read. Judging reads the registers at the change's dependencies, and nothing else: no cut is applied beyond a retiring or an unvouch that is there; who is gone is as the stamps there show; and the policy with its numbers, the first keys and the names freed or given are as the decisions decided there leave them. A statement in a register was valid when it was taken, so judging the next needs no look further back. ### Resolving The **resolved registry** is a function of a set of changes that holds each change's history. In five steps, each reading only the steps before: 1. **Decisions.** Which proposals are decided, and which decision of each matter holds (Decisions): the policy with its numbers, the first keys given, the names freed, given or said to be someone's. A record is read where it was written: who carried for whom, and the fraction, are as its own history has them, so this goes back along the history and ends, and nothing below changes it. 2. **Who counts, and where.** The roots count, by their seats; a user the root change holds without a creator is in by the seats. A user counts at a statement through a `create` or `vouch` for it whose signer counts there by a line that doesn't pass through the user (so this ends), where the statement is within what every `unvouch` of that one leaves and, where that one is outside a cut, what the statement that set the cut leaves, as an unvouch would (Cuts); what is the seats' is taken back once every root unvouched it. A statement counts if its user counts at it (a proposal and a vote: always, for a voter); its key was the user's where the statement was signed (added by statements that count, up to its creation, which gives its first keys whether or not it counts as a vouch; for a user the root change holds, by the root's creation that remains there, the roots' creations ordered first, by the roots' nodes alone; or given by a decision); it is within every cut set for that key (by a `retire` that counts, or a decision); a node committed it, within that node's cut if it has one; and it isn't past its limit (Users), by the limit that holds. A `retire`, a stop and an `unvouch` are never outside a cut they set themselves, nor left out with their carrier. A user is **out** where it counts through no `create` or `vouch` any more, or where it gave itself up. It is **gone** once seen out for `gone`, or where a decision freed its name; and gone it stays, whatever is vouched or cut off after. 3. **Users' names.** A creation stands while it counts, isn't released, its user isn't gone, and a rule of the kind `user` lets its signer; a user's claim of its own name stands with it, and on where the creation doesn't. Of what stands for a name: the one that remains (Two claims, as in step 4) has the name, or has it wait while it is out. Of a root's creations giving keys to a user the root change holds, the one that remains gives them (read in step 2, where each statement was signed): while they contest, the user signs nothing new, and what it signed with keys one gave stays. 4. **Names.** A claim stands the same way, where a rule of the policy that holds lets its user: anyone who isn't gone where the rule says `"*"`, a root where it says `"{root}"`, else the user that has the name the rule gives; and a name the voters gave stands as its decision says while the rule says `"{voters}"`. A claim that is late against another, and not the other against it, doesn't stand. For each two claims of a name that stand, one question is asked, the first that fits: * one named by the decision that holds on whose the name is: the other gives way; * both final: neither gives way, and they contest each other; * one final: the other gives way; * one carried over, the other held by the snapshot: the one carried over gives way; * one signed in sight of the other: it gives way if the other stood where it was signed, or is read as never down (Claims); else, where the other didn't stand there only by an unvouch or a cut, the two are asked as neither in sight of the other (the next question); else the other gives way; * neither in sight of the other: each stands, late against the other or not. Those that give way to none remain: one, and its user holds the name, or has it wait while it is out; else the name is contested. A kept name is held by the user that has the user name. 5. **Values.** A value in a namespace counts if its envelope does and its user has the name. A value carried over is left out where its user signed one in the new epoch at that place. Where the document holds several at one place (written at once, or carried over by nodes that held different ones), one that another there replaces, directly or along `prev`, is left out; of the rest, those that count, in Automerge's order. Where the one there doesn't count, the last that does, back along `prev` (read in the document at the dependencies of the change that replaced it). A node keeps the resolved registry as it goes (a statement changes it around its own name), and answers from it: * `GET /registry/users/`: the user that has the name, its keys and nodes, who created it and who vouches for it; or that it is contested, between whom; or out, since where, and how long its names still wait; or gone. Also what is in the open: which root's node keeps it in past an unvouch or a cut by a witness the signer's own nodes didn't make, and, for a user the root change holds, which roots' creations contest its first keys. * `GET /registry/claims//`: the holder, and whether the claim is settled, and final; held "while a release, a cut, or statements past a limit stand" where it was made in sight of a claim that one could bring back, and isn't final; or contested, between whom, with the changes that make each claim late and whose nodes committed them. A user whose nodes showed both orders of two claims is marked, a root too: it lied, or its nodes were apart. * `GET /registry/decisions`: the roots, the voters, the policy and its numbers; what is proposed, with its number, who voted, until when, whose nodes took it up, how many it is short of, and which nodes would refuse it; what is decided, which decision of each matter holds, what hangs, and what this node refuses. * `GET /registry/uncovered/`: what a policy no longer covers of that user's, at the path it had, and how long it still stays. * `GET /store`, as today, with a value that doesn't count marked, and the one that counts in its place. ### Partitions, and coming back Three things are "conflicting data", and are dealt with apart. **Names claimed twice** are no partition: every node holds both claims and finds the same holder, or contested. The users see it and one releases; nobody drops anything. **Two epochs**, after a fork or a decision some refuse, are apart for good: each node is where its operator put it (by word or by bounds), and moves to the other side by being told to (it builds that side's snapshot from the base it holds, and carries over what it holds). The same where two remakes of one epoch were both decided, which takes more than a third of the voters voting for both (Remakes). **A remake past `remakeAge`** splits the honest nodes for a while: those that got the decision within it follow, those past it wait in the epoch. It shows on both sides: those that wait hold the decision and see peers in the new epoch; those that followed see peers in the old one, the decision in their history (`GET /peers`, the dashboard). It heals by the new epoch's carry records, counted as what was seen for long is: a node for one voter, of the voters of the epoch that decided the remake, each record as it stood where it was written (a stop with a cut after it takes nothing back). A node that waits asks a peer in the new epoch for them once, when the two connect (their handshakes name their epochs), and the peer pushes it each one it takes after, as it takes it: nothing is polled. It judges them against the snapshot it builds from the base it holds. Read so, alike by every node, they only grow: * Once they count for more than a third of the voters, every node that waits follows: a node of an honest voter took it up in time, and the malicious alone count for less. A node whose operator refused the remake, by hand or by sending it back, doesn't: the heal moves only those that wait by `remakeAge`. * While they count for no more, the split stays, shown on both sides. A node that followed goes back only by its operator's word (`POST /admin/epochs/back`), as to any older epoch, and that refuses the remake: it drops the new epoch, as a node comes back from changes the others refuse (below), what its users signed there goes to the quarantine, to be signed again in the epoch it is back in, and the heal doesn't move it again. Meanwhile neither epoch decides what takes nodes of more than two thirds of the voters: each side's proposals wait, and a node moves on by word (`POST /admin/epochs/follow`, or back). The malicious choose when a split starts, by when they show the last record, and when the count crosses, by when they write their own carry records; not that the honest go back and forth, nor whether they follow, which takes nodes of honest voters. An epoch the honest nodes stay in, its voters' remake votes spent, moves on by word, not by votes. **Changes one side refuses** are a partition nobody chose. A node is cut off from the others when it holds a change they refuse, as everything it writes after builds on it. That happens by three things, and each shows: * **Its own node broke a rule**, by a bug or on purpose. The others refuse the change and, its signature proving it its own, the node as a whole: `GET /peers` (`refused`, with the change and why), the dashboard, `sync.refusedPeers` *(docs)*. * **The two sides judge differently**: versions that differ, a bug in a rule. Each refuses what the other takes; a node told so judges what it holds again and logs that the policies disagree *(docs)*. Where they only resolve differently, their stamps show it (Continuum changing under a swarm). * **An actor forked.** A node committed two changes under one actor and number and gave each to some. Automerge holds one change per actor and number, so a node holding one can't take the other, nor anything built on it *(checked upstream)*. Both carry the same node's signature: a node offered the second holds proof, shows it, and refuses the forking node from then on. (Today it refuses the second as forged, by whoever brought it *(checked: `document::signatures`)*.) Coming back is the side's own choice, never forced: an operator has the node **drop** what the others refuse (`POST /admin/refused/drop`, naming the peer whose word it takes). The node's document becomes what it would be without those changes and what was built on them, as a drop does today *(checked: `AppState::drop_taken`)*. The envelopes among them go to the quarantine and are written again as they are: an envelope doesn't name the change that carried it, so it is as valid in a new one that has in its history what its signer saw. Those that no longer fit stay there for the user to sign again: one replacing a value that is gone, or naming a change that was dropped. Which side drops, for a fork of an actor? No rule can say: the forking node may have ground the hash of the change it kept back, and a rule by hash would let it make everyone drop a year's work. A node shows which of the two the roots' nodes hold, and the operator follows them or doesn't. A node that just joined and got the lone change from the forking node drops and loses nothing. A side that doesn't want to come back stays as it is: the same swarm ID, another history. ### Reaching the others A node's neighbours come from the member list: a ring by key hash, and the pairs with the lowest scores *(checked: `swarm::topology`)*. An adversary choosing its node keys places its nodes around a victim, and then holds back what the victim writes, or what it should receive: a claim that never reaches a root is never settled. Who vouched for whom changes nothing in who connects to whom: a user's nodes needn't reach its creator's. What a federated node has against being surrounded is its operator's: * it keeps as neighbours the other nodes of its user, and its seeds, whatever the member list gives, and leaves out members that name another epoch; * it shows what would tell: a claim of its user that isn't settled long after `witness`, and how old the last change of the roots' nodes is that it holds. Being surrounded costs time, not names: a claim that reached nobody is out of the others' sight, and is contested or late like any such. A member's entry is its node's own, and stays in the document for the epoch. A remake takes along those of the nodes that carry for a user it holds. ### The API, tokens, reading * **Writing** through a node is handing it envelopes: it carries those of the users it carries for, judged before they leave, as today. `scripts/continuum-signed` signs them, votes among them. Whether a node takes proposals and votes from someone who isn't logged in (a page to vote from) is its operator's to say. * **A node's API users** (`--htpasswd`, a proxy's header) are its party's: they read, and use the node's admin endpoints. The registry gives nobody anything on another party's node: a name of the node's own is the node's, whoever has that name in the registry. * **Whom a node lets in**, and what it lets them do, is its operator's. Having keys in the registry gives a user nothing on anyone's node by itself. (Today a user with keys in the registry logs in on any node *(docs)*.) What a user may write is in its signature, whatever node it reaches. * **Tokens** are taken only from the node itself and from the nodes its operator names (`--token-nodes`, their node IDs): its party's others. (Today every node takes a token any member signed *(docs)*: a party's node could let itself in anywhere.) Ended sessions are each node's, as in a swarm without a registry. * **Reading**: every party reads everything. The registry holds public keys, names and addresses, nothing secret; a value only some should read is sealed for them, as today. * **What an operator says**, on its own node and nowhere else, each shown where the node waits on it (`GET /admin/epochs`, the dashboard): * `POST /admin/epochs/rejoin`, naming an epoch's ID: go there, where no peer keeps the epochs between (Coming back after remakes). * `POST /admin/epochs/choose`, naming an epoch's ID: which, where two remakes of the epoch it left are both decided, or its walk through the archives ends elsewhere than its peers are. * `POST /admin/epochs/follow`, naming a decided remake's proposal: follow it now, for a node that waits past `remakeAge` (Partitions). * `POST /admin/epochs/back`, naming the epoch: go back to it, refusing the remake that left it; what its users signed since goes to the quarantine (Partitions). * `POST /admin/fork`, naming a fork's proposal and its base (Going apart). * `POST /admin/decisions/refuse`, naming a proposal; `GET` and `PUT /admin/bounds` (Refusing a decision). * `POST /admin/refused/drop`, naming the peer whose word it takes (Partitions). * `POST /admin/check/accept`: write again after a check of itself that differed (Continuum changing under a swarm). * `POST /admin/put-off/take`, naming a user: take what was put off for the writers past its limit (Users). * **Who may connect** is outside this design. Today it is the swarm key, a secret all nodes share: it keeps those who aren't parties from connecting and reading, as far as every party keeps it, and is no boundary between the parties. Nothing here rests on it. ## Why it holds **Promise 1**, by how a change is judged: every node judges a change before applying it, at its dependencies, and refuses it with everything built on it *(checked: `access::rules::judge_reading`, `access::screen`)*. The rules above read the document at the change's dependencies alone. **Promise 2.** Whether a change is valid depends on the change and its history; its hash covers both. So honest nodes agree on every change, hold the same valid changes once each has what the other has, and Automerge gives the same document for the same changes. Resolving is a function of the changes. Everything it reads is fixed by hashes: a statement's place is what it says it saw, a witness's word is its change's history, and a proposal is decided by its records' histories. A node's clock, and the order things reached it in, enter only into what its own node writes (its stamps, taking a proposal up, the base it takes), never into what it reads from the document. What must hold for this, and doesn't everywhere today: * the root change given, never learned; * no window without a policy (it is in the genesis change), and no syncing under a policy the node doesn't know; * a batch judged at heads that differ from a change's dependencies only where nothing the rules read changed in between: what screening takes as read by rules *(checked: `screen::relevant` lists members, users, remakes, votes, access and node bans)* must have the registers of users and claims, the decisions and what is uncovered; * nothing a node keeps a bounded number of decides validity: a change pushed out of the waiting ones comes again *(checked: `MAX_WAITING`)*; * a change being what Automerge itself writes. Automerge 0.12 applies some that aren't, and then holds another change than the one it was given: under the hash received it gives back a change with another hash, and its save doesn't load *(measured upstream)*. Screening refuses those before Automerge sees them; * a register made by two changes at once holding what both put there. Two claims of a name nobody claimed yet each make its register, and after a remake every node makes the same registers; reads show maps made at one key as one *(docs)*, and judging and resolving must read them so; * one change per actor and number. A forked actor breaks "hold the same changes" until one side drops. Automerge names a change by actor and number where Kleppmann's construction needs the hash. **Promise 3.** A value counts only with an envelope whose signature checks against a key that step 2 gives its user for the change that carries it. A key is a user's only by statements signed with keys above it, up to its creation, signed by its creator, and so on up to a root, in the root every node was given; or by a decision, which is promise 7's. A node that carries doesn't sign in the user's place: the envelope names its swarm, epoch, path, user and user ID *(checked for swarm, path and user: `access::envelope::check`)*, so it counts nowhere else and for nobody else. A name is held by a claim so signed, by a rule, or by a decision. Across a remake: every node builds the snapshot from changes it judged, so the snapshot holds only what counted, and what is carried over is signed as it was. **Promise 4.** Steps 3 and 4 name a holder only where exactly one claim remains. **Promise 5.** Let c be a claim that stands, and w a change that a root's node committed with c in its history, standing there, and no other claim of the name standing there (c is settled). Let c' be any other claim of that name. In the history of w it is missing, or doesn't stand. The roots' nodes are on every side, so w is a change by the side of c' that saw c hold the name while c' didn't: c' is late against c in every set of changes that holds w. A late claim never holds a name while the other stands, and c stands until it is released, its user is gone, or a decision deals with it. So nobody takes the name by another claim, whenever it surfaces, whatever it says it saw, and whatever brings it to count. What is left to an adversary while c isn't final, each in the open: * making c late too, so that none remains. That takes a change by a node of c's user or of a root with c' standing in its history and c not. An honest node that received c first never commits one: everything it commits after has c in its history. So it takes such a node that lies, or that truly received c' first. If it also committed changes with c and not c', both orders are in the document under its user's name, and the registry says so; * taking w away: the root stops its node with a cut from before w. Then c is as it was before that root saw it, and settled only if another root's node saw it too; * bringing back a claim c was made after: its release, or the cut that left it out, is cut off. Final ends all three. c has been seen holding the name for `final`: a third of the voters each have a node with two stamps that far apart, at which and between which the registry as that node held it gave the name to c. One of them is honest: its clock went that far, and all that while nothing it held took the name from c. From then on step 4 has every other claim give way to c. What is left then: a claim that became final the same way out of c's sight, which takes honest voters' nodes kept apart from c for that long, and leaves the name contested; the voters (7); and c's own key cut off from before c, which is its user's doing or the voters'. Before a root saw c: a claim c' out of its sight isn't late unless its own side shows otherwise, so the two contest each other, or, where a root's node got c' first, c' is settled and c late. That is first come, first served as far as anyone can witness it. What the assumptions are: signatures and hashes hold; an honest node's changes build on all it has received (Automerge does that); for settled, the changes the roots' nodes commit count and the roots don't turn; for final, fewer than a third of the voters are malicious, and the honest ones' nodes keep time. **Promise 6.** No rule for what users write reads a vote or waits for another party; a write is refused only by what its own history holds, and counts from the start. **Promise 7.** Let V be the epoch's voters, n of them, fewer than a third malicious. * *None that honest voters didn't vote for.* A record is valid only with votes for its proposal in its history by more than 2n/3 of V, none released there: more than n/3 of them honest voters'. (A remake's record needs none: a remake is decided only with votes for it, naming its base, by more than 2n/3 of V beside its records.) And a proposal is decided only with records that count for more than 2n/3 of V, for more than n/3 of them written by honest nodes, each while it held that many votes, running by its clock. * *Not from the past.* So votes crafted later, or kept back until they ran out, bring no honest node to take anything up, and the nodes of fewer than a third decide nothing. * *The same one everywhere.* Whether a proposal is decided is read from its records and their histories; which decision of a matter holds, from the proposals' numbers, which follow from what each says its signer saw, and their digests. No node's clock enters, nor who committed a proposal, nor how often. * *Two of one matter.* A voter has one vote on a matter at a time. So two proposals of one matter are both decided only where more than a third of V voted for both: voters who changed their minds, or malicious ones, who are too few. The higher number holds. More than a third of V have nodes that took both up, honest ones among them, and an honest node takes the higher up after the lower: where voters changed their minds, what holds is what they moved to. A proposal decided late takes nothing from one with a higher number. * *The sides of a partition.* A side decides only with nodes of more than two thirds of V on it. Two sides both do only where more than a third of V have nodes, and votes, on both: then two proposals are decided, and every node acts on the same one once it holds both. * *Seen for long.* What was seen for a length of time has a third of the voters each with two stamps of one node that far apart: one of them honest, whose clock went that far, and which held the thing so all the while. Fewer than a third, stamping as they like, show nothing; and a node counts for one voter. * *A remake changes nothing.* The snapshot is a function of the base, which every node holds and judged itself. An honest voter's node takes up no base that leaves out what it held `baseAge` before, unless records of it count for a third of V, an honest one among them; and it records the ID it built: a remake is decided for one ID. Who votes next and who the roots are is in the proposal, for all to see before they vote for it. What a node holds beyond the base it carries over itself, by its carry record, so what any honest node held comes along. And a voter's vote names its base, once an epoch: two bases are both decided only where more than a third of the voters signed for both. * *Nobody is moved.* A node refuses any decision by its operator's word or bounds, and follows a fork by its operator's word alone; going back refuses the remake. A node that waits by `remakeAge` follows once the new epoch's carry records count for more than a third of V, a node for one voter, as each stood where written: one at least an honest voter's node that took the remake up in time. Fewer than a third, writing records as they like, move nobody, and nobody goes back but by its operator's word: so every honest node that waits ends where the honest that followed are, once they are enough. * *With other fractions.* Write d for `fractions.decide` and s for `fractions.seen`. A decision no honest voter voted for takes d of the voters malicious. Two proposals of one matter both decided, with nobody changing their mind, take more than 2d − 1 of them voting both ways, which at a half or less is nobody; the same for two sides of a partition. What was seen for long holds against fewer than s of the voters. **Unvouching** takes away no more than its signer could have kept from seeing: what the unvouched user signed stays if a node of the unvoucher or of a root committed a change that has it in its history and not the unvouch. Those changes are taken back only with their node's witness, where the node is stopped with a cut from before them: an unvoucher that stops its own nodes so undoes what they had seen, never what a root's node had. So the point moves forward as more of them show up, and back only as far as the roots' nodes' witness. ## Roads not taken * **Agreement among the parties for every write** (PBFT and the like) would give one order of claims, final at once. It needs a fixed set of voters of which fewer than a third fail, halts the smaller side of a partition, and makes every claim wait for a round. It works against what continuum is for: no node special, each working on its own, both sides of a partition going on. Here only decisions take it, a few a year. * **A registrar**: every claim signed by a root before it counts. That is the roots' witnessing made a condition: one order, but nothing counts while they are away, and they decide alone. Here the same witness only orders what already counts, and time makes it final without them. * **Deciding by a hash or a timestamp** of the claims: whoever crafts later chooses the lower hash and the earlier time. * **Deciding by seniority** (the user nearer a root holds the name): always a holder, but a senior user that kept silent takes a junior's name by backdating, and a root that lies takes any. Contested, with `release` to give a name up, fails safer: a name is blocked in the open, not taken. * **The users above a user as witnesses of its claims** (those on its lines, down from a root): they would witness while the roots are away. But whoever is above a user would have a say about its names, a vouch would have to be accepted before it gave one, and in a registry whose users the roots create nobody is above anyone. The roots witness, and time makes final. * **One root.** One user's nodes would settle every claim, nothing would be settled while it is away, and it alone would stand between a claim and whoever backdates. Several roots cost a contest where two of them saw two claims in two orders. * **A root seated by a decision, within the epoch**: what the root before it settled, and whom it created, would change its standing after the fact, between the proposal and the decision. The roots are an epoch's, named with its voters. * **Votes by nodes**: a party runs as many nodes as it likes. * **Voters by a rule** (the users a root itself created, whom nobody else can multiply): who takes part and who doesn't is known to people, not to a rule. So those who vote say who votes next. * **Leaving out the voters that are away** (one whose nodes were silent for a time neither votes nor counts): those who stay could go on deciding whoever left. But silence is shown by stamps, and whoever stamps together shows the rest silent: a majority would decide at once what is to take two thirds, and a proposal crafted to look old would choose who counts. Every voter counts; a remake names those who take part, and where a third are gone before one, those left go apart. * **Recommending a majority, not two thirds**: a third that votes both ways must not get two proposals of one matter decided, to choose between them. Two thirds stand that against fewer than a third; a majority stands it against nobody. * **One decision a matter, each node taking up the first it sees and no other**: two would never both be decided. But two made at once split the nodes between them, neither is, and the matter stands still until the next epoch. Letting both be decided, and the higher number hold, never stops. * **A proposal that lapses** (taken up no more, and its records void, once its votes ran out): nothing would hang. But "once" is a time, and a record made to look as if written in time can't be told from one that was. Nodes going up in numbers only, and a later decision, end what hangs without a clock. * **A node holding back a decision that comes late**, by its own clock, for its operator to say: two nodes with the same changes would act on different decisions, and one that joined later would never ask. * **A decision counted where its proposal was made** (who votes, the numbers, a name given, all as they were there): a proposal's place is its signer's to choose. It is counted where it is decided, and the registry by what holds. * **A clock of the swarm** (the latest time a third of the voters have stamped) for how long something lasted: it sets one node's clock against another's. Two stamps of one node measure a length of time by one clock, and the document says what that node had seen at each. * **A policy that changes only by going apart**, each operator saying yes: nobody would be bound, and a swarm would split at every change. A decision binds those who don't refuse it. * **Unvouching by anyone above**: a user in between could put out one further down without taking along all below. But a root is above everyone, and would put out whom it liked, for good. * **Neighbours by who vouched for whom** (a node keeping its creator's nodes): a claim would reach a root whatever the member list gives, and a user would have to reach whoever brought it in. * **Rules that know what a name is** (an address's parts as numbers, two spellings of one address): continuum would have to know every kind. The structure of a name and the characters it is made of are the same for all of them; what it means is the application's. * **Numbers the design fixes**, the fractions above all: they would keep a swarm's voters from deciding badly by rules none of them chose. Every number is the swarm's; whoever won't bear a decision refuses it, and goes on with those who think alike. * **Users voting as soon as they are created**: whoever creates users carries every decision. * **Voters let in by a decision, without a remake**: nobody fills the votes, and nobody waits for a remake. But the voters of before make a decision "of then" later (the first root alone, for the time it was the only one). A remake is what puts that out of reach. * **A snapshot of only what its users' own nodes write again**: every node carries over what it holds, whoever signed it. Else what a root's node saw first after the base would be nowhere in the next epoch, and whoever wrote first there would have come first. * **An unvouch undoing everything its user ever signed**: nothing to backdate, but it takes back the user's releases, and no vouch brings the user back as it was. **Or only what the user signs in sight of it**: the user goes on by never building on it. **Or from where each node received it**: that is in no document, so two nodes would resolve the same changes differently. * **A user that was gone coming back by a vouch made in time**, out of the sight of those who saw it gone: a vouch crafted to look old then blocks any name claimed in good faith since. * **A claim that didn't count coming back over one made in sight of it** (its user vouched for again, its limit raised): whoever claimed a name that showed free would lose it to a claim it had seen and rightly passed over. * **First keys given by those who vouch for the user**: fewer to convince, but a user's creator takes its name where nobody else vouched. * **A registry of only what is signed**, from the start: nothing unsigned ever counts, but it is incomplete for as long as users take to come, and what reads it needs the repository beside it meanwhile. * **An actor for every change, made from the change** (the hash of its bytes with the actor left out, 32 bytes, number 1): two changes could never share an actor and a number, so a fork of an actor would be two changes that every node holds, shown and parting nobody. It is what Kleppmann's construction asks for, and a receiver checks it with one hash. But Automerge 0.12 keeps a slot per actor in every clock it caches, and moves its indices for every actor that comes, so memory and time grow with the square of the changes: 10^4 changes take 32 to 257 MB of heap and 2 to 20 ms to apply one more, 10^5 take 2.7 GB at least and 0.16 s *(measured upstream)*. A hundred nodes stamping daily write 10^4 changes in a hundred days. So a fork of an actor is proven and named, and not prevented, for as long as Automerge's clocks grow with its actors. * **An epoch's remakes numbered like any matter**, the highest number holding: a remake that hangs would be ended by deciding another. But the one that hangs can be the higher, and be decided after the swarm switched to the other: then it undoes the epoch the swarm is in, on a day one voter chooses. A voter's one vote an epoch for a remake, never released, leaves nothing to undo; what it costs instead is said under what is not promised. * **One base a node and epoch**, the first it takes up. Alone, a voter is counted through any node of its, and a coordinator handing two bases to two nodes of each voter has both decided. Beside the votes, it strands voters: two remakes proposed at once, or a base handed first to nodes back from away, split the nodes, and a voter whose nodes took up one base votes for no other, so the epoch's remakes end with nobody malicious. The voter's own vote names the base, and a node takes up every base that passes. **Nor a base refused for good by nodes that saw it late**: an ordinary partition at the base would end the epoch's remakes. A base a third took up every node takes up, however old. * **Saying what was held by the order of a node's first changes** after a remake: an order says one thing, and what a node held of a claim, an unvouch and a value are three. The node states them. * **Every node writing again all it holds** after a remake, before taking anything: each envelope since the base would come once for every node that held it, a month's statements times the nodes after a remake decided late. The nodes witness by digest, and the envelopes come once. * **An envelope of the epoch before taken from anyone, all the next epoch**: what a user signed and never sent, whoever got it could hand in, with a number of its choosing, and a value long replaced could come back over what the user wrote since. Only what a carry record names comes (which a node holding it can still see to), its numbers order only what is carried over, and a value of the new epoch has the last word. * **The epoch for those who refuse built wherever a proposal says it was signed**: its signer would choose what refusing costs, up to a whole epoch carried over. Nobody takes up a proposal that says it saw less than its node held a window before. * **A late claim standing in wait** for the name: whoever signed, in time, a claim that says it saw nothing would have the name the moment its holder lets go. * **A limit on writers as a rule**: a change starting one writer too many would be refused, and an honest user whose nodes crash too often would write nothing until a remake. Put off by each node, nothing valid is refused, and what is bounded is how fast. * **Any node's record counting for a voter that is out**: one node, holding old votes, would decide for all of them. Its own nodes record, and commit nothing else. * **A document per user**, each written by one party, a claim counted across them (as in Secure Scuttlebutt's feeds). A fork of an actor then spoils only the forker's own document, not the swarm, which is the one thing this design can't give. It needs what continuum doesn't have: many documents, and what one had seen of the others recorded by hand. One Automerge document records that by itself. ## What members are trusted with, then [`trust.md`](trust.md) lists what a member can do today. In a federated swarm: | Today | Then | |---|---| | Write or delete any user data | Only envelopes, of users it carries for; nothing plain, nothing deleted from a register | | Write as any user | An envelope needs the user's key | | Edit the member and user registries | Its own member entry, of a shape and a size; users come and go by statements, which only add | | Forge votes, commit a remake alone | Votes are users', signed; a decision takes two thirds of the voters, and every node judges the records; every node builds the snapshot itself | | Make the swarm forget peers | A forget record of another's node is refused; whom a node talks to is its own | | Advertise an epoch a rejoining node follows | A node follows a remake it sees decided, or an epoch its operator gave it | | Be a joining node's first sync | Judged from the root change on, by the policy in it | | Say it is ready, be a catch-up source | Still believed: it can hold changes back, not add any. A joiner syncs with the others after | | Sign a token every node takes | Taken by the nodes whose operators named it | | Let any user of the registry log in | The users it carries for, and those its operator names | | Say whom it reaches, how stable it is | Still believed: it bends who syncs with whom; a node keeps its seeds and its user's other nodes whatever | | Say when it was alive, and how often all should | Believed for itself only; it takes a third of the voters to show a user out, or a claim holding, for long. How often is the policy's | "Member" stays the word for a node in the swarm; the unit that is trusted or not is the party. ## Continuum, or the application In continuum, as rules every node judges by and data that parametrizes them: users by statements (creating, vouching and unvouching, lines, keys, cuts, nodes that carry), the namespace rule, claims by kind with their rules and limits, late, contested, settled and final, lengths of time read from the stamps, decisions by the voters (the numbers, the policy, a user's first keys, names), remakes that every node builds and that name the voters and the roots, going apart and refusing a decision, resolving and its API, the drop an operator asks for. All of it is general: a swarm with other kinds, or none, uses the same. In the application, for the registry: which kinds there are and their rules (data in the genesis change), what a host's entry holds, the client that signs (an extension of `scripts/continuum-signed`), moving the repository in, and writing out the files the consumers read. Whether a host's entry may use a name is the application's check against the resolved registry, when it writes the files out. So are a node kept as an archive of every epoch, and whatever brings a vote from a person to a node. More policies later are more data where a rule has a parameter, and a new rule in continuum, with a policy of its own, where it hasn't; either way a decision. What changes in continuum besides the rules, under the federated policy only: policy version 2; the envelope's payload names the user ID, the epoch, and for a statement what its signer saw; a node is given its root change, syncs under no policy it doesn't know, takes tokens and logins by key as its operator says, writes no sessions into the document, keeps its writer over a clean stop, stamps as often as the policy says, keeps its seeds and its user's other nodes as neighbours, keeps the document of an epoch it left on disk and answers for it, keeps when it received each change (for `baseAge` and `window`, over a restart), keeps a quarantine on disk that holds envelopes, commits its carry record after a remake and writes again what the epoch lacks, takes no remake but one its voters decided, rejoins no epoch because peers advertise it, and refuses what its bounds say. For every swarm: the wire's version, with a handshake that says which epochs its node keeps, and a node that speaks the wire version before its own too. [`trust.md`](trust.md), [`access.md`](access.md), [`remakes.md`](remakes.md) and the glossary get the federated case: party, statement, in sight of, line, root, the seats', voter, claim, cut, late, giving way, contested, settled, final, out, gone, uncovered, seen for, taking a proposal up, a decision that holds, what hangs, carried over, a carry record, a party (for a budget), refusing a decision, bounds, the numbers. ## Continuum changing under a swarm Parties upgrade when they like, so a federated swarm always runs several versions of continuum. Given the same changes they must agree on three things: which are valid, what the registry is, and, byte for byte, the snapshot a remake builds. Whether two versions do can't be told by looking at them, and a version's number says what its author remembered to say. So the design goes by what nodes compute: * **Every stamp says what its node computes.** With its alive stamp a node records the digest of the registry as it resolves at that change's dependencies: what a snapshot would hold there, less the members' entries and what a remake's proposal names. A node that holds those changes resolves there and compares: as it goes where it holds exactly those, else for the latest stamp of each other party once in a while. Two digests for the same changes prove that two nodes resolve differently, signed by both, at the first input where they do: it shows (`GET /peers`, the dashboard) long before a remake would have sent them to two epochs. * **A remake is taken up by its result.** A voter's node builds the snapshot from the base before it takes the remake up, and records the ID of the epoch it got. The remake is decided for the ID that the nodes of two thirds of the voters got. A node that got another stays where it is, and says so. * **A node checks itself before it writes.** Started with a version it didn't run before, a node judges and resolves again what it holds *(docs: a node told that policies disagree does so today)*, and compares with the stamps it holds of the voters' nodes. Where it differs from the nodes of more than two thirds of the other voters (`fractions.decide`; a voter counted once, however many nodes it has), it writes nothing, and shows it, until its operator says to go on (`POST /admin/check/accept`). Where it differs from fewer it shows that and goes on. So fewer than a third stamping nonsense stop nobody, with three voters too, and a version that computes otherwise than the honest ones stops. * **A change of the rules is a change of policy.** What a version judges or resolves differently on purpose, it does under a policy of its own (a part of the policy that versions before don't know), which the swarm decides. A change is judged by the policy decided in its history, so a version judges what was written before as it was judged then, and carries the rules of every policy that held in an epoch it can still walk. A node knows a policy if it knows everything in it: it goes by what the policy holds, not by its number, and takes up none that has a part it doesn't know. * **Vectors.** Continuum carries recorded inputs with what must come of them: changes and whether they are valid, sets of changes and the snapshot they resolve to. Each test named under Attacks leaves some. A release adds vectors and changes none, and every version passes all of them: a rule changed without a policy fails there, before it is released. What can't change under a swarm, whatever is decided: how an envelope is read and what its signature covers (a snapshot carries envelopes as they were signed, from epoch to epoch); a statement's digest; a change's hash, and what Automerge makes of the same changes; the bytes Automerge encodes a change to (screening refuses a change whose bytes its own Automerge wouldn't write); a snapshot's bytes for the same base and policy. A new form of any of them comes beside the old one, under a policy. What changes freely: everything a node does for itself. Its API, its storage, how it syncs and with whom. The wire is between two nodes, not the swarm's: a version speaks its own and the one before, so that parties upgrade one after another. That is new for every swarm *(checked: a message of another wire version is ignored whole today, `transport::wire`)*, and comes before a federated swarm is used. And a fork it is when nodes that hold the same changes don't come to the same, and neither gives way. It shows by a change one takes and the other refuses, by two digests for the same changes, or by two IDs for one base: by what was computed, never by a number. Which of the two is the swarm's no rule says. The parties see how many of them say which, and upgrade, drop, or go apart. ## Attacks Each with what honest nodes do, the promise it touches, and what shows it: `unit` in the module named (`access::statements`, `access::claims`, `access::resolve`, `access::decisions` are new), `sim` a simulation in `src/simtest/federation.rs`, `argued` where no test can. Each test leaves vectors (Continuum changing under a swarm). Statements and users: | # | The adversary | Honest nodes | Promise | Shown by | |---|---|---|---|---| | 1 | Signs a statement with a key that isn't the user's | Refuse | 3 | unit, statements: `a_statement_needs_its_users_key` | | 2 | Puts another user's statement into a change of its own node | Refuse, its node not carrying for the signer; but for what a decision is made of, what is carried over a remake, and a `node` statement, which the node it names commits | 3 | unit: `only_a_users_node_carries_it` | | 3 | Replaces or deletes a statement, or what holds the register | Refuse | 2, 3 | unit: `a_register_only_grows` | | 4 | Offers a statement again; or an envelope signed for another swarm, epoch, path or user ID | Nothing where it is there under its digest; refuse elsewhere | 3 | unit, exists for swarm and path: `what_an_envelope_must_be`; `signed_for_its_user_id_and_epoch` | | 5 | Commits a statement a second time, in a change with other dependencies, to move it | A statement is where it says its signer was (`seen`), whoever carries it and how often: nothing moves | 2 | unit: `a_statement_carried_twice` | | 6 | Creates a user listing a victim's public key beside its own | The victim's envelopes name the victim's ID: they count for no other | 3 | unit: `a_key_in_two_creations` | | 7 | A second root signs a `create`, with keys of its own, for a user the root change holds, saying it saw nothing of the first | Refuse where the user has keys. Out of sight the two are ordered as claims are: each root's node saw its own first, so the two contest and neither gives keys, until the voters give first keys | 3 | unit: `first_keys_by_claim_order` | | 8 | A root releases the `create` that gave a moved-in user its first keys, after the user signed with them, and gives it keys of its own | Refuse: no root releases its `create` for such a user; once one gives keys, they are the user's. Two roots' creates contest until the voters give first keys | 3, 5 | unit: `a_root_keeps_to_its_create` | | 9 | A root makes its own `create` for a moved-in user contested by a twin on old dependencies, or signs a release on old dependencies once it is final, then gives the user keys of its own | Refuse: no root releases its `create`. The twin contests, in the open, until the voters give first keys; what the user signed with its keys stays | 3, 5 | unit: `a_root_keeps_to_its_create` | | 10 | A root's twin `create` for a moved-in user, on old dependencies, to have everything the user signed with its first keys stop counting | A moved-in user's keys are read where each statement was signed, the roots' creations ordered first by the roots' nodes alone: the twin freezes the user until the voters say, and takes nothing back | 3, 5 | unit: `first_keys_are_read_where_signed` | | 11 | Users vouch for each other in a ring away from the roots; a user vouches for its creator | None is vouched for by it | 3 | unit, resolve: `no_line_no_user` | | 12 | Creates a name in sight of its creation | Refuse | 4 | unit: `a_name_created_once` | | 13 | Commits a user's claim on old dependencies, or holds it back, as a node of another party the user claimed through | Who commits a statement says nothing of it: what its signer saw is in its signature, and a claim committed late is late. A user's own claims of one name are one, from whatever node | 4 | unit: `a_claim_through_any_node` | | 14 | Creates a user of a name another user holds by its claim of its own name; or signs that claim again and again, each kept by every node | Refuse: a creation of a name where a user's claim of its own name stands, as a claim is refused; a user has one such claim at a time | 4 | unit: `a_users_own_name_claimed_once` | | 15 | Creates a name another has, saying it saw nothing of it | Hold both; late once a root saw the first. Before: contested, or the first is late where a root's node got the other first | 4, 5 | unit: `a_backdated_creation_is_late` | | 16 | Gets a user's name contested to free its names | Its claims stand without the name | 5 | unit: `claims_stand_without_the_name` | | 17 | Creates many users, each claiming many names (sybils); creates them out of each other's sight to pass the limit | Refuse past the limits in sight; out of sight, those past them don't count. A limit bounds how many each user brings in itself, not how many come in below it: each shows below its creator, for all to see, and goes with it when it is unvouched | 6 | unit: `limits_on_creating`, `past_a_limit_out_of_sight` | | 18 | Adds keys, nodes or statements without end; signs and gives up without end (vouch and unvouch, claim and release, key and retire) | Refuse past the limits. What is given up counts toward none: it is taken no faster than a budget per party (row of the budget, stage 8), and a remake leaves it out | 6 | unit: `limits_on_a_register` | | 19 | Signs more than its limit out of each other's sight; another claims a name that so doesn't count; then gives the earlier ones up | What comes to count later than it was signed gives way to what was claimed in sight of it meanwhile | 5 | unit: `counting_late_gives_way` | | 20 | With a stolen key, signs statements that come before its user's own (keys, creations, claims), to push those past their limits; an accomplice claims the names that so show free | Until the key is cut off they do. What a cut leaves out comes before nothing: the user's own count again, and a claim of theirs that a root's node had seen hold is read as never down, so the accomplice's gives way | 3, 5 | unit: `cut_off_comes_before_nothing`, `down_by_a_limit_comes_back` | | 21 | Names another party's node as one that carries for it; offers that node a token of its own | A node carries only once it committed the statement naming it; an honest node takes tokens only from nodes its operator named | 3 | unit: `a_node_carries_by_its_own_word`, `a_token_of_ones_party` | Unvouching: | # | The adversary | Honest nodes | Promise | Shown by | |---|---|---|---|---| | 22 | Unvouches a user it didn't vouch for; a root unvouches the users the root change holds, or those a root before it created | Refuse the first. What is the seats' is taken back once every root unvouched it: one root puts nobody out, where there are several | 3 | unit: `only_the_voucher_unvouches`, `the_seats_take_back_together` | | 23 | The roots unvouch the voters, and wait for them to be gone, to keep them from deciding | A voter votes for its epoch, in, out or gone, and the nodes of one that is out go on committing their records and nothing else: who votes is the remake's word, not its vouchers' | 7 | unit: `a_voter_votes_for_its_epoch`, `an_out_voters_node_records` | | 24 | Unvouches saying it saw little, to undo what the user did since | What its own nodes or a root's had seen of the user stays | as said under Unvouching | unit: `an_unvouch_undoes_nothing_seen` | | 25 | The unvouched user signs on, saying it saw nothing of the unvouch, or across a partition | Hold it as part of another's history only; it doesn't count; after healing every node finds the same | 2, 3 | unit: `past_an_unvouch`; sim: `an_unvouch_across_a_partition` | | 26 | A user is unvouched: what of those it brought in, and its names? | One that another vouched for stays in, without doing anything. The others are out from the same point; a vouch after brings them back whole. Their names wait | 4 | unit: `a_second_line_keeps_it`, `those_it_brought_in`, `a_vouch_brings_back` | | 27 | An unvouched user's nodes keep sending | Refused as peers; nothing taken from them | 6 | sim: `nothing_from_an_unvouched_node` | | 28 | Claims a name of a user that is out, or creates its user name | Refuse: the names wait until the user is gone, or a decision frees them or gives them away | 5 | unit: `names_wait_while_out` | | 29 | Has a user unvouched, then stamps its nodes `gone` apart at once, to free the names; carries for many voters to be many | Gone takes a third of the voters, each with a node, and a node counts for one | 5 | unit: `gone_by_a_third_of_the_voters`, `a_node_is_seen_for_one_voter` | | 30 | Shows a stamp later that lies, by its time, between two that counted, with the thing not so there | Between goes by the stamps' histories, not their times: it lies between nothing, and gone, final and dropped stay | 5 | unit: `between_two_stamps` | | 31 | Vouches for a gone user saying it saw nothing of that, over a name claimed since | Gone stays: no vouch brings it back | 4 | unit: `gone_stays_gone` | | 32 | Out, signs a claim that doesn't count; another claims the name in sight of it; a vouch brings the user back | It is back with what it signed, but the claim made in sight of one that didn't count doesn't give way to it; nor does a settled one that never saw it | 5 | unit: `back_but_not_over_a_later_claim` | Namespaces: | # | The adversary | Honest nodes | Promise | Shown by | |---|---|---|---|---| | 33 | Writes into another's namespace, signed by itself | Refuse, and the node as a whole | 3 | unit: `a_namespace_is_its_users`; sim, as `a_member_writing_against_the_rules` today | | 34 | Writes plain values, or protocol data but its own member entry | Refuse | 3 | unit: `nothing_plain` | | 35 | Puts an old envelope back | Refuse: it doesn't replace what is there | 3 | unit, exists: `what_an_envelope_must_be` | | 36 | A user with a late creation of a name writes in the namespace | Refuse where its change's history shows it lost the name; else hold it and leave it out | 3 | unit: `a_user_that_lost_its_name` | Claims: | # | The adversary | Honest nodes | Promise | Shown by | |---|---|---|---|---| | 37 | Claims a held name in sight of the claim | Refuse | 4 | unit, claims: `first_come_first_served` | | 38 | Claims a settled name saying it saw nothing of the claim, long after | Hold both; it is late, the holder holds | 5 | unit: `a_backdated_claim_is_late`; sim: `a_backdated_claim_loses` | | 39 | Two honest users claim on two sides of a partition | Hold both; every node finds the same: one holder, or contested; a release leaves one | 2, 4 | sim: `a_partition_heals_to_one_answer`; unit: `a_release_ends_a_contest` | | 40 | Claims `x.tv.r` as another; claims a top-level domain as another than a root; claims `wiki.r`, which the rules leave to the voters | Refuse: the kind's rule. A kept name needs no claim; a claim by a user that doesn't have the name its rule gives doesn't count | 4 | unit: `a_kinds_rules`, `a_kept_name`, `a_rule_goes_by_who_has_the_name` | | 41 | Claims past its limit, in sight or out of sight of its other claims | Refuse in sight; out of sight, those past the limit don't count | 4, 6 | unit: `a_limit_in_sight`, `past_a_limit_out_of_sight` | | 42 | Claims `TV.r` beside `tv.r`, or `10.243.foo.bar`; claims one address in two spellings | Refuse what has characters the kind doesn't name. Else a name is compared as written: the application claims one spelling and reads no other | 4 | unit: `a_kinds_characters`; argued (Claims) | | 43 | A root says it saw a rival first, after the claim is settled | The name is contested; the registry names the changes and the root, and marks it if it showed both orders. Once the claim is final: nothing | not promised; 5 once final | unit: `a_root_contests`; sim: `both_orders_show` | | 44 | Hands an honest node of a root or of the claimant, back from a day off, a rival before the claim | A node that comes back catches up with the peers it keeps before it writes. Where it wrote all the same: contested, until one releases or the voters say. Once the claim is final: nothing | not promised; 5 once final | sim: `a_node_handed_the_rival_first` | | 45 | Two claims made at once reach two roots' nodes in two orders | Each is late against the other: contested, and one releases | 4 | unit: `roots_that_saw_two_orders` | | 46 | Keeps silent while no root's node is up, then claims saying it saw nothing | Before the claim is settled: contested, or whichever reaches a root's node first holds. After: late. Final: it gives way | 5 | unit: `silence_before_settling` | | 47 | Releases a claim with a stolen key, an accomplice claims | Once the key is cut off the release doesn't count: the accomplice's claim, made in sight of the first, gives way, unless it is final by then | 3, 4 | unit: `a_release_cut_off` | | 48 | Signs a claim and cuts its key off at once, so that the name shows free; another claims it; then cuts off the key that cut | It comes back over nothing: no root's node saw it hold the name before it was down | 5 | unit: `a_planted_claim_comes_back_over_nothing` | | 49 | Signs claims of held names that say they saw nothing, to have each the moment its holder releases it, is gone, or the voters free it | A claim late against another that isn't late against it is late for good: it doesn't stand, and whoever comes first then has the name | 5 | unit: `late_for_good` | | 50 | A limit is lowered and raised again, or a policy uncovers and covers again; someone claims in between a name that so showed free | The claim made in sight of one that didn't stand keeps the name: the other gives way, though a root's node had seen it first | 5 | unit: `sight_decides_alone` | | 51 | Every root that saw a claim stops its node with a cut from before, and a rival is handed in | A final claim holds. One that isn't is as before the roots saw it: contested, or late | 5 once final; not promised before | unit: `final_against_the_roots` | | 52 | Stamps its nodes `final` apart at once, to make a claim final that doesn't hold, or holds only as it sees it | Final takes a third of the voters, each having held the claim as the holder at both stamps and between | 5 | unit: `final_by_a_third_of_the_voters` | | 53 | Keeps honest voters' nodes apart for longer than `final`, a claim of one name on each side | Both are final: contested, until one releases or the voters say whose it is | not promised | sim: `two_finals` | Keys: | # | The adversary | Honest nodes | Promise | Shown by | |---|---|---|---|---| | 54 | Steals a device key and signs with it | Take it until a key above cuts it off, then leave out what is outside the cut; a value it replaced is read again | 3 | unit: `a_retired_key_counts_within_its_cut`, `the_value_before_counts_again`; sim: `a_stolen_key_cut_off` | | 55 | Signs with a retired key, saying it saw nothing of the retiring | Hold it (valid as written), leave it out | 3 | unit: `backdated_past_a_cut` | | 56 | With a stolen device key, retires the keys above or beside it | Refuse | 3 | unit: `no_key_retires_one_above` | | 57 | With a stolen device key, retires that key from long ago, to undo what its user signed | Refuse: a key retires itself from where it stands | 3 | unit: `a_key_retires_itself_forward` | | 58 | A key retires itself; a retirement is carried by a node that only the retired key named; a node commits its own stop | Each counts: a cut never leaves out its own statement, nor the node that carried it | 2 | unit: `a_cut_never_reaches_itself` | | 59 | With a stolen key, retires the keys below it, stops nodes, unvouches, releases names | A key above cuts it off from before: all of it is taken back, but what became final on it | 3 | unit: `a_cut_takes_back_what_the_key_cut` | | 60 | Is unvouched with a key that is then cut off from before, and claimed names while out | In again, its earlier claims having stood all along; what it claimed while out gives way to what was claimed in sight of it meanwhile. Gone stays gone | 5 | unit: `an_unvouch_cut_off` | | 61 | Creates a user with a stolen key, under a name kept for its victim's creations, and has an accomplice vouch for it | Once the key is cut off, the creation no longer claims the name: the user stays in by the vouch, with its keys and claims, and without a name or a namespace | 3, 4 | unit: `a_creation_cut_off` | | 62 | With a device key, releases the user itself; with a stolen first key, does so before the voters can cut that key off | Refuse the first: it takes a first key. The second puts the user out, its names waiting, and a cut takes it back within `gone` | 3 | unit: `giving_up_takes_a_first_key`, `given_up_is_out_first` | | 63 | Steals a user's first key | The name is the thief's too, until a decision gives the user first keys anew, with a cut for the stolen one | 7 | unit: `first_keys_by_a_decision` | | 64 | Cuts its own key off early to take back a vouch or a release | It is taken back, but for what is final; a vouch as by its signer's unvouch, from where the retirement was signed: without a second vouch the user is out, its names waiting until it is gone or a vouch comes | not promised | unit: `a_second_vouch_stands` | | 65 | A key is retired on one side of a partition while it signs on the other | After healing, every node leaves out the same | 2 | sim: `a_cut_across_a_partition` | | 66 | Steals a node's key: commits changes as a witness | They count until the node is stopped with a cut, then not | 5 | unit: `a_stopped_node_witnesses_nothing` | Decisions and remakes: | # | The adversary | Honest nodes | Promise | Shown by | |---|---|---|---|---| | 67 | Forges a vote; votes as a user that isn't a voter, or one that is gone | Refuse | 7 | unit, decisions: `a_vote_is_a_voters` | | 68 | Brings in many users to vote, also while a remake's votes run | They vote only if a remake's list names them, which those who vote saw | 7 | unit: `who_votes` | | 69 | A remake's list of voters with the many users one user brought in; users put out between the votes and the base, to shrink the list | The voters see the list, by IDs, before they vote for it, and propose one of their own instead. Nothing after the proposal changes it | 7 | unit: `voters_are_the_remakes`, `a_list_is_fixed_when_signed` | | 70 | Records taking a proposal up without the votes, or with released ones | Refuse: every node judges a record against the votes in its history. A remake's record needs none: a remake is decided only by votes naming its base | 7 | unit: `a_record_needs_the_votes` | | 71 | Carries for many voters that have no node, and records with votes that ran out | Taken: nobody but the recording node reads a vote's end. A voter without a node is the party that carries for it, for a record; what is seen for long counts that node once | not promised | unit: `a_record_counts_for_its_voters`; argued (Decisions) | | 72 | Carries for a third of the voters, and keeps its records back: every decision waits, and comes on its day | The voters name another node, which records for them; their votes count meanwhile. A voter carried by nodes of two parties never waits for one. How many each node carries for shows | not promised | sim: `a_carrier_keeps_back` | | 73 | Keeps votes back until they ran out, or crafts them to look old, then shows them | No honest node takes the proposal up, and fewer than a third decide nothing. A remake's votes don't run out, and count when they come | 7 | unit: `taken_up_while_the_votes_run`; sim: `a_decision_from_the_past` | | 74 | Keeps its node's record back, and shows it weeks later: a proposal decided late | It holds only where none of its matter with a higher number was decided since: a node takes up nothing lower than it took up. What hangs shows, and the voters end it with a later proposal; not a remake's | not promised | unit: `nothing_lower_is_taken_up`; sim: `decided_late` | | 75 | Two proposals of one matter both decided: voters changed their minds, or a third voted both ways | Every node acts on the one with the higher number, the same from the same changes; the other shows as replaced | 7 | unit: `the_last_holds`; sim: `two_decided_one_holds` | | 76 | Makes a proposal saying it saw little or much, for a number of its choosing; grinds its digest; commits another's a second time | A number brings nothing without the votes of two thirds and their nodes' records; who votes is the epoch's, wherever a proposal is made; a second carrier changes nothing | 7 | unit: `a_proposal_is_where_it_was_signed` | | 77 | Stays away to hold decisions up | It counts on. A third staying away do hold them up: the rest go apart, naming who votes | 7 | unit: `two_thirds_of_all` | | 78 | Asks the voters for another user's first keys, saying it is that user | It takes two thirds of them, and the days a vote takes, shown to all; the user signs on meanwhile | not promised | argued (Decisions) | | 79 | Puts a voter's vote into a change of its own node; keeps one back; offers one again | Taken: the signature is the voter's. It counts while it runs; the register holds it once | 7 | unit: `a_vote_by_any_node` | | 80 | Signs a vote that says it runs out in ten years | A node counts no vote for longer than `window` from when it first held it; a remake's names its base and runs while the epoch lasts | 7 | unit: `a_vote_runs_a_window` | | 81 | A decision lowers a limit; a user signs on saying it saw nothing of the decision. Or a decision lowers a limit for a day, and raises it again. Or it sets a number that makes no sense | Valid as written, and resolved by the limit that holds: what is past it doesn't count. Names claimed in sight of what fell past it are their claimants' for good. The number has the result it has | 6; not promised | unit: `a_lowered_limit_leaves_out_the_last` | | 82 | Opens proposals without end | Refuse past `limits.proposals` | 6 | unit: `limits_on_proposals` | | 83 | A proposal gives away the name of a user that is out; the user is gone and another claims the name before it is decided | The claim was made in sight of one that didn't stand: it doesn't give way to what the decision gives | 5 | unit: `given_too_late` | | 84 | Contests a name, then asks the voters for it; or two claims of it are final | It takes two thirds of them; every other claim gives way to the one they name, final or not | not promised | unit: `whose_a_contested_name_is` | | 85 | Claims `wiki.r`, which the rules leave to the voters; holds on to it against a later decision | Refuse the claim. The name is whose the decision that holds says | 4, 7 | unit: `a_name_by_the_voters` | | 86 | A user is out and stays out: what of its names? | A decision frees them, or gives them to another, whatever `gone` says | 7 | unit: `a_decision_frees_or_gives` | | 87 | The voters decide a policy that covers a user's names no more; another user writes over what is uncovered; a third of the voters stamp to drop it at once | It doesn't count where the policy holds, and shows aside. Only its user takes it away, nobody changes it; it is dropped once seen there for `uncovered` | not promised | unit: `what_a_policy_no_longer_covers`, `uncovered_is_only_taken_away` | | 88 | The voters decide a policy that stops keeping names for their users | A kept name its user claimed stays its claim. One it didn't is the first comer's | not promised | unit: `a_kept_name_claimed` | | 89 | Names a base for a remake that leaves out what the swarm holds | No honest voter's node takes it up, unless records of it count for a third of the voters, an honest one among them | 7 | sim: `a_stale_base_is_not_taken_up` | | 90 | A remake's coordinator names two bases, each to one of two nodes of every voter | A record counts for a voter only where its vote names the record's base, and a voter signs one such vote an epoch: one base is decided, or none, and the coordinator shows | 7 | sim: `two_bases_one_remake` | | 91 | Runs most of the nodes; serves a snapshot of its own | Nothing reads a count of nodes; every node builds the snapshot itself | 7 | sim: `every_node_builds_the_snapshot` | | 92 | A name is claimed and settled after a remake's base; after the switch a pretender signs a claim of it "in the epoch before" | A root's node named the real claim in its carry record, before it took anything in the new epoch: the pretender's claim is late against it | 5 | unit: `a_carry_record_witnesses`; sim: `a_pretender_after_a_remake` | | 93 | Hands in, weeks into an epoch, envelopes of the epoch before that no node carried: a value its user since replaced, a statement its user never sent | Refuse what no carry record names. A node that holds such an envelope can still name it in its own record: then a value carried over has no word against one its user signed in the new epoch, and a claim is late against what a root's node's record named | 3 | unit: `only_what_a_carry_record_names`, `the_new_epoch_has_the_last_word` | | 94 | Signs after the switch, as of the epoch before, statements and a proposal with numbers of its choosing | Carried over comes after what the snapshot holds and before what the new epoch signs: such a number orders only its signer's statements among what is carried over, and the proposal outranks none of the new epoch | 6, 7 | unit: `carried_over_in_between` | | 95 | Writes a carry record naming what it likes, or several, or one of its own after taking from peers | One a node and epoch. What it names is its node's word, as a change of that node would have been: a contest where it is a root's or the claimant's, no more | 5 | unit: `one_carry_record_a_node` | | 96 | Unvouched a user, then has a node of its own stamp, weeks later, a change that has the user's claim and not the unvouch, to bring the claim back over one made in sight of it | Whether the claim stood is read where the later one was signed, with the witnesses there: one made after brings nothing back. A root's node doing so makes the two contest, in the open | 5 | unit: `a_witness_after_the_fact` | | 97 | Cuts its own device key off from before a user's creation it signed, to take the user's final name | The creation stops counting as its signer's unvouch would, from where the retirement was signed: what the user signed before counts, and its claim of its own name, with its own key, holds the name on. Without another vouch the user is out, its names waiting, final ones too, until it is gone or a vouch comes | 5 | unit: `a_users_own_name_by_its_own_key` | | 98 | Creates a user nobody else vouches for, lets it claim names until they are final, then cuts off the key it created it with from before the creation, to take the names | The creation stops counting as its signer's unvouch would, from where the retirement was signed: the user is out from there, its names wait, final ones and its own name too, and it is gone after `gone` unless a vouch comes. Nobody claims them meanwhile | 5 | unit: `a_creation_cut_off_puts_its_user_out` | | 99 | Creates a user, lets it settle names, then cuts the creation's key off from before it with a retirement that says it saw little, its own nodes silent, so that nothing the user signed counts through the creation, and an accomplice claims its names | The roots' nodes witness past a cut, as against an unvouch: what the user signed that a root's node had in its history counts, its settled names hold, and it is out from the retirement, its names waiting | 5 | unit: `a_cut_keeps_the_roots_witnesses` | | 100 | Cuts the creation's key off from before it on old dependencies, then claims the user's settled names, or creates a user of its name, in a change whose history holds the user's claims and the cut and nothing else | Where the user's claim didn't stand there only by the cut, the two are ordered as claims out of each other's sight, over all the changes: the roots' nodes had the user's claim count first, so the new claim is late, for good, and the user keeps its names | 5 | unit: `a_claim_in_sight_past_a_cut_is_ordered_by_lateness` | | 101 | A root cuts off the key it created users with, from before the creations, to take their names, final ones too, where only the roots create users; or a thief of a root's key gives a moved-in user first keys | A root's creation another root's node had seen stays the claim of the name, and its first keys: a turned root takes back only what the other roots hadn't seen, never a settled or final name. A thief's creation made out of their sight falls; one made in it the voters undo | 5; not promised | unit: `a_roots_creation_outlasts_its_cut_where_another_root_saw_it` | | 102 | A root's node, beside a thief, commits with a fresh writer on heads without the retirement a change holding what the thief's sock signed, to keep it in past the cut | A root's node witnesses past a cut, as against an unvouch: the sock stays in by it, in the open, shown with the root (`GET /registry/users/`). An accomplice's vouch keeps it in too | not promised | unit: `a_cut_has_its_signers_witnesses` | | 103 | A node that held only the older of two values its user wrote since the base carries it beside the newer one | Of several carried over to one place, one that another replaces is left out | 3 | unit: `a_replaced_value_is_left_out` | | 104 | Signs a claim "in the epoch before" of a name the snapshot holds | It gives way to what the snapshot holds | 5 | unit: `the_snapshot_comes_first` | | 105 | Hands in again what a remake left out: a stolen laptop's `node` and `key` statements, retired since | Refuse: the root change lists the digests of the statements the base held | 3 | unit: `what_a_remake_dropped_stays_out` | | 106 | Keeps the last record of a remake back, and shows it a month later | Every node goes to that base. Its carry record names what it holds and what it held of it (who saw what first, decisions since), and each envelope comes once. A key rotated since keeps what its retirement lists. What a third of the voters' nodes held as gone, final or dropped stays so; other lengths start anew | not promised | sim: `a_remake_decided_late`; unit: `a_retirement_lists_what_it_keeps` | | 107 | Has voters vote for a second remake of an epoch, beside one that hangs | A voter signs one remake's vote an epoch, never released: two bases are both decided only where more than a third of the voters signed for both. No node that switched moves again by itself | 7 | sim: `one_remake_vote_an_epoch` | | 108 | A partition at the base: the nodes of a third of the voters take it up, the rest see it after they held more than it has | Every node takes up a base whose records count for a third of the voters, however old, and the remake is decided | 7 | sim: `a_base_seen_late` | | 109 | Proposes a remake beside another voter's; or hands its base first to nodes back from away, or one an hour old that such a node takes up, so that the nodes take up one base and no other | A node takes up every base that passes, one record a proposal. A client offers a vote only for a base whose records count for more than two thirds of the voters, which every node takes up, and shows the other remakes under way: a vote goes to a base every voter's node can take up. Only the votes keep two bases from both being decided | 7 | sim: `two_remakes_proposed_at_once` | | 110 | Proposes a twin of a remake under way, or as its coordinator names two bases to two nodes of each voter, so that honest votes split and the epoch's remakes end | Clients offer a vote for one of the remakes that name the same voters and roots (most votes, then the lowest digest), and none for a proposal whose coordinator named two bases. Honest voters signing within the same minutes can still be split | 7; not promised | sim: `a_twin_remake_gets_no_votes` | | 111 | Votes for a remake with the others, keeps its node's record back once they changed their minds, and shows it when it likes | Those who voted for the remake vote for no other in the epoch: it comes on the day its last record does. A node follows a remake at once only within `remakeAge` of taking its base up; past it, once the new epoch's carry records count for more than a third of the voters. Voters who split between two remakes end the epoch's remakes, and those left go apart | not promised | sim: `a_remake_held_by_its_last_record` | | 112 | Holds its node's record of a remake back, and shows it when some honest nodes are past `remakeAge` from taking the base up and some aren't | Those within it follow, those past it wait, and both sides see it. Once the new epoch's carry records count for more than a third of the voters every node that waits follows; until then those that followed stay, or go back by their operators' word, their users' writes there quarantined to be signed again. A remake shown long after its time is followed by the malicious alone | not promised; healed | sim: `a_remake_between_the_bounds_heals`, `a_remake_long_past_its_time` | | 113 | Holds its own carry records back, or takes them back by stopping its node with a cut, or carries for honest voters without nodes, to steer whether a split heals forward or back, and when | The heal counts a node for one voter, each record as it stood where written; nobody goes back but by its operator's word. The malicious choose when a split starts, not whether the honest follow nor that they go back and forth | not promised; 7 | sim: `a_heal_the_malicious_cant_steer` | | 114 | Shows a remake long after its time, to sweep the nodes that carry for no voter into an epoch with the malicious voters' nodes alone | Every node takes a base up and counts `remakeAge` from then; past it, a node of no voter waits for the heal as any node does | 7 | sim: `a_late_remake_takes_no_node_of_no_voter` | | 115 | Lets a split stay, the honest that followed sent back by their operators, then writes its own carry records so the count crosses, for what the users signed again to come along twice | Going back refuses the remake: the heal doesn't move such a node again, and what its users signed again stays in the epoch it went back to | 4, 7 | sim: `going_back_refuses_the_remake` | | 116 | A thief's statements are in the base of a remake | They stand: a remake makes final. The vote's days are the time to cut the key off | not promised | unit: `a_cut_reaches_to_the_snapshot` | | 117 | Tells a node that was away of an epoch that isn't the swarm's | The node rejoins no epoch that peers advertise: it finishes the old one from archives and builds the next itself, or takes the ID its operator gave | 1 | sim: `away_over_a_remake`, `back_by_an_id` | | 118 | A node back after several remakes offers what its user signed epochs ago | Refuse: an envelope is taken in its epoch and the next. Quarantined, for the user to sign again | 3 | unit: `carried_over_one_epoch_only` | | 119 | A version builds another snapshot from a remake's base | Its node records another ID. The remake is decided for the ID two thirds got; the node stays, and says so | 7 | sim: `a_remake_by_its_result` | | 120 | A remake names its proposer the only root, or leaves a root out; the root left out signs on as one | The voters see whom a remake names before they vote for it. A root is one in the epoch that names it: what it signs after is an ordinary user's, and it is out unless someone vouches for it | 7 | unit: `roots_are_the_remakes`, `a_root_for_its_epoch` | | 121 | Two thirds of the voters turn on the rest | They remake, name the roots and who votes, set any number (a share of the voters that lets one decide for all), change the policy, give a user's first keys to another, deal with the names of a user that is out, and say whose a contested name is: a name taken, in the open. They forge no signature and move nobody to other rules; the rest refuse, or fork | not promised | argued (Going apart, Refusing a decision) | | 122 | Offers a statement signed on the other side of a fork | Refuse: it names its epoch | 3 | unit: `signed_for_its_user_id_and_epoch` | | 123 | A fork naming its proposer the only voter and root | A node follows only by its operator's word, which names the proposal; what that says shows | 7 | sim: `a_fork_by_choice` | | 124 | A decision breaks a node's bounds: the voters let one of them decide for all | The node refuses it and moves to the epoch built without it, the same for every node that refuses, with what it held: they go on together | 7 | unit: `bounds_on_the_numbers`; sim: `those_who_refuse_meet` | | 125 | Proposes saying it saw only the epoch's root, so that those who refuse carry the whole epoch over | No honest node takes up a proposal that says it saw less than the node held a window before: it isn't decided | 7 | unit: `a_proposal_says_it_saw_enough` | | 126 | Says it refuses a decision, or hands out the ID of an epoch without it, to draw nodes there | A node goes there by its own bounds or its operator's word only | 1 | unit: `refusing_is_ones_own` | Nodes and syncing: | # | The adversary | Honest nodes | Promise | Shown by | |---|---|---|---|---| | 127 | Sends different changes to different peers, each under its own number | Take all: changes made at once | 2 | sim: `two_histories_merge` | | 128 | Forks its node's actor | The nodes that took each split; one offered both holds proof and refuses the node; a side drops by its operator's choice | not promised | sim: `a_forked_actor_is_proven`, `a_side_drops_a_fork` | | 129 | Holds changes back, or passes on some | They come by other nodes; a joiner caught up with it syncs on | 6 | sim: `withheld_changes_arrive` | | 130 | Places its nodes around a victim by choosing their keys | The victim's node keeps its seeds and its user's other nodes as neighbours; a claim not settled for long shows. It costs time, not names | 5, 6 | sim: `around_a_victim` | | 131 | Hands a joining node another root change, or changes from before the policy | Refuse the handshake; there is no before | 1 | sim: `a_joiner_takes_its_root_only` | | 132 | Signs a token for any user with its node's key | Taken only by a node whose operator named the signing node | 3 | unit: `a_token_of_ones_party` | | 133 | Logs in on another party's node with a key of the registry; has a name in the registry that the node's own users have | Keys in the registry give nothing on anyone's node by themselves: whom a node lets in is its operator's, and what a user may write is in its signature | 3 | unit: `registry_keys_open_no_node` | | 134 | Lies in its member entry (ready, reached, stable); publishes a short window there to make every node stamp hourly; writes an entry of any size | Sync and trees bend; nothing gets in that way. How often nodes stamp is the policy's; an entry has a shape and a size, or the change is refused | 6 | unit: `an_entry_has_a_shape`, `stamps_by_the_policy`; argued (Reaching the others) | | 135 | Sends envelopes that don't check, without end | Refuse each (a signature costs about 30 µs to check *(docs)*); the node is refused as a whole after the first of its own | 6 | sim: `a_refused_node_costs_little` | | 136 | Writes its own member entry without end; signs and gives up without end; fills the waiting changes; sends changes that say they saw little, each to be judged far back | Take them no faster than a budget per party: put off, never refused; a share of the waiting each | 6 | sim: `a_party_past_its_budget_waits` | | 137 | Starts a writer with every change: each costs every node memory in proportion to the document's history | Past `limits.writers` a user and epoch, every node puts off the changes that start more of the nodes whose writers count for it: a node's, for the user its member entry names. Nothing is refused; what reaches a node within others' histories is held, and a remake leaves it out. A user below a root costs the root nothing, and one beside others on a node costs them nothing, but where the node's entry names it | 6; not bounded | sim: `writers_past_their_limit_wait` | | 138 | One of the users a node carries for, besides the node's own, starts writers past its limit, from nodes of its own | The node's writers count for the user its member entry names, over a remake too, and nothing of it is put off for the others: the users beside it write on | 6 | sim: `writers_count_for_the_user_an_entry_names_beside_others` | | 139 | Signs its `node` statement naming another party's node again and again until its digest is the lowest, so that the node's writers count for it after a remake, then starts writers past its limit | A node's writers count for the user its member entry names, the node's own word, carried over a remake; the digest decides only where the entry names none | 6 | unit: `writers_count_for_the_user_an_entry_names` | | 140 | Sends a node a change of the node's own writer, another value, to make it start a writer | Refused as forged; the node switches only where its own key signed it (a copy of its files) | 6 | unit, exists: `another_writing_as_this_node` | | 141 | Crafts a first change of another node's writer, authored as a third node, to sort before the writer's own in a batch, so that screening judges the writer's changes as the third node's | Screening names a change's node by its own author, or that of its actor's first change in its own history, never by another change of the batch: the writer's changes are vouched for by their own node's signature, and the crafted one, a second first change of the writer, is refused as forged | 1, 2 | unit, exists: `a_committer_from_its_own_history` | | 142 | Sends a change of a few bytes that holds a million operations | Taken, at the cost of applying it: nothing bounds a change's operations | not promised (a bound on what an epoch's document costs) | argued | | 143 | Crafts a change Automerge won't take, or that writes in an object nowhere to be found | Refuse *(checked: the rules refuse the second today)*; only the message that brought it fails | 1 | unit: `a_change_writing_nowhere` | | 144 | Crafts a change Automerge takes and shouldn't: bytes it wouldn't encode itself, operations numbered against its dependencies', a gap in its actor's changes, an operation named that is elsewhere or outside its history, an operation Automerge's transactions never write (an element written over naming the one inserted after it, an insert that replaces, a deletion or an increment inserted, a deletion named as replaced), a table written into, a value written at a mark's begin | Refuse before Automerge sees it, by the change and its own history alone: applied, such a change makes a node panic, save a document that doesn't load, or part from nodes it reached in another order | 1, 2 | unit, exist: `bytes_automerge_wouldnt_encode_are_refused`, `operations_numbered_against_their_dependencies_are_refused`, `a_gap_in_an_actors_changes_is_refused`, `operations_named_at_the_wrong_place_are_refused`, `operations_outside_a_changes_history_are_refused`, `only_what_transactions_write_passes`, `only_what_holds_a_value_is_replaced`, `no_table`, `no_mark`, `what_passes_leaves_automerge_sound`, `a_batch_is_checked_against_itself`, `a_change_refused_after_its_check_stands_in_for_nothing` | Rules, and the swarm as it is: | # | The adversary | Honest nodes | Promise | Shown by | |---|---|---|---|---| | 145 | A rule differs between versions (a bug) | Each side refuses what the other takes, or their stamps name two digests for the same changes: each logs and shows it. A node that finds itself apart from the nodes of more than two thirds of the other voters at its first start with a version writes nothing. One side upgrades and drops | not promised | sim: `a_side_drops_and_comes_back`, `two_digests_one_history`; unit: `a_node_checks_itself` | | 146 | Stamps a wrong digest, to keep the nodes that upgrade from writing; one of three voters does | A node stops only where it differs from the nodes of more than two thirds of the other voters; from fewer it shows it and goes on | 6 | unit: `one_wrong_digest_stops_nobody`, `of_three_voters` | | 147 | A policy version a node doesn't know: in the root, or decided | It doesn't sync, and takes no such proposal up: a policy is decided only with two thirds of the voters' nodes knowing it | 1 | unit: `no_sync_under_an_unknown_policy`, `an_unknown_policy_isnt_taken_up` | | 148 | A partition, for any length of time | A side decides only with nodes of two thirds of all the voters on it. Where a third of them have nodes and votes on both sides, both may: every node then acts on the higher number | 7 | sim: `one_side_decides`; unit: `the_last_holds` | | 149 | None: a swarm that isn't federated | Everything as today | Optional | the existing tests, untouched; `bench_screening` | ## The registry on it ``` _continuum/users/tv/ statements about and by tv _continuum/claims/ip4/10.243.0.7/ tv's claim of 10.243.0.7 _continuum/claims/name/r/ a root's claim of the top-level domain r tv/hosts/toaster envelope: {"nets": {"retiolum": { "ip4": "10.243.0.7", "ip6": "42:0:…", "aliases": ["toaster.tv.r"], "ed25519": "…" }}} ``` The kinds are those shown under Claims, each name written as the hosts use it, in lower case. `toaster.tv.r` is kept for tv by the kind's rule and needs no claim; tv claims it all the same if it wants it through a change of the rules. A name that is no user's, right below the top-level domain (`wiki.r`), is the voters' to give: a proposal names it and a user, and decided, that user holds it. An IPv6 address is generated from the net, the user's name and the host's today; a kind `ip6` with the separator `:`, first come, first served like `ip4`, holds whether or not anyone generates honestly, for addresses written out in full. The export reads an address or a name only in the one spelling it writes. **Moving in.** The genesis change is made from the repository by a script (`scripts/kartei-import`): the kinds and their rules; the maintainers as the roots and the first voters, with their keys and nodes; and for each namespace of the repository a user without keys, its hosts as they are, plain, and their addresses as claims in its name. The genesis change is trusted as it is (every party is given its hash), so what it holds counts without signatures: a host it holds counts until its user signs over it, and a claim it holds is its user's. One of the roots gives each user its first keys as it comes; from then on the user signs its own, and votes from the next remake that lists it. A namespace whose user never comes stays as the genesis change has it. What to weigh, moving in. With one maintainer as the only root and voter, that one settles every claim, decides alone, and sees alone what a third of the voters see, until a remake names others: more than one from the start is better, and a first remake once the users that take part are there. A user that comes later is created by one root, who takes that back alone; another's vouch makes it stand without that root's word. The limits in the genesis policy: 64 keys, 64 nodes and 256 addresses a user for a start. The import may set keys and addresses to twice the most any user has in the repository; a decision changes them after. **Writing out.** `scripts/kartei-export` reads the resolved registry from a node its operator trusts (its own) and writes the tree the consumers read (`/hosts//retiolum/{aliases,ip4,ip6,ed25519.key}`), leaving out what doesn't count and any address or name its host's user doesn't hold. Run on each change of the document (the store's stream), it replaces the merge button. An operator that leaves users out when it reads writes other files than one that doesn't, where a name is contested: what the network at large reads is whose node it trusts for that. ## Stages Each leaves the system working, and is a few patches with its tests, which leave their vectors. At every stage the existing tests pass untouched (149). 1. **A federated swarm's frame.** `--genesis-policy` (a file, written into the genesis change with the roots, the voters and the users it starts with); a federated node is given its root change, syncs under no policy it doesn't know, takes no remake yet, takes tokens and logins by key as its operator says, keeps ended sessions to itself, stamps as the policy says, and writes a member entry of the policy's shape and size. What the genesis change sets for the swarm as a whole is read from the policy. Tests: 131 to 134, 141, 144, 147, 149, and the policy's existing tests under a policy from the genesis change. Those of a crafted change, and of a crafted committer, exist already: screening refuses those in every swarm. 2. **Statements.** The users' registers (`create`, `key`, `node`, `vouch`, `release`); the user ID, the epoch and what its signer saw in an envelope; nodes carrying for users by their own word, and the rule for committers by it; nothing plain; the limits, and the order past them. First, the payloads: each statement's fields and the member entry's shape, settled, so that tests leave vectors. Resolving, step 2 without cuts, and `GET /registry/users`. The client signs statements. Tests: 1 to 6, 8, 11, 12, 17, 18, 21, 34. 3. **Namespaces.** The rule, with `userSigned` below a name. Tests: 33, 35. From here the registry runs with users and hosts, names not yet unique. 4. **Claims in sight.** Kinds, names as they are written, their characters, rules by their structure, kept names and claims of them, limits, `claim` and `release`, judged as written; resolving step 4 for claims in sight, and what comes back. Tests: 19, 37, 40 to 42. 5. **Out of sight.** Late, contested and settled, for names and for users' names; a claim's side; a root's node writing when a claim reaches it, and a node that comes back catching up first. The voters as the root change names them; lengths of time read from the stamps; final. `GET /registry/claims` with what makes a claim late; values marked in `GET /store`. A node keeps its seeds and its user's other nodes as neighbours, leaves out members that name another epoch, and shows a claim long unsettled. Tests: 7, 9, 10, 13, 15, 16, 36, 38, 39, 43 to 46, 49, 52, 53, 127, 129, 130. 6. **Cuts.** `retire` and the keys above, a node that stops, a cut never reaching its own statement, what a cut takes back, what doesn't count left out, the value before read again, the client listing what stopped counting. Tests: 14, 20, 47, 48, 51, 54 to 58, 65, 66. 7. **Unvouching.** `unvouch`, a vouch or a creation cut off as by an unvouch, a user giving itself up, one that another vouched for staying, those brought in going with it, the names of a user that is out waiting, gone, nothing taken from an unvouched user's nodes, what comes back with a vouch. Tests: 22, 24 to 29, 31, 32, 59 to 62, 64, 96 to 102. 8. **Coming back.** The drop an operator asks for, a forked actor proven and shown with what the roots' nodes hold, the budget and the share per party, the writers counted per user, for the one a node's member entry names, a node keeping its writer over a clean stop. Tests: 128, 135 to 140, 142, 143. 9. **The registry.** Import, export, and a federated swarm of the simulations with the registry's kinds and a few hundred hosts. From here it can be tried: users, hosts, names, a root that settles, names that become final. It isn't to be relied on yet. The stages after change the rules, and until a policy changes by a decision a rule changes only by every party upgrading at once: a swarm started here is started anew after the last stage, by an import of what it holds. 10. **Decisions.** `propose` and `vote`, signed by the client and taken from any node, the nodes' records and how they are judged, taking up, decided, the decision that holds, what hangs; `GET /registry/decisions`. What is decided: a number, a user's first keys, the names of a user that is out, whose a contested name is, a name the rules leave to the voters. The simulations start from a root change naming several voters, as a remake's does. Tests: 23, 63, 67, 70 to 86, 148. 11. **Versions.** The digest with every stamp, a node checking itself before it writes; for every swarm, a node that speaks the wire version before its own, and a handshake that says which epochs its node keeps. Tests: 145, 146. 12. **Remakes.** The proposal with its list of voters, its roots and its coordinator; the base, every one a node finds holding what it held `baseAge` before, however old where records count for a third, one record a proposal, judged without votes; votes naming it, one a voter and epoch, offered by clients only where records count for two thirds; taking a remake up by its result, the snapshot every node builds, what it leaves out and what can't be written again; carrying over: every node's carry record, then each envelope once, in its order, with the new epoch's word last on values; a retirement's list as its cut; decisions and what was seen for long, over a remake; what becomes final. A node keeping the epochs it left on disk, peers answering for them and saying which; a node walking them, or rejoining by an ID its operator gave, and by none that peers advertise. Tests: 68, 69, 89 to 95, 103 to 110, 116 to 120. 13. **The policy by a decision.** The policy as a matter, a node that doesn't know it, what it no longer covers: shown aside, taken away by its user only, dropped after a time, moved at a remake. Tests: 30, 50, 87, 88, 147. 14. **Going apart, and refusing.** A fork followed by an operator's word, with who votes and who the roots are on its side. Refusing a decision: a node's bounds, how late a remake it follows at once (`remakeAge`) and how the split heals, a waiting node's fetch of the new epoch's carry records, going back as refusing, the epoch without the decision, what a node takes along. Tests: 111 to 115, 121 to 126. From here it can be relied on: the rules change by decisions. ## What was checked, and what is assumed Checked in the code: * A change is judged at its dependencies, or at heads that hold the same for what rules read, before it is applied; a refused change keeps out what builds on it; a member whose own change broke a rule is refused as a whole (`access::rules`, `access::screen`). * What screening takes as read by rules is a list: members, users, remakes, votes, access and bans (`screen::relevant`). * An envelope is checked for its swarm, path, `prev`, signature, and its user's key in the registry as the writer saw it (`access::envelope::check`). * The genesis node writes the users it starts with and their keys, the swarm ID, and what holds for the swarm as a whole (neighbours, topology, dissemination) in its first change (`swarm::bootstrap`, `document::meta`), so the policy can be written with them. * A node writes anything below its own member entry (`access::rules`); readers bound what they take of it, not what is stored (`swarm::members`); a snapshot copies every entry there is (`remake::snapshot`). A shape and a size are new. * A member's entry holds its alive stamp as Unix milliseconds. It is renewed every seventh of the shortest window any member publishes in its entry, an hour at least, which is daily by default (`swarm::members`). A renewal overwrites the stamp, so two stamps of one node are two changes, found in the history; nothing reads them so today. * Screening names a change's node by the change's author, or that of its actor's first change in its own history, never by another change of its batch, and counts no actors (`access::screen`). A limit on writers is new. * A drop exists and does what coming back needs (`AppState::drop_taken`); what is new is an operator asking for one its own rules wouldn't make. * Neighbours are computed from the member list by key hashes (`swarm::topology`); a member that answers from another epoch isn't left out of them. * A second change at an actor's number is refused as forged, by whoever brought it (`document::signatures`, `access::screen`). Keeping both as proof is new. * A message of another wire version is ignored whole (`transport::wire`). * A node keeps the documents of the epochs it left in memory (`remake::local`). Keeping them on disk is new. * The quarantine is in memory, and holds paths and values of the node's own writes (`docs/remakes.md`); a replay writes state by path, the last writer winning (`remake::delta`). A quarantine on disk that holds envelopes, anyone's, and every node writing again the envelopes it holds after a remake, are new. * The relays are read from `_continuum/relays`, which an operator lists (`document::meta`, `swarm::members`); the genesis change doesn't set them. A federated node reads them from its configuration alone (`--libp2p-relays` exists). * A snapshot records the highest number per actor in its base, by which a node tells what it holds beyond it (`remake::snapshot`, `remake::delta`). The digests of the base's statements do that for a federated one. Checked upstream, in Automerge 0.12: a second change at an actor's number is refused, with the whole batch it came in (`DuplicateSeqNumber`); the change that made an operation is found (`hash_for_opid`), so the change carrying a value is found from the document. Measured upstream, with Automerge 0.12.0 alone, on histories of small writes to a map: * It applies a change that lists an actor none of its operations names, and then gives back another change under that hash and saves a document that doesn't load; where the document doesn't hold that actor, applying panics. It applies a change whose first operation is numbered below its dependencies', and the save doesn't load; one numbered 2^32 − 1, and the node's next write panics. * Every writer costs heap in proportion to the history. A document of 10^5 changes takes 42 MB with 10 writers, 79 MB with 100 and 435 MB with 1000, where the nodes write in turn: a slot of 4 bytes per writer in every clock Automerge caches, which there is one for most changes, and one for every 16th at best. * With an actor for every change, heap and time grow with the square of the changes: 32 MB at 10^4 changes and 2.7 GB at 10^5 for a line of them, eight times that at 10^4 where each change also builds on its node's change before it; 2 to 20 ms to apply one more change at 10^4, 0.16 s at 10^5. An actor that is the hash of its change with the actor zeroed is made with the public API and checked with one hash; two changes a node writes on the same change of its own are then both held, with the same values in the same order whichever came first. From the docs: a node under an unknown policy receives without judging; every node takes a token any member signed, and lets in by key any user of the registry; where a refused member shows; the cost of checking a signature; a node keeps the documents of epochs it left for a while (`archiveRetention`: 2 epochs, 30 days), and every node builds a remake's snapshot itself today; a node that was away rejoins the epoch enough ready members advertise, and has its own writes carried over within the replay window, the rest quarantined; a member votes for one remake of its epoch at a time, and a compaction's base is fixed by the coordinator when it commits. Assumed, to be shown as it is built: * Whether a change is in the history of a cut, of what a statement says its signer saw, or of a witness's change, can be answered cheaply enough: per actor, the last number within that history, kept per cut and per claim that has a rival. Statements and rivals are few. * Resolving kept as the node goes costs little per change. Judging a change that says it saw little reads far back: the registers there, who was gone there, which decisions were decided there (`document::at`), more than an envelope's check reads today. Whoever makes others do that pays from its party's budget. * Whether a claim stood in a witness's history is kept as the node goes, for the claims that have a rival. * Writing a quarantined statement again as it is works after a drop wherever what it builds on still holds. * A node can keep neighbours beside those the member list gives (its seeds, its user's other nodes), and leave out members of another epoch. * A limit counted at a change's dependencies (a kind's claims by one user) is read fast enough from the register; an index kept beside it otherwise. * Who lost a user name as a change's history shows it (judging, 6 and 7) is worked out only where a name has several creations there, which is rare. * The snapshot of a federated remake, built from the resolved registry, comes out byte for byte the same on every node, as today's does from the document. * A node can keep on disk, and answer sync for, an epoch it left. * A node can commit its carry record (the digests of what it holds beyond a base, and what it held of it) before it takes anything from a peer, at a registry's size. * What was seen for long is kept as the node goes, per voter's node and per thing watched (a user out, a claim holding its name, a thing uncovered), costs little, and is built again from the changes at a start. * The digest of the registry as it resolves is cheap enough to make with every stamp at a registry's size, and to make at another node's stamp now and then. * A version can speak the wire version before its own. * A node can keep, with the document, when it received each change, at a registry's size. * A node counts the writers each user's nodes started in the epoch as it takes their changes, cheaply enough: a count kept per user. * What is asked of a change before Automerge sees it keeps out every change it applies and shouldn't. Changes are generated against it (`what_passes_leaves_automerge_sound`); batches, changes on older states and chunk bytes only outside continuum so far.