Sundogcert/Instance.lean — the concrete executable ZMod 2 instance.
A [n=4, k=2, m=2, τ=1] GF(2) syndrome certificate. Two verifiers on ONE scheme:
vSupp (lb = supportLb) — degenerate support bound (rejects only at τ=0)
vCol (lb = colWeightLb) — non-degenerate column-weight bound (rejects at τ>0)
hHG proved AXIOM-CLEAN by decide (kernel; 4 secrets, tiny matrices).
HEADLINE: y=1100 & y=1110 DIVERGE (vSupp quarantine, vCol reject) — the
non-degenerate bound earning its keep at τ=1.
HONESTY NOTE: colBound H = 1 here, so colWeightLb is TIGHT on this code — a FAVORABLE case.
In general (non-uniform H) the bound is loose: it divides by the GLOBAL worst column weight
(see Certificate.lean). This instance demonstrates the bound's SOUNDNESS and its τ>0 reach,
NOT general tightness.
The dual-pair law, AXIOM-CLEAN by decide (4 secrets over ZMod 2, 2×4 / 2×2 matrices).
The concrete scheme.
Equations
- Sundog.Certificate.Instance.S = { n := 4, k := 2, m := 2, G := Sundog.Certificate.Instance.G, H := Sundog.Certificate.Instance.H, τ := 1, hHG := Sundog.Certificate.Instance.hHG_decide }
Instances For
The shared witness search and the two verifiers. #
Verifier with the degenerate support bound supportLb.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Verifier with the non-degenerate column-weight bound colWeightLb.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Display instance for the three-valued verdict. #
Equations
- One or more equations did not get rendered due to their size.