Repository navigation
Conditional κ = 0.001671387264390146: all eight mutable-leaver all-K cells, U8 hybrids and frame re-optimisation on PR799's word - #1005
Conversation
…8 hybrids and frame re-optimisation on PR799's word
…K cells, U8 hybrids and frame re-optimisation on PR799's word
|
Correction to the "Change" section. The sentence "Each cell changes the raw paid profile by exactly −30H1+6H2+6H3" is wrong. The measured per-cell change in the raw paid profile is +6H1 − 12H2 + 3H3 − 3H6 (rank mass −27, three helpers removed per cell). The totals are consistent with this: k5 − no-triangle = 5× this delta, and k8 − k5 = 3× this delta. The −30H1+6H2+6H3 figure was the CP-SAT set model's prediction for one cell, not the measured change in the word. The construction, controls, verification and κ (computed from the actual word by the strict replay) are unaffected. Thanks to thakrarsagar's independent audit (#1049) for catching this. |
|
Correction to my previous comment. The original sentence is not wrong; it lacked its comparator. Measured in the raw word against the direct-triangle (all-K) cell it replaces, each leaver cell changes the profile by exactly −30H1+6H2+6H3. That is a measured value, not only the set model's prediction. Measured against the no-triangle base word, the per-cell change is +6H1 − 12H2 + 3H3 − 3H6 (rank mass −27; k5 − no-triangle = 5×, k8 − k5 = 3×), which is what #1049 reports. Both figures are correct for their stated comparators. κ, the construction and the verification are unaffected. |
|
Reviewer note on where this claim lives. This branch is stacked on #1004, so it also carries |
…R987 search) on the k8 leaver word, verified on a checked #1005 baseline
…omoted word, perfectly packed (κ 0.001675338871723469) Fourth layer on the CrocSwap#1005/CrocSwap#1018 chain: the ten low-ended helpers 500, 501, 572-575, 580-583 of research/gauge44-slots-unpromo-arcflow's word get the seven-dimensional end frame their cones force (the join of the minimal end-of-B frames of the helper and its cone registers), the free gate frames are re-optimised exactly (PR864 model, HiGHS MILP), and the whole-owner map is rebuilt for the new inventory {4:40, 5:48, 7:40, 8:112, 9:240}: the windowed LP bound is the perfect packing and the liftable MILP attains it, idle remainder {48:2460} with no small remainder. Strict replay, independent price, recount and the layered verifier (three rejected mutants) all pass. Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01KBSZTxNtzYkGa6MNbKajRo
…omoted word, perfectly packed (κ 0.001675338871723469) Fourth layer on the CrocSwap#1005/CrocSwap#1018 chain: the ten low-ended helpers 500, 501, 572-575, 580-583 of research/gauge44-slots-unpromo-arcflow's word get the seven-dimensional end frame their cones force (the join of the minimal end-of-B frames of the helper and its cone registers), the free gate frames are re-optimised exactly (PR864 model, HiGHS MILP), and the whole-owner map is rebuilt for the new inventory {4:40, 5:48, 7:40, 8:112, 9:240}: the windowed LP bound is the perfect packing and the liftable MILP attains it, idle remainder {48:2460} with no small remainder. Strict replay, independent price, recount and the layered verifier (three rejected mutants) all pass. Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01KBSZTxNtzYkGa6MNbKajRo
…nd ten deepened ends, perfectly packed (κ 0.001675784247432857) Fifth package on the CrocSwap#1005/CrocSwap#1018 chain, a sibling of research/gauge44-slots-deepen-arcflow on the slot word. Pricing the frame moves against perfect packing shows the deepened word over-converted: a restored entrance costs 3.7e-9 in kappa and removes a rank-1 remainder worth 4.3e-9, so once packing is perfect every further restoration is a loss. A joint integer programme over conversion counts and time-free bin patterns gives fourteen restorations and ten deepenings; the exact frame re-optimisation prices the two entrances left promoted cheapest when they are two of {603, 605, 606, 607}. Recipe, standard-library applier, four rejected mutants and verifier in construction/balance; owner map idle {48:2463}; strict replay, independent price, recount, CLAIM.json (five packages, caps and realised fractions) and the whole-head driver extended to five packages with a fresh cold receipt (22 stages) in wholehead/. Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01KBSZTxNtzYkGa6MNbKajRo
… no kappa claim) Extends #1005's mutable-leaver cells to the 16 keys with leaver operands in two of three blocks. Exact taint model plus layered CP-SAT finds circuits; all variants are rebuilt through #1005's chain. None raises kappa: kept copies are entering helpers whose dirt pins their readers, the touched blocks lose their cold-end pairing, and the local replay's 192-bit coefficient allowance (baseline already 188) caps the number of circuits. Prepared by higherbeing with substantial Claude (Anthropic) assistance.
Summary
Conditional κ = 0.001671387264390146 (conservative 0.001671387261540186). That is +9.43×10⁻⁶ over the merged #942 (0.001661960547713947) and +7.15×10⁻⁶ over #1004. The complex side binds; PR589's bit supplier is unchanged.
Change: mutable-leaver all-K cells. In the no-triangle word, all eight all-K delivery cells (01±, 23±, 45±, 67±) are replaced by a 21-gate circuit found by layered CP-SAT. It has no helper and uses leaver sources (registers with no later reads) as mutable scratch, which are restored before their next use. Each cell changes the raw paid profile by exactly −30H1+6H2+6H3. y−y sources are S6-relabelled away from targets carrying port-entrance dirt. On top of that, the PR799 layers are re-applied through the signed builders (NP/p6n, promo, jx), along with six of the eight #869 triangle-hybrid instances (two use helpers the cells remove). Finally, a pinned frame re-optimisation is applied; it changes frame annotations only.
Construction drivers:
construction/leaver/(reproduce_leaver.py --id k8for the cells, thenreproduce_leaver_chain.pyfor the stacked chain, with every intermediate word pinned inCHAIN-PINS-k8.json). All verifier code is the reviewed set from research/gauge44-barch (#869). Data was re-admitted with the R=480 SPEC through discovery, freeze_spec and the strict replay.Controls: per-cell mutants M1–M6, rejected by both
audit_localand the native audit. The per-end layer controls pass 95/95 on the p6n, promo, jx and hybrid words. On the frame-re-optimised word they run with signed not-applicable pins (LEC v2: identity mutants proven by sha equality, substitute sites rejected by both checkers), and in addition, because that word's scalar program, starts and helper_final are identical to the hybrid word's. There, the three frame-builder pin controls, the 6-mutant frame receipt and the native frame-chain audit apply (seePROOF-NOTE-LEAVER.md).Independent review: SOUND. Separate reviewers covered the cells and leaver chain, the frame step, the hybrids on the new base, and the layer-end control variant. The committed tree was then checked byte-for-byte against the reviewed artifacts, and a clean leaver-chain run passed in check mode against the pins.
Verification
From a fresh clone of commit 779e80a, with no reused artifacts (Windows, CPython 3.11.11), running the README's clean-clone commands in order:
verify_manifest.py: PASS, 169 filesreproduce.py,reproduce_notri.py,reproduce_np.py,reproduce_p6n.py,reproduce_promo.py,reproduce_sw4.py,reproduce_frames.py,reproduce_jx.py,reproduce_leaver.py --id k8: all PASSreproduce_leaver_chain.py --id k8: an independent reviewer's clean run passed in check mode against CHAIN-PINS-k8 (final word db2c7cfb, all five LEC runs reject 95). A fresh-clone run of this stage, thenaudit_localandverify_global, will be posted as a comment when it finishes.audit_localPASS, thenverify_global.pyon the rebuilt locals: PASS_GAUGE44_STRICT_GLOBAL_REPLAY 0.001671387264390146Scope
Conditional on PR645's premises and PR589's bit-supplier assumptions. This is a finite exact construction; no unconditional theorem or Lean certification is claimed.
Credits
Prepared with Claude Code (Anthropic).