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.
This construction supplies all 2,270 local rounded coefficient tables for the exact native word in PR #7660. It binds all 143,376 ADD and SCALE occurrences to constructed tables and derives their complete local scalar cost sum. This closes the uninstantiated coefficient class left by the retained compilers. No new kappa or complete recursive caller admission is claimed.
Read the proof, ADD catalogue, SCALE catalogue, cost receipt, verifier, candidate pins and retained input closure. The scoped claim replies to the current source review request.
The candidate head is
d12b854d4825e9edfa3a3466909e1abf3525e929; the decoded word SHA256 isf0753b6614b2d351723dddc307a39b6ecd748a43008c6fdb9335b01feeec9669. It contains 139,227 ADD occurrences with 2,196 coefficients, and 4,149 SCALE occurrences with 74 coefficients. There is no COPY. The unchanged PR #6990 compact ADD compiler and PR #6988 SCALE compiler construct 33,556,789 literal rows and 14,593,712 states before sharing.Each full local key contains its clock and raw event. Every coefficient group maps its actual keys to its constructed immutable table. Full token and graph hashes, graph legality and literal executions are recorded per coefficient. A separate reverse opcode census agrees with the forward chart and lifetime scan. Construction proceeds one group at a time; this is a finite local registry certificate, not a resident production dispatcher.
There are 6,736 literal signed/range cases: 2,715 successes and 4,021 correct rejections. Every ADD coefficient receives a signed cancellation case, late whole-field overflow and width-one endpoints with dirty work reuse. The SCALE cases cover signed inputs and endpoints. Controls reject wrong coefficient tables, nonunit moves and wrong event keys. The retained universal primitive proofs supply the all-size result; finite fixtures corroborate the current instantiations.
The retained ADD proof and retained SCALE proof give the following positive bound. If S and R bound every scalar field's numeric extent and real component count, and each call meets the retained shape, range and physical premises, the scalar sequence costs at most
748695040(S+1)+4241749760R+7 sum_i A_i+16 sum_i Q_iphysical/control units. A_i is old dirty work length and Q_i is borrowed context count. A reverse per-event sum agrees with weighted construction receipts. Historical backing and fixed catalogue setup remain separate charges. No conversion to the old ordinary tariff is assumed.Use Python 3.12 and the standard library:
Expected output includes:
All four registered isolated replays passed: ADD and SCALE under normal and optimized Python. Committed bytes, source ancestry and the official export passed. Read-only, Git-free optimized replay of both exported catalogues passed, with source hashes and modes unchanged. 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 full selected replay was not run.Limits: the fixtures invoke the unchanged primitive service, not the complete recursive Controller or native program. Canonical inputs, final signed ranges, nonaliasing, origin heads, contiguous old work and blank historical tails remain explicit premises. Recursive delivery, native MOVEs, owned erasure, caller operations, common physical pricing, complete private backing and rounded outer recovery remain open. All five framework assumptions remain:
native_all_columns,owned_erasure,compiler,precision_tapeandanalytic_recovery. The selected frontier is unchanged.Base:
e54523517d0f03e58352e647c403a5af3e525a57. @CubeJerry supplied both unchanged compilers, lifecycle execution, physical fixtures and universal primitive proofs. @Clear1nsight supplied the candidate and review request; the retained source notice preserves the native lineage. PR #7268 is Nick Petalas's related residue-graph work; it is not imported. PR #7662 checks the separate terminal half-ADD implication. Ali Romman directed the new catalogue, coverage and cost aggregation with substantial OpenAI Codex assistance. New work is Apache-2.0; predecessor notices and licenses are retained.