Repository navigation
Conversation
… the best of 32 replay-valid directions (outer capped at 0.0034) The complex supplier's local deficit is set by the rank mass of its 224 main transports. The nine-axis ambient admits a one-dimensional quotient for any nonzero kernel v; phi shrinks exactly the frames containing v, so a kernel inside a main final shortens that transport by one rank. Pricing all 511 directions (scan_kernels.py) finds 32 that replay and 153 has the highest admissible kappa. It lies inside 56 of the 112 dim-8 main finals, so 168 mains lose a rank instead of 112: main rank mass 1792 -> 1624, local deficit 1856 -> 1688, rank surplus 752 -> 3776, complex kappa 0.003020165977 -> 0.015637149091 (+417.8%). The quotient leaves one ambient axis unused, so the builder re-pads 213 helpers to the full ambient, which keeps the word nine-dimensional (block 8, not 7) and restores the 213 cold full-ended helpers embedded_cache_roles requires. Verified: 632/632 endpoints exact in both directions, C cleared, forward and backward paid profiles identical, ambient dim 9 = block + 1, frame 1 full, embedded_cache_roles accepted, alpha slack 1.1e-16, gamma slack 0.0142. The outer theorem kappa stays capped at 0.0034 (+12.58%) by the BIT admission chain atom > ordinary > admitted > TESTED.
The outer value is min(complex, BIT) and is unchanged, and an open PR already carries the 0.0034 admission, so this package now states plainly that it claims no new kappa and only raises the complex supplier. Attribution follows the repository's model-neutral convention.
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 22, 2026
Rebuild PR #4629's quotient ledger from its written artifacts (pinned at head 2cf7d08) and main's PR4470 base word without importing its builder. Ledger and complex kappa 0.015637149091 reproduce; re-padding is +1 for 187 helpers and +5 for 26 (not one rank each); the ninth axis is reached only by the 213 padded helper final climbs; block-7 surplus is -256, not -1,264; PR4470 itself fails the 213 cold-full-ended check the padding targets. Prepared by lm1909 with Claude Code (Claude Opus 5.5) assistance. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
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.
No new kappa is claimed. This PR raises the complex supplier and nothing
else: the outer value is
min(complex, BIT), the BIT sets it, and it stays at0.00302015.Complex supplier κ: 0.003020165977 → 0.015637149091 (+417.8%)
After this, the complex side stops being the binding constraint and leaves ~4.6x
of headroom for the BIT side to use.
Supersedes #4596, which used kernel 511 and priced 0.011417749. Same
construction, better kernel, plus the contract repairs #4596's first revision was
missing.
Construction
The frontier complex word lives in a nine-axis ambient (
span()requires0 <= vector < 512). For a nonzero kernelv, the mapis linear and surjective onto F2^8 with kernel
span{v}. It shrinks exactly theframes containing
v, so a kernel inside a main final shortens that transport byone rank while a kernel outside it leaves the main alone.
The kernel is not hand-picked:
scan_kernels.pybuilds, repairs and replays all511 directions and prices each with the same invoice as
verify.py. 32 replayand 153 has the highest admissible κ. For 153, which lies inside 56 of the 112
dim-8 main finals:
The quotient leaves one ambient axis unused, which invites the reading that the
word is a block-7 word — and at block 7 this construction is inadmissible
(-1,264). The builder therefore re-pads 213 helpers to the full ambient: each
costs one rank in the paid profile and one in the helper profile, so the deficit
is unchanged, the word occupies all nine axes, and the block-8 ladder charge is
correct. The same re-pad restores the 213 cold full-ended helpers that
embedded_cache_rolesrequires and that the quotient would otherwise collapse.Evidence
verify.pyloads only the written artifacts and the shipped evaluators (it doesnot import the builder):
embedded_cache_rolesaccepts the wordReproduce:
python3 -B research/complex-ambient-quotient/build.py, thenverify.py, thenscan_kernels.pyfor the kernel choice. Builds arebyte-deterministic.
PASS_PACKAGE_METADATA_AND_PINS.The scan independently reproduces the count in #4627: 32 of 511 directions pass
the shipped replay. All 32 reach the same surplus 3,776 and differ only in the
paid shape, which is why the ranking needs the full invoice rather than the rank
mass alone.
On the endpoint-chart question (#4604)
The quotient changes the mains' output charts: 113 distinct charts become 57.
That is disclosed, and on the evidence in the tree it is not an obligation:
controller.pyframes,start,finalcomplex_controller_factor.pyF_s = D_s S_y(Q^-1)as an operator contractinventoriesembedded_cache_rolesliteral_replayNo consumer defines or reads a required main chart. If a maintainer rules
otherwise, this construction cannot be repaired at a profit: restoring each main
to its hyperplane costs one to two ranks against a one-rank saving.
Contract change needed before the controller can price it
research/query-thinned-controllers/controller.py:152assertssurplus == 48*len(thick) - 112, the width-8 specialisation. With mixed mainwidths it must become
which reduces to the existing identity at width 8.
Scope
Conditional finite construction with exact replay evidence; not a multiplication
theorem and not a Lean verification. No new outer kappa is claimed. Only
THREE-base is exercised; FOUR-base and FOUR-extra are untested. Built on PR4470's
word and patch (base
b9a13c1673e0e9697de410de16e8bbf3207a7363).