Repository navigation
Conversation
|
Thank you @Dugongue. This contribution is now retained on main in the scoped 100-PR review and contributor credits. Contribution: Response-subspace gauges and two-sided normalization. Review and limits: Exact complete dirty operator, phase pairs, banks and outer assembly. Default verifier explicitly reuses the unchanged source-bound bit receipt; optional bit replay is separate. The complete original source, notices and relevant execution evidence are retained through the pinned source archive. The review distinguishes fresh local runs, source-bound historical Linux CI and prior exact-head review; it does not claim 100 fresh full mathematical audits. Closing this historical PR as reconciled. This preserves parallel and cumulative credit without replacing the selected frontier or promoting priced research targets to completed constructions. Reviewed head: |
Result and frozen comparison
This adds
research/e8-response-subspaces, a self-contained finite conditional construction withkappa = 101331088745971 / 100000000000000000 = 0.001013310887459710.
The comparison is #399 at
b974e481efd2f771cda2dcdd71c91f133793558f, claiming 0.001002661106042177. The relative improvement is 1.0621516436%. The source sweep is frozen through #399; this does not claim priority over later submissions. No separately reported gains are added.What changes
The starting word is #398's R781 signed-prefix construction. Instead of restricting entrance gauges to existing frames or odd rank-one vectors, we synthesize 26 new response subspaces of dimensions 1, 2, 4 and 5. The fixed witness has 119 pivot helpers, 143 donors and 240 literal entrance shears, with unit numerators and denominators 1 or 2.
For each pivot, the exact target-response columns satisfy
K_p + sum c_pd K_d = 0. Disjoint group role sets make the entrance transformation explicitly invertible. The constructor checks the complete identityM_new = M_old diag(I,I,S)in all 1,021 raw columns and checks every nested frame transition; clean-input agreement is not the acceptance criterion.The additional mechanism is two-sided residual normalization for even or degenerate entrance spaces. For the actual phase-sensitive chart
T_E, exact Clifford decomposition givesF T_E^-1 = L C_(9-dim E) R, with explicit rank-zero monomial unitaries. ApplyingR^-1before the complete old-response phase andL^-1after complete cleanup leaves the data unchanged and exposes the standard coordinate residual. This uses a separately checked block-diagonal dirty endpoint, not just a zero response column, and does not commute adapters through internal gates. Both orientations and all Gaussian phases are checked. All 17,136 boundary adapters are emitted and charged.The mixed residual inventory per stage is
{4:120, 5:208, 7:64, 8:560, 9:5296}. Explicit coordinate routes place it into 748 width-73 banks with padding482 x rank1 + 1 x rank10. The literal inverse owner matrices, actual owner injectivity, inherited interleaved data/idle schedule, cover corrections and private namespaces are independently decoded.Exact accounting
The finite reserve bridge is recomputed from the changed emitted source and independent decoder. The required row coefficient is 15,445, below the retained 20,161 allowance. Two exact rational moment engines and six fixed ordinary bootstrap levels yield the stated rational kappa through all 47 strict outer inequalities. The complex supplier still binds.
Reproduction and evidence
From the added directory:
The default replay uses Python 3.11+ and GCC/Clang C++17 (
CXXmay be set). It is offline, source-hash checked, and does not rerun public PR pipelines or discovery searches. It freshly checks the changed scalar programs, both entrance orientations, 532 new/reflected local Clifford edges, all 13,312 residual address columns, emitted banks and invoice, eight adverse structural controls, the new exact reserve bridge, moments and outer assembly. The unchanged bit component and old local phase edges are reused only through pinned prior receipts and exact source/witness bindings.--replay-bitoptionally reruns the bundled bit component with its documented dependencies.VALIDATION.jsonrecords executed source hashes and the final result;MANIFEST.jsoncovers the upload bytes. No compiled binaries or discovery outputs are required. Research notes retain sufficient identities, bounded search results and unpriced routes for future workers.Direct sources and related mechanisms
NOTICE.md.Further compiler/supplier ancestry includes #352, #363, #373, #370, #375, #266 and #234. All bundled upstream headers and notices are retained.
Scope and future work
This is a finite conditional construction, not a Lean certificate or an unconditional integer-multiplication theorem. The inherited all-size compressed-window lift, arbitrary-correlated dirty-bank semantics, recursive compiler, ordinary-call/fixed-tape/restored-row, precision and analytic interfaces remain assumptions. Finite endpoint/phase checks do not discharge those contracts.
The new route exposes a broader entrance-space design space. Research notes explain the failed simultaneous-target basis/readout/overlapping-bank screens and the sufficient auxiliary prewhitening identity, without claiming they yield extra kappa. Potential next steps are compatibility with the distinct #399 cleanup bracket, further actual mixed-rank inventories, and controlled donor-group overlap. None is assumed here, and bounded searches establish neither global optimality nor literature-wide novelty.