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:
1 parent
42047a8b48
commit
9b2a69ab6b
14 files changed
+57
-37
No files matched your search
@@ -32,9 +32,9 @@
|
||||
#
|
||||
# Besu quorum quorum(N)=ceil(2N/3), fault bound f(N)=floor((N-1)/3).
|
||||
# HONEST BOUNDARY: bounded per-N/round model checks of the locking combinatorics,
|
||||
# not the C# bytecode; complements the adversarial soak. Chain 2800 consensus is
|
||||
# classical ECDSA QBFT; live mainnet runs Besu (which enforces locking) only, so
|
||||
# these findings gate the SECOND client's producing-validator swap, not the live
|
||||
# not the C# bytecode; complements the adversarial soak. When this model was written
|
||||
# (July 2026) chain 2800 consensus was classical ECDSA QBFT and live mainnet ran Besu
|
||||
# (which enforces locking) only, so these findings gated the SECOND client's producing-validator swap, not the live
|
||||
# chain.
|
||||
# -----------------------------------------------------------------------------
|
||||
from z3 import Int, Bool, Solver, And, Or, Not, Implies, If, Sum, sat, unsat
|
||||
@@ -251,7 +251,8 @@ if allok:
|
||||
print(" * P3 PROVED: because live mainnet's accepting quorum is Besu (which locks), a")
|
||||
print(" fresh conflicting proposal can never gather a prepare-quorum; so the second")
|
||||
print(" client's fresh-proposer gap is a LIVENESS cost (a wasted round), not a live-")
|
||||
print(" chain safety hole. Live mainnet (Besu-only) is unaffected.")
|
||||
print(" chain safety hole. Live mainnet, Besu-only when this model was written (July 2026),")
|
||||
print(" was unaffected; since 2026-09-11 one of its ten validators runs the second client.")
|
||||
print(" * P4 gives the exact threshold: k non-locking second-client nodes are SAFE while")
|
||||
print(" k < q-f (PROVED) but BREAK agreement at k >= q-f (CEX). A single non-locking node")
|
||||
print(" among locking Besu cannot fork the chain, but the second client cannot approach")
|
||||
@@ -266,8 +267,8 @@ if allok:
|
||||
print(" justification, agreement breaks even with every node running it. This is the formal")
|
||||
print(" reason the discretionary-list acceptor was rejected for the signed certificate.")
|
||||
print(" BOUNDARY: bounded per-N/round model checks of the locking combinatorics, not the")
|
||||
print(" C# bytecode; complements the adversarial soak. Chain 2800 consensus is classical")
|
||||
print(" ECDSA QBFT.")
|
||||
print(" C# bytecode; complements the adversarial soak. Chain 2800 consensus was classical")
|
||||
print(" ECDSA QBFT when this model was written (July 2026); see the aere-node SPEC.md for today.")
|
||||
else:
|
||||
print(" NOT fully established (see FAILED above).")
|
||||
import sys
|
||||
|
||||
Reference in new issue
Block a user