Repository navigation
Recursive interface: four-way port borrowing reduces 56-factor echo from 1568 to 1088 calls - #1164
Merged
Conversation
Contributor
|
100-PR batch review at Merged to Reviewed scope: Four-way exact port borrowing reduces 56-factor leaf calls from 1568 to 1088, using one additional dirty array and charging every inverse. The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions. Batch review, attribution and evidence. Thank you for the contribution. |
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 exact additive port-borrowing allocator in PR1057 uses three dirty arrays
with binary/ternary echoes. This recursive-interface construction admits the
known four-way echo of PR758 while using a fixed pool of four dirty arrays at
every depth. For the same 56 ordered factors, the complete unit-price optimum
falls from1568 to1088 leaf calls, with every inverse and restoration paid.
The package includes the general restoration induction, precise restricted
optimizer, all-input noncommutative replay, a sufficient integer precision bound,
and complete conditional backend invoices. At a common 119-bit width, the
example uses 30464 versus 43904 primitive commands and 1428 versus 1190 data bits.
It is a space/call tradeoff, not a runtime benchmark or arbitrary-circuit optimum.
Optimized Python replay checks 396550 planner candidates,1099 complete small
trees/173690 signed leaf events, both56-factor orientations, dense noncommuting
matrices, nine semantic controls and four subprocess source/receipt mutations.
One-command reproduction and exact source pins are in README.md/SOURCES.json.
This combines credited prior mechanisms; it does not claim priority for
higher-arity echoes or constant-register algebra. PR758, PR1057 and their
predecessors retain explicit credit and source notices. Rounded borrowing
covered by fresh PR1135 is outside this exact additive contract. No new kappa,
native replay, fixed-tape compiler or supplier admission is claimed. The
selected PR1094 frontier and upstream files are untouched. Prepared for @woklerx
with substantial OpenAI Codex assistance; Apache-2.0.