Repository navigation
Construction (no κ claim): PR2226 low anticipatory aliases on the T74 borrow words — 400 helpers, mass 5264, packing ceiling 0.0017179→0.0017480 - #2339
Merged
Mister-Meeseeks merged 1 commit intoOct 15, 2026
Conversation
Local construction plus exact packing ceilings; no kappa claim. Adds PR2226's 32 low (anticipatory) aliases, with their 64 initial compensation terms, and the 5 high aliases PR2269 omitted (rank-zero lenders found among retired X fields 12, 6, 31, 4, 1) to both record T74 pivot-566+554 borrow words of PR2269 (head b479fc5): 80 aliases, 400 helpers per call, local mass 5385 -> 5264, 44 cleanup buffers (was 76). The 16 remaining low helpers are lender-blocked at every handoff. Exact replay over all 624 dirty inputs in both orientations, PR2226 Gaussian products, PR2269's own auditor and 23 controls at build time; an independent stdlib checker (28 controls per word) recounts the words. The merged fixed-word packing ceiling rises from 0.0017179 to 0.0017480 (R=48). Model idle-refill prices span 0.0016871-0.0017255 (calibrated ~0.0017127); native lowering, an owner fill and the outer remain open. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Contributor
Author
|
Correction (author). The "≈ 0.0017259" estimate in this PR is wrong, and so are the model prices F/C/C8 (0.0017255 / 0.0017127 / 0.0017141). None of them is attainable on the PR2269 T74 template with unsplit helpers. The width-blind R = 48 cap here (0.0017480) is still a valid upper bound, but a loose one.
Details, fill, checks and certificate: #2387. #2360 (Jeremy Diviney) independently certifies b < 0.0016870. The local construction in this PR is unaffected; it should be read as a no-gain inventory for this template. |
This was referenced Oct 15, 2026
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 15, 2026
…ations Takes PR #2339's native-lowering obligation for the 64 anticipatory frame-zero compensation terms on each 80-alias T74 word. Each source lender supplies two initial corrections; preparing its monomial once, performing both reads and restoring the reference cuts 128 monomial applications to 64, keeps all 64 scalar ADDs and adds no positive-rank recursive children. Both providers and both orientations (forward and ordinary inverse-transpose) are certified on all 512 address columns, with exact Gaussian phases and arbitrary dirty inputs. The scalar bound is 572 real-component primitive passes per invocation and orientation; address gates (CNOT, CZ, Z4) are counted separately. A finite prefix inventory; no optimality claim, supplier or kappa change. Adds research/t74-anticipatory-native-prefix/ only. Submitted by @commdata2338 with substantial AI assistance (OpenAI Codex research and implementation; packaged with Claude Code). Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01X86sCSXdoDd61SDFfC1PKG
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Status: construction (local, verified), plus exact packing ceilings and model prices. No κ claim. This is not an admitted supplier, and the selected record is unchanged.
What is new
Every open record on the T74 borrow line uses only high borrowed-helper aliases from #2226. That includes #2269, #2281, #2288, #2302, #2309, #2312 and #2322; #2260 does the same on T8. None uses #2226's 32 low (anticipatory) aliases.
This PR builds those 32 low aliases, with their 64 initial compensation terms, on both record T74 pivot-566+554 words of #2269 (head
b479fc55). It also builds the 5 high aliases #2269 omitted. Their T8 lenders are blocked on T74 by a paid 5→4 drop. An exhaustive search found rank-zero lenders among the retired X fields 12, 6, 31, 4 and 1.{1:2351,2:501,3:414,4:129,5:42,8:8}{1:2303,2:527,3:386,4:125,5:37,8:8}{1:2339,2:509,3:418,4:125,5:42,8:8}{1:2287,2:535,3:386,4:125,5:37,8:8}That is −121 rank units per call: −96 from the low aliases and −25 from the 5 highs. Cleanup needs 44 private zero buffers, against 76 before.
The other 16 low helpers (blocks 632, 640, 648 and 656) are lender-blocked. At every handoff, exactly the 32 #2226 low lenders qualify, and every low alias saves the same 3 units.
Evidence
Build (
build_ext.py --controls). It uses #2226's replay and operators and #2269's emitter and auditor, with credit. Checks:audit_local.pypasses in both orientations;borrow_controlsmutations are rejected.Independent check (
check_ext.py). It is our own standard-library code with no PR or construction imports. It repeats the warp algebra, the anticipatory-term structure, the frame recount and the exact forward/dual replay. It has 28/28 negative controls per word. Positive controls: the canonical words and #2269's words.Exact fixed-word packing ceiling (
cap_ext.py). This uses the mergedresearch/complex-local-word-ceiling/ceiling.py. The cap is an upper bound on b for any hosting or idle refill of the fixed words. With R = 48 (T74's maximum child) it rises from 0.0017179 (#2269) to 0.0017480, which is +1.75%.#2269 realizes 98.74% of its own cap, and #2322 reports 98.66%. At the same fraction, the new words give b ≈ 0.0017259. That is an estimate, not a claim. It is ≈ +1.7% over the top open claim, #2322 (0.001697060).
Model prices (
price_ext.py, idle refill modelled, not built).The calibrated rules overshoot their out-of-sample controls by about 2·10⁻⁶.
What is NOT done (needed before any κ)
Reproduce
This takes about 25 s with the standard library. The expected last lines begin with
PASS_T74_LOW_ALIAS_RUN_ALL check=PASS price=PASS crosscheck=PASSandPASS_T74_LOW_ALIAS_PACKING_CAPS cap48_high43=0.001717935929 cap48_ext80=0.001747958372.The rebuild needs numpy:
run_all.py --build --numpy-site DIR. It reproduceswords/andwitness/byte for byte.Checks run locally:
test_research_*tests pass;Provenance and credit
0fdd7d82(priority revision 4), unchanged at submission.complex-new-helper-inventory, refined. No sprint coordination issue exists, so the claim was recorded locally.Prepared for Sagar Thakrar with substantial AI assistance (Claude Code, Anthropic): one subagent built the construction, others wrote the independent checker and pricing harness, and another reviewed it adversarially. The main session reran the checks and computed the caps. Apache-2.0.
🤖 Generated with Claude Code