Repository navigation
Copied retained centers and two-stage assembly for conditional kappa = 3.84569e-5 - #36
Merged
Mister-Meeseeks merged 5 commits intoOct 8, 2026
Conversation
This was referenced Oct 8, 2026
This was referenced Oct 8, 2026
This was referenced Oct 8, 2026
This was referenced Oct 8, 2026
Merged
This was referenced Oct 9, 2026
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.
This extends PR #32 at
0ef3aeb61f55cc0b321ce6a0ef00acee25cefe52with one new commit, retaining the #10 → #18 → #24 → #32 ancestry. It also adopts the attributed two-stage and corner contributions from Paureel and PR #29/#31/#33, alongside the retained PR #21, PR #23 and RaD interfaces described below.Under the retained multiplication framework and those analytic/tape interfaces,
Construction
The copied retained-center schedule supplies each scatter from a transformed copy while the original role proceeds directly to cleanup. In both invocation orientations, the charged ranks change from
(r,h)to(r,h-r), preserving scalar actions and auxiliary endpoints. This reduces the two-stage rank budget fromWm-N+2LtoWm-N+L. The rank-rcopy and the separate rank-one endpoint correction remain fully charged.The bit network uses
(25,23), retaining the verified producers, positive labels and compatible carrier assignment. The PR #31 corner method, parameterized in PR #33, gives the data profile11 singletons; 21,15,481. Its 47 rational pivots and 315 weight-independent zero-minor certificates support the contiguous blocks in one controlled basis.The complex network uses
(28,28)with mixed dyadic centers and disjoint-center count 19. The copied-center schedule transfers to forward/inverse phase residuals. The two-stage endpoint uses a paid inverse phase on a copy and fixed sign corrections, with the translated auxiliary endpoints preserved.The strict component savings are
384599/10000000000(bit) and717/10000000(complex). Their certified moment gaps exceed2.10899506e-12and8.52696172e-9, respectively.The assembly adapts Zhihao Chen (jacklightChen)'s PR #23 composition of RaD (hipotures)'s completed-child semantic precision, arbitrary-coordinate routing, phase-cell Gaussian inverse and bulk resampling. Translated complex endpoints follow Zhihao Chen's PR #21. The actual scalar gate charge includes the copied centers and gives
C1=1; nested adapters pay the product of both row stocks, bounded byp^2000. All 47 strict constraints and seven assembly margins hold, with final absorption gap greater than4.0746e-11.Contribution sources and prior PRs
My preceding contributions under icekylinx form the direct implementation lineage:
P=34p.1.2299998e-7(25,23,57)basis.1.884586e-6(32,30,40)basis, general nondegenerate binary phase residuals and updated precision guard.5.98615e-6I+Jmiddle-axis profiles certified by bounded-minor CRT, mixed low-loss complex centers, complete data-front batching and instantiation of the attributed semantic/bulk assembly.1.2523415e-5(25,23)/(28,28)networks and instantiation of the attributed semantic/bulk assembly.3.84569e-5The adopted contributions are distinct from these new finite refinements:
(25,23).Baker–Harman–Pintz supplies the prime-interval theorem used by the adopted packing argument. Historical AI-assistance disclosures are preserved. The table records construction dependencies and contribution scope; independently published exponent savings are not added together.
Proof and attribution
notes/copied-centers-note.tex: selected construction and assembly, supplied as LaTeX source.scripts/copied_centers_producer.py: new producer and exact corner reconstruction.certificates/copied-centers-network.json: recursive moments, rank budgets, semantic precision, row accounting and assembly.references/copied-centers/andreferences/semantic-bulk/: necessary pinned proof sources, original notices and licenses.The result remains conditional on the retained analytic/tape interfaces, constructive setup and eventual thresholds. Finite checks do not formally verify the complete theorem. The inherited
patches/batched-23.patchremains the #10 baseline; this extension is presented in its standalone proof.The new copied-center schedule, complex transfer and selected composition are contributed by icekylinx, with substantial OpenAI GPT-6 Astra and Codex assistance. Original attribution is retained, including Paureel at
c82d09eb4781b68435e3fa3eb6beea72fa900fab, PR #29 at9d963275075fa98f1da821e27757b238dafd6b3c, the PR #31 method at02f68f95369c39955c5ffcfddbd75cd83e26b305, and PR #33 ata499a345c040aa15b68e984a0904eadc485c7a7e. The retained PR #21/#23 and RaD sources remain pinned inSOURCES.json. The repository retains Apache-2.0; imported RaD sources retain CC0. Exploratory variants, duplicate snapshots and large raw graph dumps are excluded.Validation
Unchanged previous-round producer and regression checks were not rerun.