mirror of
https://github.com/luxfi/magnetar.git
synced 2026-07-27 02:53:47 +00:00
Antje Worring
df4c537c16
True no-reconstruction threshold SLH-DSA is impossible in the no-dealer /
no-preprocessing model a public, leaderless, permissionless chain needs
(Kondi-Kumar-Vanegas: extractable hash-based signatures cannot be thresholded
by black-box hash use). Stop pretending otherwise.
De-cheat:
- DELETE the circular/vacuous proofs that manufactured false assurance:
Magnetar_N1_Atom_Refinement.ec, Magnetar_N1_SHAKE_Expand.ec,
Magnetar_N4_KeyDeriveStable.ec, lemmas/{Magnetar_CT,SLHDSA_Functional}.ec.
The headline "strict-atom byte-equality" theorem was `apply <axiom that
restates the theorem>`; the Lean side was `sorry`/`:= True`.
- Re-open MAGNETAR-STRICT-ATOM (BLOCKERS): the public combiner DOES
reconstruct the full FIPS 205 master every signature; the v1.1 "closure"
only renamed identifiers. PROOF-CLAIMS / AXIOM-INVENTORY / TCB docs now say
what the code does.
- Re-label the name-grep "strict-atom" / "CT" checks as identifier-hygiene
lint, NOT security or constant-time properties.
- PVSS-DKG open-reveal (publishes the master to any observer) is gated as a
TEST-ONLY path with HONEST LIMITATIONS; production does not rely on it.
- Remove dead htRootCompute; staticcheck clean.
Honest three-leg posture (SPEC 1.0, BLOCKERS):
- Permissionless production = INDEPENDENT FIPS 205 sigs + the weighted quorum
certificate (luxfi/consensus), optionally STARK/FRI-compressed (luxfi/p3q).
No key sharing, no reconstruction.
- Trusted-hardware custody = TEE-attested combiner (trust-relocation, NOT MPC).
- THBS-SE = RESEARCH-ONLY (transient seed reconstruction at the combiner);
the T-SLH-DSA-MPC track (MPC over SHAKE) is the other research escape hatch.
Tests green (CGO=1, 71s). Net -923 lines.
1.1 KiB
1.1 KiB
Lean -- EasyCrypt bridge (HONEST: there is no bridge)
There is no Lean<->EasyCrypt proof bridge for Magnetar. This document previously presented a cross-reference table mapping EasyCrypt axioms to Lean theorems, but:
- The EasyCrypt "theorems" it pointed at were vacuous (a theorem
whose proof was
applyof an axiom restating it; lemmas of the formX = X) and have been deleted or reduced to scaffolds. - The Lean "theorems" it pointed at (
strict_atom_byte_equality,strictAtomDisciplineSatisfied) were asorry-bodied theorem and aProp := Truedefinition. Both have been removed.
A "bridge" between two sides that each prove nothing is not a bridge.
What would a real bridge be
If Magnetar's GF(257) byte-wise Shamir / Lagrange-at-zero algebra
were mechanized in Lean (as Pulsar's reportedly is under
Crypto.Pulsar.Shamir), an EasyCrypt protocol proof could cite those
Lean lemmas as discharged algebraic facts. That cross-citation does
NOT exist for Magnetar today: there is no EasyCrypt protocol proof to
cite into, and the cross-citation was never machine-checked.
See proofs/README.md and PROOF-CLAIMS.md for the honest state.