Repository navigation
Conversation
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.
For every positive integer m, the same ordered prefix of the fixed role-1256 graph has the largest absolute real or imaginary physical component. The sharp bound is
Terminal row 156140 attains this bound after its eleventh donor 103886, in chart 127, at real output address zero. This answers the active-tensor question in PR #7725. Its one-tile result remains prior work. No new kappa or complete root-width reduction follows. The graph, paid routes and scalar factors are unchanged.
Read the proof, exact receipt, checker, source pins and credit. Each chart transition is repeated on m active factors, while scalar coefficients occur once. Every real and imaginary entrance component is independently in [-1,1] on the full 9m-axis field. Inputs need not be separable tensors.
The proof derives the exact transition gain
2^ceil(m*d/2). For rank nine and two repetitions it is 512, not the squared one-tile gain 1024. The checker groups signed prefix coefficients by transition rank, then proves polynomial dominance for both parities. All coefficients after translation byt=1+sare nonnegative. This covers all requiredt>=1, hence all m, without a finite repetition sweep.The attaining-input formula chooses each component from the signs of the exact tensor adjoint row. The finite histogram checks corroborate that formula without materializing exponential address arrays. A reduced winning coefficient is rejected in both parity certificates. The wrong multiplicative gain and odd-rank floor are also disproved.
Python 3.12, standard library only:
Both normal and optimized commands print:
Registered normal/optimized replay, commit-byte/source-history/mode checks, export verification and read-only sealed serial replay pass. The sealed replay uses no Git and leaves all hashes and modes unchanged. Full predecessor suites, selected cold replay, Lean and Docker were not run. Hosted CI did not certify this package. The plan job failed in the shared
test_current_ci_section_matches_selected_record: the base guide names frontier6030 while the selected record requiresmake frontier7000-verify. The log reports 760 tests, one failure and 24 skipped; package replay was skipped. This package changes no shared CI file. Local replay remains the scientific evidence.Nick Petalas supplied the one-tile theorem and certificate in the source proof. Ali Romman's PR #7709 supplied the normalized prefix method and question. Clear1nsight's PR #7704 supplied the graph and physical contract; SYLforge supplied the word. The preimage-frame source credits icekylinx and OpenAI assistance. Native and framework notices preserve all predecessor credit.
The graph hash is
8e7b755bd2d2d387bc3d3adfe48100985adf74775ca5acbb143170a3d16b5ccf. The source scientific commit isd88ecbf3dffa8a2386c90766829b769dd8068a1f, published at72986db329dc83b77b9e69b25396c3da6d1a94bd. This PR starts from canonical maine54523517d0f03e58352e647c403a5af3e525a57. All 23 retained files are unchanged and byte-pinned. The source graph reader, backward expansion and native interpreter are shared dependencies; no pending-source ancestry is asserted.The result covers exact row accumulators under the stated independent-input contract. Caller correlations, numerator temporaries, paid-child interiors, rounding and complete root, stock and tape costs remain open. All five framework interfaces remain conditional. This is source-aware author checking, not blind, independent human or formal-kernel acceptance. The selected frontier is unchanged.
Prepared by Ali Romman with substantial OpenAI Codex assistance in research, implementation, verification and writing. Apache-2.0. Canonical claim and handoff.