Repository navigation
Scoped negative result: no further helper-donor kernels or exact read re-timings on the #1297/#1305/#1324 words (no new kappa) - #1337
Conversation
CrocSwap#1324 words (no new kappa) Exhaustive census of the CrocSwap#1274/CrocSwap#1297 two-shock helper-donor kernel family (both restoration rules) and of exact early-read re-timings over all 306 early-read helper pivots of the local words shared by CrocSwap#1297, CrocSwap#1305 and CrocSwap#1324, priced with the CrocSwap#1186 exact frame harness: no gain in 61 + 292 relation candidates and 803 re-timings per word. A positive control reproduces CrocSwap#1297's 5+5 hooks for pivots 555/567 at the realized -11707. CrocSwap#1305's idle selection equals the exact optimum of its admitted donor-star class in all 3,687 groups (superseded by CrocSwap#1324's larger swap class). verify.py (standard library) replays the censuses exactly, binds every priced record to a census match, recounts the evidence and rejects four failure controls; regenerate.py reproduces all 16 evidence files byte-for-byte with the toolkit.
|
100-PR batch review at This remains open after scoped triage. Next review step: Finite census replay and controls pass, but the claim of exactly moment-optimal frames inherits PR1186 rounded integer costs. Supply a rigorous rounding/separation bound or narrow the optimality claim to that integer objective; the submitted verifier does not regenerate all priced optimization evidence. This is a specific continuation point, not a rejection or a request to redo already recorded checks. Completed local evidence is retained separately from outstanding whole-head obligations. Batch review, attribution and evidence. Thank you for the contribution. |
…rding Answers the CrocSwap#1337 review continuation point (supply a rigorous rounding/separation bound or narrow the optimality claim to the integer objective; the verifier does not regenerate all priced evidence): - price.py and retime.py now price with PR CrocSwap#1186 revision 2's Pricer(interval=True) (bounds.py): every candidate records its realized true delta, and a rigorous bound on any true gain, rounded up to 1e-6 units. All 1,438 neutral candidates have true delta exactly 0 and possible gain at most 1e-6 units (exact bounds about 1e-11). Every verdict, delta and profile equals revision 1's evidence. The positive control is -11707 surrogate units, -11707.88 true units, and passes audit_local. - verify.py checks the bounds against RESULT.json (true_moment_bound, tallies.intervals) and adds a forged-bound control; its docstring and VERIFY.json state that it is a recount, while regenerate.py reruns every price (toolkit pinned to CrocSwap#1186 3855fd4 by its MANIFEST; two consecutive regenerations are byte-identical to evidence/). - README and RESULT.json: "exactly optimal" narrowed to surrogate-optimal plus the stated bound; the withdrawal of CrocSwap#1305/CrocSwap#1324 and the later pivot-566/554 kernels on these words are recorded.
|
Revision 2 is pushed ( Bound. Every census and re-timing candidate is re-priced with #1186 revision 2's true-moment interval certificate
Results at b = 0.001679979627113687, both words:
One unit is 2^-40 of the per-call moment. The exact rational bounds are about 1e-11 and are stored rounded up to the 1e-6 Wording. "Exactly optimal" now reads "surrogate-optimal (integer certificate) with true gains at b bounded by 1e-6 Coverage.
Registered check: Prepared with substantial AI assistance (Claude Code). |
- regenerate.py pins PR CrocSwap#1186 revision 3 (head c37dfb0, MANIFEST 658331a6); the pricing code is revision 2's. - deletion.py uses the toolkit's compat.deadline/Timeout instead of the harness's private SIGALRM handler, which revision 3 removed. - verify.py and regenerate.py refuse to run under -O (verify.py's guard was an assert, which -O strips; regenerate.py had none). - A fresh regeneration with revision 3 reproduces all 16 evidence files byte for byte; RESULT.json changes only in its toolkit pin.
Summary
Scoped negative result, no new κ. Revision 2 (
9e944899) adds a rigorous true-moment bound and narrows the optimality wording, in answer to the review continuation point; details are below. Revision 3 (c9da5f27) follows #1186's portable revision 3 (c37dfb07), soregenerate.pykeeps working if #1186 merges as is; the evidence is unchanged.The census runs on #1297's two local words. #1305, #1324 and #1319's T74 exact fill use the same Git blobs. #1305 and #1324 were later withdrawn by their author, because their idle overlays move axes across Z4 families. Kernels in richer families were later found on these words: #1625 (pivot 566) and #1672 (pivot 554). Both lie outside the two families searched here.
On those words, two kernel families give no further gain over all 306 helper pivots read before their first B write, where #1297 searched four:
Every neutral candidate is surrogate-optimal with a certificate, and none can lower the per-call moment at b by more than 1e-6 cost units (rigorous). #1305's idle overlay is the exact optimum of the donor-star class its own verifier admits; that is now a statement about a withdrawn class.
Package:
research/frontier1305-kernel-census/. Claim and results: discussion #1314.Starting point, validated locally (before the withdrawals)
43c19465: a fresh checkout ranverify.py, including fresh native replays of both words and strict admission. Result:PASS_GLOBAL_MIXED_X54_IDLE_EXCHANGES_NATIVE_AND_STRICT_ADMISSION 0.001677380107853623(156 s, no Boost).a96a5d95: the same run gives... 0.001677162029073474(127 s).kappa.kappa(H, 37)pricer reproduces both κ values, and Conditional kappa 0.001676854978651125: four composed helper-donor cold kernels #1297's, exactly from their profiles.Results (identical on both words)
Pricing uses #1186's harness, pinned at revision 3 (
c37dfb07; its pricing code is revision 2's,3855fd41):audit_localon every negative delta;True-moment bound (revision 2): this covers all 1,438 neutral candidates, both words:
Infeasible and inexact rows involve no cost. Every verdict, delta and profile equals revision 1's.
Positive control: on Conditional kappa 0.001676854978651125: four composed helper-donor cold kernels #1297's input word, the census reproduces its 5+5 hooks for pivots 555/567, including the committed donors 620/628. Each is priced at −11,707 surrogate units (H1 −3, H3 +1), the realized kernel worth 2.616e-7 κ. Its true value is −11,707.88 units, a certified gain, and
audit_localpasses all ten.Robustness: all base-word verdicts and profiles are identical at Conditional κ = 0.001677380107853623: idle rank-48 axis reassignments with simultaneous swaps toward rank 51 on #1305's four cold kernels #1324's endpoint weights.
Idle: exact backtracking over every assignment in all 3,687 (replica, port) groups gives the optimum, and it equals Conditional κ = 0.001677162029073474: four helper-donor cold kernels (pivots 531, 543, 555, 567) composed with multi-donor idle exchanges toward rank 51 #1305's selection. No size-4 group admits a three-receiver donor in that class. Conditional κ = 0.001677380107853623: idle rank-48 axis reassignments with simultaneous swaps toward rank 51 on #1305's four cold kernels #1324's simultaneous swaps are the larger class that does reach (51,51,51,39).
Deletion screen: prices the word with a pivot's early reads deleted and no compensation. The largest prices are pivots 439/444 (−67,944), 438/440 (−62,316) and ten pivots at −51,648 (≈ +1.16e-6 κ). This is reported as a screen, not a bound: on the control word the uncompensated deletion of 555/567 is frame-infeasible, while the kernels are feasible and gain.
Evidence and reproduction
python3 -B research/frontier1305-kernel-census/verify.py: standard library, ~30 s. It checks the input pins, replays all five censuses exactly in rational arithmetic, binds every priced record to exactly one census match, and recounts all evidence againstRESULT.json. It also checks every candidate's true-moment bound againstRESULT.jsonand runs the positive control. It rejects five failure controls: a one-byte input change, a changed early-read coefficient, a forged negative price, a priced edit absent from the census, and a forged bound. It is a recount: it does not rerun the frame optimization or the interval certificates. Registered:PASS_REGISTERED_RESEARCH_PACKAGE ... outcome=negative-resultunder Python 3.12.13.tests/test_research_*.pypasses (20 tests, 1 skipped).regenerate.py --toolkit <PR #1186 at c37dfb07>/research/exact-frame-toolkit --out NEWreruns pricing, re-timing and deletion; with--idle-runit also reruns the idle check. It first checks the toolkit's pinnedMANIFEST.jsonand every file that manifest lists. Two consecutive revision-2 runs reproduced all 15 toolkit-dependent evidence files byte for byte, in about 9 minutes each on 12 workers. Against revision 1's evidence, 8 files are byte-identical and the other 7 differ only by the added bound fields.regenerate.pynow pins Tooling: exact frame solver and delivery-rewrite search for gauge44/k8 local words (no new κ) #1186 revision 3'sMANIFEST.json.deletion.pyused the harness's private SIGALRM handler, which revision 3 replaced withcompat.deadline; it now uses the toolkit'scompat.deadlineandTimeout.verify.pyandregenerate.pynow refuse to run under-O; before,verify.py's guard was itself anassert, which-Ostrips, andregenerate.pyhad none. A fresh regeneration with revision 3, including the idle check, reproduced all 16 evidence files byte for byte (about 8 minutes on 12 workers).RESULT.jsonchanges only in its toolkit pin.Limitations
verify_idle_overlay.pyclass.verify.pydoes not.Open next question
Do three-shock or window-donor relations exist for the high-screen pivots, 438/440 and the ten −51,648 pivots? #1625 and #1672 have since found kernels in such richer families, at pivots 566 and 554.
census.py's dictionary to windowsx += c·q … x −= c·qon any register x, closing before the first write. Solve sparse dyadic combinations of at most three terms, then price withprice.py.Credit
search_relations.py).Vendored inputs are unmodified Apache-2.0 copies; see
NOTICE.mdandinputs/PINS.json.Prepared by Marius-Paul Dumitrean with substantial AI assistance (Anthropic Claude, via Claude Code). Apache-2.0.
Workflow note (optional feedback): this used the
selected-packingcard with the scope changed to local-word kernels on the highest open claim. The main friction was that the frontier moved during the session: #1324 landed with the same words, which was easy to check with blob ids. One suggestion: the overlap helper could list open PRs that share Git blobs with a package's inputs.