feat(console): instill complete Wave16+Wave17 frontier cards (CF-23 crux/geoBin Aczel/CF-25/CF-26 + binary_pinsker headline/CF-27/CF-28) into FRONTIER_CARDS + LAMBDA_FRONTIER_CARDS; epoch 11-17 @ 99d07509. EXPERIMENTAL·CI-green, #print-axioms-clean, NOT folded into locked-5; Λ Conjecture 1. Signed-off-by: SZL CTO <cto@szl-holdings.com>

pages/console.html

@@ -466,9 +466,9 @@ function nowts(){return new Date().toISOString().slice(11,19);}
 const HONEST='<div class="honesty"><b>How to read this.</b> Every panel reads a live service \u2014 no mock data, and live-vs-replay is labeled where it matters. The trust score \u039b is a research <b>Conjecture</b> (Conjecture 1, advisory \u2014 its unconditional uniqueness is machine-checked FALSE), never a pass/fail oracle. Five formulas are formally proven (locked); other waves are CI-green but not in the locked count. The a11oy image carries SLSA build provenance (Level 1, honest); Level 2 verification is on the roadmap (never claimed as L2-attested, L3, FedRAMP, Iron Bank, or CMMC). No AGI claims. Audit receipts are cryptographically signed where a key is present, and honestly marked unsigned otherwise.</div>';
 const FLOOR=0.9;
 
