mirror of
https://github.com/luxfi/proofs.git
synced 2026-10-30 15:21:05 +00:00
54c7e9ac87
TLC had never verified anything: every MC config assigned constants with `=` (TLC model-value) instead of `<-` (operator substitution), so e.g. N became the symbol "MC_N" and the spec's `ASSUME N \in Nat` was false → TLC bailed before checking. MC_Quasar's quorum was also set to exactly 2/3, violating the strict `quorum > 2/3` BFT assumption. Fixed both; all 13 MC specs now run. Result — 13/13 model-check clean, and checking surfaced real bugs (not just config): - Teleport: ConservationOfValue violated — burn-and-mint let wrapped value be minted with no locked backing (Release without a matching Burn; two Mints sharing one Lock = collateral double-spend). Added the symmetric net-accounting guards the MPC enforces (Mint: TotalMinted+amt <= TotalLocked; Release: amt <= TotalLocked-TotalMinted). [CROSS-CHAIN SOLVENCY FIX] - Orderbook: `!.active = (@ + fillAmt < ...)` bound @ to the Bool .active → TRUE+int cast crash; fixed to reference the order's filled amount. - ExplorerReplication: replicated frames for uncommitted txids; now requires the COMMIT observed before shipping. Also `1..n \X P` precedence fix. - LiquidStaking: \div-by-zero on a fully-slashed vault (price=0); guarded. - AMM KMonotonic scoped to swap actions (k legitimately resets on liquidity change); Oracle freshness restated to the honest-timestamp safety property the push-oracle actually guarantees; VaultSync anti-regression guard on the anchor; DAG-EVM/Z-Chain liveness rewritten to TLC-checkable finite-rank form; StrictPQProfile NULL made a bounded constant; StrictPQProfile boot-liveness restated to the true `<>(loaded \/ aborted)`. Co-authored-by: Hanzo Dev <[email protected]>
15 lines
743 B
Plaintext
15 lines
743 B
Plaintext
---------------------------- MODULE MC_DAGEVM ----------------------------
|
|
EXTENDS DAGEVM
|
|
|
|
\* Small-model instantiation for TLC. See MC_DAGEVM.cfg for constants.
|
|
|
|
\* State-space bound for tractable checking. Each vertex ranges over a rich
|
|
\* structure (reads/writes are subsets of Keys, parents subsets of VertexId),
|
|
\* so the set `accepted` blows up combinatorially. Capping it keeps the model
|
|
\* finite *and* small while still exercising every property: conflict and
|
|
\* antichain checks need >= 2 same-rank vertices, and serializability/rank
|
|
\* finalisation need >= 2 ranks -- all reachable within this bound.
|
|
StateConstraint ==
|
|
Cardinality(accepted) <= 3
|
|
================================================================================
|