Vortex DSE public verification bundle
Verification details for these badges are documented in STATUS.md.
TLA+ specification for the per-slot input-set agreement layer of Vortex DSE. After C-slot admission, correct live nodes converge on the same committed input set for that slot.
This repository isolates the agreement layer that runs after admission: nodes first stop admitting
new inputs for slot k (Freeze), then exchange and union observations (Reconcile), and
finally commit only when the resulting set identity matches by hash/Merkle root (Commit).
The goal is deterministic slot agreement with explicit assumptions and reproducible model checks.
This repo is for readers who want the agreement layer, not just the admission rule. It shows how nodes converge on one committed set per slot under the declared assumptions.
| Repository | Role | Verification status |
|---|---|---|
| vortex-dse-cslot-proofs | Late-tolerant C-slot admission; deductive safety proofs | TLAPS: []TypeInvariant, []NoFutureAdmission; all 194 obligations proved |
| vortex-dse-cslot-spec | Strict C-slot admission, clock skew, Byzantine timestamp/origin spoofing, executable reference | TLC bounded checks; JavaScript reference scenarios |
| vortex-merkle-agreement ← you are here | Per-slot input-set agreement: Freeze → Reconcile → Commit | TLC + Apalache bounded checks under declared assumptions |
Freeze admission for the slot, reconcile the node views, confirm equality by Merkle/hash roots, then commit the same input set everywhere.
C-slot admission
↓
Local processed set
↓
Freeze admission for slot k
↓
Reconcile node views
↓
Merkle/hash equality confirms identical set
↓
Commit slot-final input set
┌───────────────────────────────────────────────┐
│ Vortex DSE (slot k) │
└───────────────────────────────────────────────┘
│
admitted inputs (per node)
│
┌──────────────────────────────────────────────┐
│ Merkle Agreement: Freeze → Reconcile → Commit │
└──────────────────────────────────────────────┘
│
identical committed_set[k]
│
shared Merkle/hash root[k]
Open (admission still open)
└─ Freeze slot k
(admission closed, local processed set snapshot)
↓
Reconcile
└─ Exchange summaries/sets
└─ Union observed inputs for slot k
└─ Compute candidate root
↓
Commit
└─ Commit only when compared roots imply same set identity
└─ Result: MerkleAgreement holds for committed correct live nodes
The headline property is MerkleAgreement:
any two committed correct live nodes hold an identical
committed_setfor the current slot.
- Not the admission rule itself.
- Not the full end-to-end consensus/finality story.
- Not the private lossy or exactly-once refinements.
- Read Agreement layer in one paragraph and Freeze → Reconcile → Commit (visual).
- Open
Vortex_DSE_CSlot_AE.tlaand locateMerkleAgreement. - Check assumptions and bounded verification results in the repository status docs.
- Run TLC and Apalache locally (see Reproduce section).
- Read the repository architecture overview for bundle-level context.
- See
CONTRIBUTING.mdif you want to submit improvements.
./run_tlc.sh /path/to/tla2tools.jarAPALACHE_BIN=/path/to/apalache-mc ./run_apalache.shThis repository now also includes a Lean 4 model and proofs in:
Vortex_DSE_CSlot_AE_Lean.lean
It formalizes:
- protocol types (
Phase,MsgRecord,NodeState,SystemState) - transition relations (
Submit,Process,Freeze,Reconcile,Commit,NextCslot) - reachable-state trace induction
- proven safety theorems:
reachable_typeInvariantreachable_committedSupersetsProcessedreachable_merkleAgreementreachable_reconciledContainsProcessed
- Read the one-sentence summary.
- Inspect the claims matrix and assumptions.
- Check the phase transition model: open, frozen, committed.
- Run TLC and Apalache.
- Continue to the admission repos to see what this layer depends on.