Dated corrections (2026-10-27): README (a validator refuses an anchor below the threshold; the published follower lowers the count to one seal); formal-consensus models print the chain facts of today or date the ones of their time (ten validators, the anchor certificate enforced since 2026-08-14, votes attributed through post-quantum seals since block 24,300,000); verdicts unchanged (ALL MODELS PASS)

This commit is contained in:
Aere Network committed 2026-10-27 06:48:09 +02:00
1 parent 42047a8b48
commit 9b2a69ab6b
14 files changed
+57 -37

No files matched your search

+5 -3
View File
@@ -34,8 +34,9 @@
# A bounded model check is NOT a proof for all N or all executions; it is a
# decision procedure over the stated finite configuration. Stated honestly.
# * This models the QBFT message combinatorics / locking DESIGN, not the Besu
# Java bytecode. Chain 2800 consensus is classical ECDSA QBFT (NOT post-
# quantum); the Falcon layer is modeled separately (falcon_*_smt.py).
# Java bytecode. Chain 2800 consensus was classical ECDSA QBFT (NOT post-
# quantum) when this model was written, before 2026-08-02 (dated on 2026-10-27);
# the Falcon layer is modeled separately (falcon_*_smt.py).
# -----------------------------------------------------------------------------
from z3 import (Int, Bool, Solver, And, Or, Not, Implies, If, Sum, sat, unsat)
@@ -246,7 +247,8 @@ if allok:
print(" proving the ceil(2N/3) quorum and the locking rule are load-bearing.")
print(" BOUNDARY: L1 is unbounded (all N); L2/L3 are bounded model checks over")
print(" the stated finite configs; this is the DESIGN combinatorics, not Besu")
print(" bytecode; chain 2800 consensus is classical ECDSA QBFT.")
print(" bytecode; chain 2800 consensus was classical ECDSA QBFT when this model was")
print(" written, before 2026-08-02 (see the aere-node SPEC.md for the chain of today).")
else:
print(" NOT fully established (see FAILED / unexpected result above).")
import sys