Repository navigation
research: audit minimal joint-output connector charge - #3897
Draft
1337isnot1337 wants to merge 1 commit into
Draft
1337isnot1337 wants to merge 1 commit into
1337isnot1337 wants to merge 1 commit into
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.
Minimal joint-output connector charge
Summary
Refines the
connector-alphabet-changecard to the smallest nonzero instanceof one output-side operation:
With one source, one arbitrarily dirty connector and two arbitrarily dirty
targets,
J_ik, B, J_ik, Bcomputes both requested outputs and restores theconnector for arbitrary fixed
F_2-linear maps. A dimension-independentadditivity proof accompanies an exhaustive check of all 1,048,576 combinations
of 2x2 maps and data states, plus three failure controls.
The complete bill charges both output-map evaluations and both targets on
every
J_ik. IfDis one root dispatch andphiis the extra joint-routingand fusion overhead, the original schedule costs
2c_B+2c_i+2c_k+6D, while the extended schedule costs2c_B+2c_i+2c_k+4D+2phi. The operation improves the completed bill exactlywhen
phi<D; leaf map work is unchanged. The package does not claim a physicalone-record implementation or supplier benefit.
Verification
Results:
PASS_PACKAGE_METADATA_AND_PINS;PASS_JOINT_OUTPUT_CONNECTOR_MINIMAL cases=1048576 controls=3 records=6_to_4 leaves_equal delta=2*(phi-D);PASS_REGISTERED_RESEARCH_PACKAGE outcome=completed;PASS_RESEARCH_COMMIT_BYTES(9 package/input files).Source and scope
Base
20ecf2891d80b5acf18d980b2164fb44ea7faa90, priority revision 6.The package is
research/joint-output-connector-minimal-charge-247794/; exactsource blobs and SHA256 hashes are recorded in
SOURCES.json.The source-side pair operation is already covered by PR #2056, including dirty
replay and charged accesses. PR #3604's specialized P112 co-delivery is
adjacent but distinct: it shares tetrad products with a fused port and source
correction, and this package neither re-audits nor claims that factorization.
The live PR #3779 addresses a six-window restoration bill. No selected result,
supplier, or frontier changes here; there is no new κ.
Credit the fixed-alphabet and pair-source connector predecessors. Prepared by
OpenAI Codex with substantial assistance. No independent human or formal
proof-kernel review is claimed.
Publication validation
python3.12 scripts/research_package.py --package research/joint-output-connector-minimal-charge-247794passed on CPython 3.12.3, andpython3.12 scripts/check_research_commit.py --package research/joint-output-connector-minimal-charge-247794 --check-source-historypassed. The registered replay left the worktree clean. This supersedes any earlier pending note above for the registered package replay; separate full selected cold-replay limits remain as stated.