Repository navigation
Independent verification: every child record and endpoint adapter of the selected frontier1094 CLIFFORD-RECIPES exact with global phase (no new kappa) - #1781
Conversation
…t with phase (no new kappa) A from-scratch, standard-library Clifford kernel checks Lemma G's RecipesExact premise on the selected gauge44 word. All 2,896 stored child recipes satisfy L F_r R T_old = T_new and all 224 endpoint adapters satisfy their defining identity (Lemma G H6), exactly on all 512 columns with global phase, by packed Gaussian-integer evaluation at the Lean check radix beta = 2K + 2. The kernel is calibrated against the Exact.lean literals, CrocSwap#1415's operator digests and CrocSwap#702's 14 frame kernels; the records are bound from the selected certificate through the owner audit, and the inventory equals the relabel keys of both emitted orientations. Twelve semantic mutation controls are rejected.
- The producer's lower_child check (signed Z4 tableau plus column 0) is complete but not independent; K2 is a control on this package's own comparator, not a gap in the producer's check. Lemma G's I-tr and check_adapters.py ran on four other words. - Scope is record level for CLIFFORD-RECIPES.json; identity adapters are 866 per orientation (352 entry + 514 exit). - Gate-order equivalence holds on all 224 adapters (counted in RESULT). - B3 accepts only the selected record or checkpoints/frontier1094.json; B8 uses a path pin in the source manifest. - Tests (26): mutated child/adapter records rejected by evaluate(), receipts cover each pair once, measured digit bound on the 16-gate identities and a beta = 2K collision, I5/I6/I7 and fixture-pin negatives, calibration reproduced. - Credits: HyperplaneEnd Lean (jeremykothe2, CrocSwap#593), Lemma G (DreamingOfClouds), CrocSwap#433 H6 identities, PR425 (jacklightChen), CrocSwap#1029/CrocSwap#662 engines.
|
Batch review at Merged to Reviewed scope: Independent exact Gaussian-integer packed evaluation checks all2896 stored selected child records and224 endpoint adapters on512 columns including global phase. Source bindings, complete inventory and sound radix bound reviewed;26 controls/tests pass. Executor bridge,36 residual wrappers, identity adapters and full theorem remain separate obligations. The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions. Batch review, attribution and evidence. Thank you for the contribution. |
|
DONE — published #2638 at The opt-in packed-checker adapter preserves the full 2,896-child/224-adapter/512-column replay, exact legacy result and receipt bytes, and independently audits all 4,536,832 actual table entries. The source snapshot, executed-kernel companion receipt, eight source/cache/fault controls and Git-free replay passed; separate AI review found no material issue. Four serial fresh processes measured a 2.44x median wall-time ratio on the shared Windows host, with individual observations and limitations retained. Existing PR662 algorithms and PR2329 production integration are credited. No new certificate, supplier, exponent or portable speed guarantee is claimed. Original advance claim retained below. CLAIM — LOCAL-ONLY — opt-in table integration for this independent packed all-column checker. Owner: ywz65, with OpenAI Codex assistance. Started 2026-10-15T16:14:55.655474+00:00; expires 2026-10-15T19:14:55.655474+00:00 unless updated. Base: canonical main Bounded scope: reuse Charles Bethin's existing #662 permutation/phase table builders in the packed checker's gate loop through an authenticated opt-in adapter. Preserve all 2,896 child checks, 224 adapters, all 512 columns, global phase, calibrations, semantic controls and exact receipts; leave frozen source files unchanged. Check all actual table entries independently, cache invalidation, source refusal and useful faults. Run alternating fresh-process baseline/candidate full-checker benchmarks. No new table algorithm, certificate claim, selected result or exponent is proposed. #2329 already integrates these tables into production Initial LOCAL-ONLY full-checker probes pass in both modes; a first serial pair was about 72 s baseline and 39 s candidate, not yet a controlled performance result. Overlap: complete cached Discussions snapshot at 2026-10-15 12:29:05 UTC, supplemented by current recent-100 open PRs and #1781/#662/#2329 REST heads/comments. Newer complete Discussion coverage remains unavailable; no claim of exhaustive novelty. |
… wrappers are exact (no new kappa) Lemma A's exact part for the selected gauge44 word rests on the producer's own WRAPPER-CHECKS.json (not pinned by the owner audit); the chain's audit checks only the wrappers' structural fields. This binds RESIDUAL-ADAPTERS.json through the owner audit, ties its 36 keys and 480 residual events per orientation to the word and programs, and checks every identity L F_w R T_E = T_end exactly on all 512 columns with global phase by two kernels: a new closed-form amplitude kernel (calibrated on #702 and #1415) and #1781's packed evaluator. Mutation controls are rejected on every record.
Independent verification: no new κ, and the selected record is unchanged.
Every child record and endpoint adapter stored in the selected frontier1094 gauge44 word's
CLIFFORD-RECIPES.jsonequals what Lemma G assumes (T_B T_A⁻¹, or H6 for adapters), on all 512 columns with global phase. The check uses a kernel written from scratch.independent-moment, with the scope refined: one selected assembly premise is checked by a genuinely independent exact implementation.0b1cccf8.research/frontier1094-recipes-exact-seed76/.Why this is needed
Lemma G's
RecipesExact(research/e8-lemma-g-lean/LemmaG/Stream.lean:110-112) is a hypothesis of every Lemma G/A/HPE theorem. It says every relabelA → BexecutesT_B ∘ T_A⁻¹. Every climb that the selected complex profile prices as a rank-r child relies on its stored recipeL ∘ (C_[r] ⊗ I) ∘ Rmeeting it exactly.A phase or input-character error in a recipe would leave ranks, histograms and the paid profile unchanged, so rank-level checks cannot see it.
Before this PR:
phases_full.py/lower_child(icekylinx) asserts equality of the signed Z4 tableau and of column 0, which pins each operator exactly, global phase included. But it ran in the producer's own code, at generation time.e8-lemma-g-lean, DreamingOfClouds) ran independent all-512-column checks of these premises (Complex supplier b ≈ 1.327·10⁻³ (+4.7%) on whole-residual hosting: shared-donor kernel and entrance gauges with paid residual wrappers (conditional on two lemmas) #484's I-tr for H2,check_adapters.pyfor Split centres and source-basis reuse for conditional κ = 0.001120864952258278 #433's H6 identities) on four other words, not on the selected word.research/complex-frame-distance-seed80) checks the ranks of the same 1,004 frames and 2,896 edges, and makes no phase claim.So this PR is a second, independent, byte-bound check of the selected word's stored recipes. It is not the closing of a known gap.
Result
PASS_FRONTIER1094_RECIPES_EXACT:L ∘ F_r ∘ R ∘ T_old = T_new, which is equivalent toL F_r R = T_new T_old⁻¹.M ∘ C_q = T_start;M ∘ F_9 ∘ C_q⁻¹ = T_final.Both hold exactly on all 512 columns of ℂ^(2^9), with global phase included.
The K histogram (C gates per identity) is {1:120, 2:400, 3:480, 4:254, 5:64, 6:432, 7:416, 8:476, 9:246, 16:8}. The run takes about 33 s of CPU on one core, including calibration and controls.
How
1122cb3a…) → capsuleselected-replay.tar.gz(f1da8061…, pinned in batch1099's integration record) → template and owner audit → the gauge44 files.CANONICAL-WORD16bc0ebb…, whose payload digest is4ddb29fb…;CLIFFORD-RECIPESd0768f21…;CLIFFORD-REVIEWcb0e10a8…;LOCAL-PROGRAMS241fde27….split-centresdecoys share the same basenames and are rejected by digest.clifford.pyuses the standard library only and imports no repository code. It was written from the Lean gate definitions (HyperplaneEnd/Clifford.lean,Exact.lean); the producer's code was read only as a specification.checkradix. A C gate at most quadruples a component, so scaled digit differences stay below 2^β, and a zero signed-digit expansion then forces every digit to zero.canon(E),canon(U),L.gatesandR.gatesequalfE/fU/wL/wRfor the three pairs, and their rank-7 identities hold;T_U ∘ T_E⁻¹;Controls
Twelve semantic mutations, each rejected on every sample record it applies to:
linear_Z4 += 2)The gate-order mutation is used on children only. All 224 endpoint monomials satisfy
q(Gx) = q(x), so on adapters it is an exact equivalence; the order is pinned by the children and by FX1's LeanMono.gatesliterals.Comparator controls. These check this package's own comparator; they make no claim about the producer's check.
Binding controls: the decoy recipes, the decoy word, one phase digit changed in the recipe bytes, a duplicate JSON key, a flipped archive byte and unsafe archive members are all rejected.
test_package.pyhas 26 tests. They include:evaluate();Scope: what this does not show
rec(A, B)equals the record's circuit operator (H1 andcheck_extended_labels).RESIDUAL-ADAPTERS.json) or their 480 residual events per orientation (Lemma A), or the 866 identity adapters per orientation (352 entries, 514 exits). It is a record-level check ofCLIFFORD-RECIPES.json, not of every relabel in the stream.Checks run
verify.py:PASS_FRONTIER1094_RECIPES_EXACT, and RESULT.json is reproduced byte for byte.test_package.py: 26 tests pass.research_package.py --check-onlypasses.research_package.pypasses:PASS_REGISTERED_RESEARCH_PACKAGE, 36 s.verify (…, tests)job is pre-existing on main (stale spectrum-audit pin) and is not caused by this package; the repair is CI repair: refresh the single-intersection spectrum audit pin after #778 (tests job red on main) #1752.Reproduce
python3 -I -B research/frontier1094-recipes-exact-seed76/verify.py # about 33 s; PASS_FRONTIER1094_RECIPES_EXACT python3 -I -B -m unittest discover -s research/frontier1094-recipes-exact-seed76 -p test_package.py python3.12 scripts/research_package.py --package research/frontier1094-recipes-exact-seed76Overlap and credit
e8-lemma-g-lean, DreamingOfClouds, Lemma G of #484: clean proof and Lean 4 formalisation of its core #509 from Complex supplier b ≈ 1.327·10⁻³ (+4.7%) on whole-residual hosting: shared-donor kernel and entrance gauges with paid residual wrappers (conditional on two lemmas) #484): it states RecipesExact and H6, and its I-tr andcheck_adapters.pychecked them on four other words. Split centres and source-basis reuse for conditional κ = 0.001120864952258278 #433 (icekylinx) is the source of the H6 identities.HyperplaneEnd/Clifford.leanandExact.lean(jeremykothe2, [Lean] Hyperplane-ended helpers: Lemma A with an arbitrary terminal frame (no κ claim) #593): the gate semantics, the literal pairs and the packed check with radix 4^(K+1), which is β = 2K+2.phases_full.py/clifford_exact.py(icekylinx), adapting PR425's exact phase lowering (jacklightChen).selected-replay-fastpath: these re-run the producer's complete check while reproducing the bytes. That is semantic, but not independent. Our Tooling: opt-in parallel exact U8 phase recipes, byte-identical; 5.7x alone, 28.8x with merged PR662 evaluator (no new kappa) #1041 is a parallel driver.find_overlap.pyfound no independent phase-exact check of this word's recipes.Disclosure
Prepared by Sagar Thakrar (thakrarsagar) with substantial AI assistance from Claude (Anthropic) via Claude Code.
No claim was posted to Discussions. New material is Apache-2.0.