-const FRONTIER_CARDS=`<div class="card" style="border-left:3px solid #c9b787"><div class="card-h"><span class="card-t">Newly-proven frontier (experimental \u00b7 CI-green)</span><span class="card-ep">Waves&nbsp;11\u201315 \u00b7 main @ d0e78ca3 \u00b7 1323 decls / 23 axioms / CI-green</span></div><div class="mono dim" style="font-size:11px;line-height:1.6;margin-bottom:.5rem">Each theorem below is kernel-verified with <code>#print axioms</code> \u2286 {propext, Classical.choice, Quot.sound} (no new axiom, no sorry). <b style="color:var(--warn)">These are NOT folded into the locked-5 {F1,F11,F12,F18,F19}; \u039b stays Conjecture&nbsp;1.</b></div><div class="card-ep" style="margin:.5rem 0 .2rem">WAVE&nbsp;11 \u00b7 PR#201 \u00b7 graph / cache / detection</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-1 &nbsp;GraphAutoDistInvariant</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">Graph automorphisms preserve the distance metric \u2014 symmetry of the model graph is exact, not approximate.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-2 &nbsp;OuroKVCacheSlots</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The Ouroboros looped decoder reuses a bounded set of KV-cache slots \u2014 memory stays finite by construction.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-3 &nbsp;OuroLoopEarlyExit</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The decode loop is allowed to stop early once its residual is met \u2014 the early-exit is sound, not a heuristic guess.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-5 &nbsp;ImmuneNeymanPearsonOpt</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The detector\u2019s accept/reject threshold is Neyman\u2013Pearson optimal \u2014 best possible detection at a fixed false-alarm rate.</div></div><div class="card-ep" style="margin:.7rem 0 .2rem">WAVE&nbsp;12 \u00b7 PR#202 \u00b7 the \u039b conditional-uniqueness milestone</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CUT-2 &nbsp;lambda_unique_of_separable</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">Under {A1,A2,A3,A5 + slice-multiplicativity}, the trust aggregator \u039b is the <b>unique</b> function \u2014 an <b>axiom-free CONDITIONAL</b> uniqueness theorem (no new axiom). &nbsp;<b style="color:var(--warn)">\u039b unconditional stays Conjecture&nbsp;1.</b></div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-13 &nbsp;OuroLoopInputLipschitz</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The DEQ/looped-LM map is input-Lipschitz \u2014 small input changes can\u2019t blow up the fixed point (well-posedness).</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-17 &nbsp;NumericStability</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">A machine-checked floating-point summation error bound \u2014 backs the numeric accumulation in forecasts/receipts (never the forecast outcome itself).</div></div><div class="card-ep" style="margin:.7rem 0 .2rem">WAVE&nbsp;13 \u00b7 PR#203 \u00b7 replay / quorum / mesh</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">findReplayRoot_complete</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The deterministic-replay PRNG always reaches its replay root \u2014 replays are reproducible by construction.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">quorum_agreement_single_valued_vote</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">A non-Byzantine quorum agrees on a single value (shadow result \u2014 NOT Byzantine BFT, which stays Conjecture&nbsp;2).</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">hm_bottleneck_clean</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The harmonic-mean bottleneck bound for the mesh holds cleanly \u2014 the weakest link governs throughput as claimed.</div></div><div class="card-ep" style="margin:.7rem 0 .2rem">WAVE&nbsp;14 \u00b7 PR#204 \u00b7 series / coding / mechanism / info</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-18 &nbsp;leibniz_remainder_bound</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">Alternating-series (Leibniz/M\u0101dhava) remainder bound \u2014 truncating the series has a proven, bounded error.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-19 &nbsp;rs_distance_lower_bound</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">Reed\u2013Solomon minimum-distance (MDS) lower bound \u2014 the code corrects as many errors as its parameters promise.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-20 &nbsp;vcg_truthfulness_core</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The VCG mechanism\u2019s efficient outcome maximises welfare and is truthful \u2014 honest bidding is the best strategy.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-21 &nbsp;gibbs_inequality</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">Gibbs / log-sum inequality (Cover\u2013Thomas) \u2014 the information-theoretic floor used across the entropy machinery.</div></div><div class="card-ep" style="margin:.7rem 0 .2rem">WAVE&nbsp;15 \u00b7 PR#205 \u00b7 DPO-on-simplex + bisymmetry bridge</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-22 &nbsp;dpo_klDivergence_nonneg_on_simplex</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">KL divergence \u2265 0 <b>on the probability simplex</b> \u2014 conditionally repairs the DPO KL term. &nbsp;<b style="color:var(--warn)">The unconditional DPO KL\u22650 axiom stays FALSE-as-stated.</b></div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-24 &nbsp;lambda_unique_of_bisymmetric_separable</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">An axiom-free CUT-1\u2192CUT-2 bridge with a checkable bisymmetry predicate (full Aczel\u2013Maksa representation = roadmap, not proven).</div></div><div class="honesty" style="margin-top:.8rem"><b>Hard rule.</b> locked-proven = EXACTLY 5 {F1,F11,F12,F18,F19} (@ c7c0ba17, machine-checked, sorry-free). The frontier set above is experimental CI-green only \u2014 never counted as locked. \u039b unconditional uniqueness is machine-checked FALSE and stays <b>Conjecture&nbsp;1</b>; CUT-2 gives the strongest axiom-free <i>conditional</i> uniqueness; CF-22 repairs DPO KL\u22650 only <i>on the simplex</i> (unconditional stays FALSE).</div></div>`;
+const FRONTIER_CARDS=`<div class="card" style="border-left:3px solid #c9b787"><div class="card-h"><span class="card-t">Newly-proven frontier (experimental \u00b7 CI-green)</span><span class="card-ep">Waves&nbsp;11\u201317 \u00b7 main @ 99d07509 \u00b7 1323 decls / 23 axioms / CI-green</span></div><div class="mono dim" style="font-size:11px;line-height:1.6;margin-bottom:.5rem">Each theorem below is kernel-verified with <code>#print axioms</code> \u2286 {propext, Classical.choice, Quot.sound} (no new axiom, no sorry). <b style="color:var(--warn)">These are NOT folded into the locked-5 {F1,F11,F12,F18,F19}; \u039b stays Conjecture&nbsp;1.</b></div><div class="card-ep" style="margin:.5rem 0 .2rem">WAVE&nbsp;11 \u00b7 PR#201 \u00b7 graph / cache / detection</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-1 &nbsp;GraphAutoDistInvariant</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">Graph automorphisms preserve the distance metric \u2014 symmetry of the model graph is exact, not approximate.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-2 &nbsp;OuroKVCacheSlots</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The Ouroboros looped decoder reuses a bounded set of KV-cache slots \u2014 memory stays finite by construction.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-3 &nbsp;OuroLoopEarlyExit</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The decode loop is allowed to stop early once its residual is met \u2014 the early-exit is sound, not a heuristic guess.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-5 &nbsp;ImmuneNeymanPearsonOpt</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The detector\u2019s accept/reject threshold is Neyman\u2013Pearson optimal \u2014 best possible detection at a fixed false-alarm rate.</div></div><div class="card-ep" style="margin:.7rem 0 .2rem">WAVE&nbsp;12 \u00b7 PR#202 \u00b7 the \u039b conditional-uniqueness milestone</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CUT-2 &nbsp;lambda_unique_of_separable</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">Under {A1,A2,A3,A5 + slice-multiplicativity}, the trust aggregator \u039b is the <b>unique</b> function \u2014 an <b>axiom-free CONDITIONAL</b> uniqueness theorem (no new axiom). &nbsp;<b style="color:var(--warn)">\u039b unconditional stays Conjecture&nbsp;1.</b></div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-13 &nbsp;OuroLoopInputLipschitz</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The DEQ/looped-LM map is input-Lipschitz \u2014 small input changes can\u2019t blow up the fixed point (well-posedness).</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-17 &nbsp;NumericStability</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">A machine-checked floating-point summation error bound \u2014 backs the numeric accumulation in forecasts/receipts (never the forecast outcome itself).</div></div><div class="card-ep" style="margin:.7rem 0 .2rem">WAVE&nbsp;13 \u00b7 PR#203 \u00b7 replay / quorum / mesh</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">findReplayRoot_complete</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The deterministic-replay PRNG always reaches its replay root \u2014 replays are reproducible by construction.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">quorum_agreement_single_valued_vote</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">A non-Byzantine quorum agrees on a single value (shadow result \u2014 NOT Byzantine BFT, which stays Conjecture&nbsp;2).</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">hm_bottleneck_clean</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The harmonic-mean bottleneck bound for the mesh holds cleanly \u2014 the weakest link governs throughput as claimed.</div></div><div class="card-ep" style="margin:.7rem 0 .2rem">WAVE&nbsp;14 \u00b7 PR#204 \u00b7 series / coding / mechanism / info</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-18 &nbsp;leibniz_remainder_bound</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">Alternating-series (Leibniz/M\u0101dhava) remainder bound \u2014 truncating the series has a proven, bounded error.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-19 &nbsp;rs_distance_lower_bound</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">Reed\u2013Solomon minimum-distance (MDS) lower bound \u2014 the code corrects as many errors as its parameters promise.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-20 &nbsp;vcg_truthfulness_core</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The VCG mechanism\u2019s efficient outcome maximises welfare and is truthful \u2014 honest bidding is the best strategy.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-21 &nbsp;gibbs_inequality</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">Gibbs / log-sum inequality (Cover\u2013Thomas) \u2014 the information-theoretic floor used across the entropy machinery.</div></div><div class="card-ep" style="margin:.7rem 0 .2rem">WAVE&nbsp;15 \u00b7 PR#205 \u00b7 DPO-on-simplex + bisymmetry bridge</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-22 &nbsp;dpo_klDivergence_nonneg_on_simplex</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">KL divergence \u2265 0 <b>on the probability simplex</b> \u2014 conditionally repairs the DPO KL term. &nbsp;<b style="color:var(--warn)">The unconditional DPO KL\u22650 axiom stays FALSE-as-stated.</b></div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-24 &nbsp;lambda_unique_of_bisymmetric_separable</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">An axiom-free CUT-1\u2192CUT-2 bridge with a checkable bisymmetry predicate (full Aczel\u2013Maksa representation = roadmap, not proven).</div></div><div class="card-ep" style="margin:.7rem 0 .2rem">WAVE&nbsp;16 \u00b7 PR#206 \u00b7 Pinsker crux / geoBin Acz\u00e9l axioms / \u039b scale-inv / abacus</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-23 &nbsp;binary_inv_sum_ge_four</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The binary-KL convexity crux <code>1/p + 1/(1\u2212p) \u2265 4</code> (the second-derivative g\u2033\u22650 of the Pinsker gap), tight at p=\u00bd \u2014 the precise analytic fact Wave15 flagged as missing. (Full Pinsker lands in Wave17.)</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-24 &nbsp;geoBin_idem / comm / homog / mono_left</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The geometric-mean witness <code>geoBin</code> is machine-certified idempotent, commutative, positively-homogeneous and monotone (atop Wave15 bisymmetry) \u2014 the full Acz\u00e9l quasi-arithmetic mean axiom bundle. Real CUT-1 progress.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-25 &nbsp;lambda_scale_axes / lambda_normalization_invariant</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">\u039b scale-invariance: <code>\u039b(c\u2299x) = \u039b(c)\u00b7\u039b(x)</code>, so per-organ rescalings that preserve the geometric-mean budget leave the fused trust score unchanged (MPP normalization-invariance). Genuinely new \u2014 beyond the uniform-scale A2 axiom.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-26 &nbsp;abacusVal_succ</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">The Horner place-value recurrence <code>abacusVal(d\u2080\u2237d) = d\u2080 + b\u00b7abacusVal(d)</code> an abacus-embedded positional decoder unrolls \u2014 well-posed numeric encoding for receipts. The non-overflow bound is deferred roadmap.</div></div><div class="card-ep" style="margin:.7rem 0 .2rem">WAVE&nbsp;17 \u00b7 PR#207 \u00b7 the headline: FULL binary Pinsker + monDEQ + recurrent-depth</div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-23 &nbsp;binary_pinsker</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span><span class="badge" style="color:#e8c372;border:1px solid rgba(232,195,114,.5);background:rgba(232,195,114,.1)">HEADLINE</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5"><b>The long-sought headline.</b> The complete two-bin Pinsker bound <code>2(p\u2212q)\u00b2 \u2264 KL_bin(p,q)</code> \u2014 a genuine, complete theorem (full MVT / monotone-derivative chain) that Waves 14\u201316 only chipped at. &nbsp;<b style="color:var(--warn)">Full-simplex Pinsker (data-processing reduction) is the single remaining step; the unconditional DPO pinsker axiom stays FALSE-as-stated.</b></div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-27 &nbsp;monDEQ_unique_equilibrium</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">A strongly-monotone residual operator (m&gt;0) is injective, so the monotone-operator equilibrium net has <b>at most one</b> fixed point \u2014 the well-posedness/uniqueness core of the Code/Ouro equilibrium engine. Existence (CF-27-FULL) is roadmap; uniqueness half only.</div></div><div class="row" style="display:block;border-bottom:1px solid var(--gold-line);padding:.55rem 0"><div style="display:flex;gap:.5rem;align-items:center;flex-wrap:wrap"><code class="mono" style="color:var(--cream);font-size:11.5px">CF-28 &nbsp;recurrentDepthLipschitz</code><span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span><span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span></div><div class="mono dim" style="font-size:11px;margin-top:.25rem;line-height:1.5">A K-Lipschitz recurrent (\u201clooped\u201d) block iterated r times is K\u02b3-Lipschitz; for a contraction (K\u22641) the depth-r constant is non-increasing in r \u2014 \u201cthinking deeper\u201d exponentially tightens trajectory coupling. The depth-amplification fact for the Ouro loop-models engine.</div></div><div class="honesty" style="margin-top:.8rem"><b>Hard rule.</b> locked-proven = EXACTLY 5 {F1,F11,F12,F18,F19} (@ c7c0ba17, machine-checked, sorry-free). The frontier set above is experimental CI-green only \u2014 never counted as locked. \u039b unconditional uniqueness is machine-checked FALSE and stays <b>Conjecture&nbsp;1</b>; CUT-2 gives the strongest axiom-free <i>conditional</i> uniqueness; CF-22 repairs DPO KL\u22650 only <i>on the simplex</i> (unconditional stays FALSE).</div></div>`;
 
