Repository navigation
Uniform lazy tensor routing for the actual lender333 boundary (no new kappa) - #5484
Merged
Mister-Meeseeks merged 2 commits intoOct 25, 2026
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.
The actual lender333 lazy signed-affine boundary now has a uniform all-width bounded-word routing algorithm with O(N) address work and no N-entry routing table, N=512^f. It preserves all four arbitrary caller arrays and saves exactly 2N real writes against the strong materialized comparator. Principal route lanes fall from 36 to 29 and leader comparisons from 34N to 27N. The common paid child and L suffix remain unchanged.
The exact source pins, all-width proof, executable controls and open next questions are in
research/native-lazy-tensor-boundary/. This closes a named source-bound implementation handoff; it does not admit a supplier or change selected κ.Validation: All512 source columns reconstructed; actual dense four-array width1 boundary; independent out-of-place oracle; exhaustive small tensor cycles through width4; eight actual width2 columns; exact route counts; phase/translation/composition/domain controls. Registered Python3.12 normal/optimized checks pass, as do actual on-disk source/receipt/scientific-code rejection controls. Final committed-byte/source-history preflight and official export integrity checks pass. Both normal and optimized direct science pass from a read-only Git-free export with PATH empty; payload hashes are unchanged. Separate AI peer review found no blocking issue.
Limits: Complete setup is fixed and charged, but no actual primitive tariff or total-time crossover is claimed. The exact scalar NEG invoice describes the stated register/sign-reuse RAM schedule, not eagerly evaluated Python operations. Native ownership installation in selected5413, rounded child precision, fixed tapes and supplier/outer admission remain open. No recursive rank, owner-width or kappa change; source f=1 native recipe proof retained as premise.
Prepared by JoyboyBrian with substantial OpenAI Codex assistance; Apache-2.0. All predecessor credit is retained in README/PROOF and exact copied sources. Independent human, formal-kernel, hosted-CI and full selected-supplier verification are unclaimed. Canonical investigation: #5474.