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.
A fixed 3,397-location, fifteen-tape program emits every bit of a canonical padded-rotation row from four borrowed descriptors. It constructs each wire address on tape, preserves the inputs, clears all private bodies and temporary guards, and returns every head. For
N=2^h, its complete bounds are 1280N(h+4) transitions and N+20(h+4) additional historical cells. This closes the local owned-row interface left open by PR #7740. No new kappa or complete CRT caller is claimed.Read the proof and full bill, fixed graph emitter, receipt, two instruction paths, verifier, source pins and credits.
The graph embeds all 3,237 instructions of PR #7735, with only control-target relocation and halt-to-return jumps. A physical height countdown creates the address field. A binary carry scan supplies
x=0,...,N-1; the first carry into its high padded bit ends the row. Every output write, bit retirement, address operation and final head return is charged. The same private windows are reused across all calls; clearing does not erase historical cost.Python 3.12, standard library only:
Both registered commands print:
Normal and optimized registered replay, syntax/indentation, committed bytes/source history/modes, export and sealed read-only Git-free serial replay pass. 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. The all-height claim follows from the written address/owner invariant and loop counts. The exact transition counts are service counts, not wall-clock timings or a matched full-caller speedup.Credit Ali Romman for the retained linear point service, Jerry Chen for the builder, tape ABI and cleanup, Nick Petalas for the endpoint formulas, and Cinna Davis for the canonical compiler. Their source bytes and notices remain intact. The new controller uses the source loader and Tape operations directly; it does not patch their functions or alter the source fourteen-owner CPU.
The three-rectangle arithmetic stream has a sharper output-linear bound. Its direct tape lowering remains open. JoyboyBrian's PR #5092 produces all layers and joins a key service; that different workload is not a matched baseline for this row service.
The caller supplies encoded descriptors, disjoint blank windows and framing. The returned row remains owned. Actual CRT descriptor production, encoding conversion, transport, payload consumption and output disposal remain open caller costs. Historical full suites, selected cold replay, Lean and Docker were not run. All five framework assumptions and the selected frontier remain unchanged.
Base: canonical main
e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Consumed point head:460eb0c026649b28ab3b00f45de136599d0570fa; its exact mathematical and hardware dependencies are retained in the source pins. Row-theorem context:913d61fd9bd5d3d65a11c04f1baf50fc24ceb858. No unmerged source ancestry is asserted. Prepared by Ali Romman with substantial OpenAI Codex assistance in research, implementation, verification and writing. The two instruction paths share the graph and fixture boundary; no independent human or formal-kernel acceptance is claimed. Apache-2.0. Canonical claim.