-const LAMBDA_FRONTIER_CARDS=`<div class="grid2"><div class="card" style="border-left:3px solid #c9b787"><div class="card-h"><span class="card-t">\u039b conditional uniqueness \u2014 CUT-2</span><span class="card-ep">Wave&nbsp;12 \u00b7 PR#202</span></div><code class="mono" style="color:var(--cream);font-size:11.5px">Lutar.Round13.lambda_unique_of_separable</code> <span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span> <span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span><div class="mono dim" style="font-size:11px;line-height:1.6;margin-top:.45rem">Under {A1,A2,A3,A5 + slice-multiplicativity (separability)}, \u039b is the <b>unique</b> aggregator \u2014 a theorem, axiom-free (no A6 gate). This takes \u039b <i>off bare conjecture</i> (conditionally), machine-checked.</div><div class="honesty" style="margin-top:.55rem"><b>\u039b unconditional stays Conjecture&nbsp;1.</b> Unconditional uniqueness over A1\u2013A5 is machine-checked <b>FALSE</b> (maxAgg &amp; min satisfy A1\u2013A5 but \u2260 \u039b). Advisory, never a pass/fail oracle.</div></div><div class="card" style="border-left:3px solid #c9b787"><div class="card-h"><span class="card-t">DPO KL\u22650 on the simplex \u2014 CF-22</span><span class="card-ep">Wave&nbsp;15 \u00b7 PR#205</span></div><code class="mono" style="color:var(--cream);font-size:11.5px">dpo_klDivergence_nonneg_on_simplex</code> <span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span> <span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span><div class="mono dim" style="font-size:11px;line-height:1.6;margin-top:.45rem">KL divergence \u2265 0 holds <b>on the probability simplex</b> \u2014 an axiom-free, conditional repair of the DPO KL term used in preference optimisation.</div><div class="honesty" style="margin-top:.55rem"><b>The unconditional DPO KL\u22650 axiom stays FALSE-as-stated</b> (no simplex constraint); the honest token is left untouched. Experimental CI-green \u2014 never folded into the locked-5.</div></div></div>`;
+const LAMBDA_FRONTIER_CARDS=`<div class="grid2"><div class="card" style="border-left:3px solid #c9b787"><div class="card-h"><span class="card-t">\u039b conditional uniqueness \u2014 CUT-2</span><span class="card-ep">Wave&nbsp;12 \u00b7 PR#202</span></div><code class="mono" style="color:var(--cream);font-size:11.5px">Lutar.Round13.lambda_unique_of_separable</code> <span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span> <span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span><div class="mono dim" style="font-size:11px;line-height:1.6;margin-top:.45rem">Under {A1,A2,A3,A5 + slice-multiplicativity (separability)}, \u039b is the <b>unique</b> aggregator \u2014 a theorem, axiom-free (no A6 gate). This takes \u039b <i>off bare conjecture</i> (conditionally), machine-checked.</div><div class="honesty" style="margin-top:.55rem"><b>\u039b unconditional stays Conjecture&nbsp;1.</b> Unconditional uniqueness over A1\u2013A5 is machine-checked <b>FALSE</b> (maxAgg &amp; min satisfy A1\u2013A5 but \u2260 \u039b). Advisory, never a pass/fail oracle.</div></div><div class="card" style="border-left:3px solid #c9b787"><div class="card-h"><span class="card-t">DPO KL\u22650 on the simplex \u2014 CF-22</span><span class="card-ep">Wave&nbsp;15 \u00b7 PR#205</span></div><code class="mono" style="color:var(--cream);font-size:11.5px">dpo_klDivergence_nonneg_on_simplex</code> <span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span> <span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span><div class="mono dim" style="font-size:11px;line-height:1.6;margin-top:.45rem">KL divergence \u2265 0 holds <b>on the probability simplex</b> \u2014 an axiom-free, conditional repair of the DPO KL term used in preference optimisation.</div><div class="honesty" style="margin-top:.55rem"><b>The unconditional DPO KL\u22650 axiom stays FALSE-as-stated</b> (no simplex constraint); the honest token is left untouched. Experimental CI-green \u2014 never folded into the locked-5.</div></div><div class="card" style="border-left:3px solid #c9b787"><div class="card-h"><span class="card-t">geoBin full Acz\u00e9l mean axioms \u2014 CF-24</span><span class="card-ep">Wave&nbsp;16 \u00b7 PR#206</span></div><code class="mono" style="color:var(--cream);font-size:11.5px">geoBin_idem / geoBin_comm / geoBin_homog / geoBin_mono_left</code> <span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span> <span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span><div class="mono dim" style="font-size:11px;line-height:1.6;margin-top:.45rem">The geometric-mean witness <code>geoBin</code> is machine-certified idempotent, commutative, positively-homogeneous and monotone (atop Wave15 bisymmetry) \u2014 the exact hypothesis bundle Acz\u00e9l\u2019s quasi-arithmetic representation consumes. Real CUT-1 progress toward the \u039b uniqueness representation theorem.</div><div class="honesty" style="margin-top:.55rem"><b>\u039b unconditional stays Conjecture&nbsp;1.</b> The full Acz\u00e9l\u2013Maksa representation (generator construction) is a multi-week roadmap, not proven. Experimental CI-green \u2014 never folded into the locked-5.</div></div><div class="card" style="border-left:3px solid #c9b787"><div class="card-h"><span class="card-t">\u039b scale-invariance / normalization-invariance \u2014 CF-25</span><span class="card-ep">Wave&nbsp;16 \u00b7 PR#206</span></div><code class="mono" style="color:var(--cream);font-size:11.5px">lambda_scale_axes / lambda_normalization_invariant</code> <span class="badge" style="color:#c9b787;border:1px solid rgba(201,183,135,.4);background:rgba(201,183,135,.08)">EXPERIMENTAL \u00b7 CI-GREEN</span> <span class="badge" style="color:#5fb3a3;border:1px solid var(--teal-line);background:var(--teal-soft)">#print axioms clean</span><div class="mono dim" style="font-size:11px;line-height:1.6;margin-top:.45rem"><code>\u039b(c\u2299x) = \u039b(c)\u00b7\u039b(x)</code>: \u039b of a Hadamard product factors as the product of \u039b\u2019s, so per-organ rescalings that preserve the geometric-mean budget leave the fused trust score unchanged (MPP normalization-invariance). Genuinely new \u2014 beyond the uniform-scale A2 axiom.</div><div class="honesty" style="margin-top:.55rem">A genuine new theorem about the in-tree \u039b, not a restatement of A2 (which covers only the uniform scale). Advisory \u2014 never a pass/fail oracle; experimental CI-green, never folded into the locked-5.</div></div></div>`;
 
 
 const VIEWS={