Repository navigation
Add five-source arity-four connector cost bound - #3909
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.
Summary
Adds a scoped five-source bound for one paid connector alphabet extension: an atomic arity-four source event
Q_r: z += sum_{j != r} B_j x_j, charged one dispatch plus all four constituent source-map additions.For the all-31-nonzero-mask paired-readout batch, the original alphabet has exact 74-query cost, or 148 units under the stated dispatch-plus-addition ledger. Every schedule using the new family costs at least 149 units. The exceptional one-
Q, nine-source-event branch is exhaustively checked: 23,184 normalized words, maximum prefix-difference set size 26/32. Nokappaor supplier admission is claimed.Package:
research/five-source-arity-four-bound/Base:
20ecf2891d80b5acf18d980b2164fb44ea7faa90Head:
0133b60eVerification
python3 -B research/universal-connector-boundary/verify.py— 945-pairing predecessor control passes.python3.12 -I -O -B research/five-source-arity-four-bound/verify.py— dirty-call control, 23,184-word census, symmetry controls and twelve-event positive control pass.python3.12 scripts/research_package.py --package research/five-source-arity-four-bound— registered package replay passes.python3.12 scripts/research_package.py --package research/five-source-arity-four-bound --check-only— package metadata and source pins pass.Scope and limits
This uses the exact five-source dirty connector and output boundary, with the source alphabet expanded only by weight-four steps. The result uses a uniform linear charge of one unit per event dispatch and one per constituent map addition. It does not price a physical caller's nonuniform source tariffs, word-dependent storage/routing, or an implementation that performs fewer than four charged additions. It is not a complete multiplication theorem or a new selected bound. The selected cold replay and hosted CI were not run or claimed.
Credit Ross Richardson's #943/#934 connector lineage and Cinna Davis's open #2249 high-arity six-source work. #2249 motivated the complementary five-source question but was not independently replayed here. Prepared by OpenAI Codex with substantial AI assistance; no independent human or proof-assistant review is claimed.
Publication validation
The registered package replay passed on CPython 3.12.3 with
python3.12 scripts/research_package.py --package research/five-source-arity-four-bound. The optional--check-source-historypreflight could not run because this MacBook checkout is shallow and the checker requires full Git history. This package's source manifest pins only files at its exact base commit20ecf2891d80b5acf18d980b2164fb44ea7faa90; it contains nohead:source pins. Any earlier pending note above refers to the state before this publication-time replay.