| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
|
|
|
|
| |
other
A property over generated federations, honest ones: a fork at the heads of a history's
first half, by the version current there, numbered one past it and changing it. Its
root keeps what counts at those heads, the values at places and the members, with its
version current; it takes nothing else of the history; and the store it came from takes
nothing built on the fork's root (`docs/federation-tests.md`, Properties, Forks).
|
| |
|
|
|
|
|
|
|
|
|
| |
it keeps
A fork's root keeps events (`docs/store.md`, On Automerge): they follow its genesis
change in changes of the same writer, built the same way, filled in the order of their
IDs, events going into a change until their bytes there reach 1 MiB, the next event
beginning the next change (`events::founding`). A swarm holding a store starts from all
of them (`events::started`, given the events the root keeps; none for a federation's
root).
|
| |
|
|
|
| |
`Spec::root`: the root whose first version a spec spells out, built in one place for
the tests of the attacks, of the store read from a document, and the properties.
|
| |
|
|
|
|
|
|
|
|
| |
alone holds
A property over generated federations, honest ones with checkpoints: their events are
put into a document by two writers, in batches of a shuffled order, some by both at
once, the writers merging now and then; a node reads its store from each writer's
document as it grows, and once more after both merged. Each holds what a store given
the events alone holds: its checkpoint, the events it took after it, and what it reads.
|
|
|
Three to five parties write in their namespaces, change their key sets and node lists,
propose versions and checkpoints on what they last caught up with, vote, and write the
versions that pass; honest ones back one proposal on a version, an adversary votes as it
likes and signs as another party with its own key, or where it may not write. Over such
histories:
* the store judges every event, and reads, as the model does, offered the same events in
the same order, with an adversary and without;
* what builds on a refused event is refused;
* honest parties read the same whatever order the events come in, checkpoints and all;
* after a checkpoint, what the store took the model takes, reading the whole history but
for what the store refused as not above it, and the two read the same; the version
naming the checkpoint is taken;
* every version a store takes was backed by two thirds of the parties of the version it
changes, in its history;
* without a party voting twice, no two versions change one.
A failing history is cut down and printed.
|