Repository navigation
Research: sharp ten-query mutable-source connector (no new kappa) - #1340
Merged
Mister-Meeseeks merged 1 commit intoOct 14, 2026
Merged
Conversation
Merged
3 of 4 tasks
Contributor
|
100-PR batch review at Merged to Reviewed scope: Mutable-source five-column connector with a sharp ten-query paired-readout bound and fully restored literal recursion. Twelve paid source shears replace two common-map calls; a favorable abstract tariff is not an established tape-runtime saving. 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. |
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 14, 2026
… kappa)
Add one new complete call type DUO_{j,k}: z += B_j x_j + B_k x_k to the frozen
universal-connector alphabet (the only changed premise is 'no combined
queries'; the call is charged in full). Exact finite result: the five-source
universal source word has unique Pareto profile (10 calls, 12 toggle-adds)
versus the frozen (12, 12), so the all-31-row batch runs 72 root queries at 74
toggle-adds instead of 74 at 74 - the support bound 72, unattainable in the
singleton alphabet, is attained exactly here. k=9 is excluded by a complete
zero-cover census of all 7,888,725 nine-point sets; W>=12 by parity plus the
reproduced 945-pairing control. n=3 (5,6) and an n=4 (6,8) side row included.
Predecessor credit: Ross Richardson's research/universal-connector-boundary
(#943 / #934).
Comparison: #1340 and
#1370 mutable-source shear (Arham Tahir),
discussion 1352; #1185 f(6)=16. Prepared by
Navinor with help from opencode. Apache-2.0.
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.
PR943's read-only five-source connector needs an extra pair of map calls. This contribution adds one explicitly paid operation family: temporarily XOR source rows, then restore them. For a common exact F2-linear B and arbitrary A_m, all 31 nonzero five-source output patterns use 10 B queries, 62 readouts and 12 source XORs, preserving arbitrary dirty inputs and scratch. The common-B and temporary-source-ownership assumptions are essential.
Scoped recursive-interface result; no new kappa or supplier adoption. Ten B queries are sharp when each output is read twice, even allowing arbitrarily many source shears. The proof reduces nine-query coverage to all 2,600 normalized nine-point sets in F2^5; direct pair-set and separate integer Walsh-autocorrelation checks agree on the complete histogram. Twelve XORs are an attained count, not an optimum.
The full five-factor recursive word includes every child and inverse: 2,016 arbitrary-map leaves plus 12 identity-row XORs, versus 2,072 leaves for each literal PR943 repair, with four borrowed dirty rows throughout. The invoice separately counts 648 versus 666 internal nodes and 84 versus 74 root instructions. A declared positive tariff paying leaves, XORs, nodes and root dispatch gives 2,760 versus 2,812 units. This is an abstract complete price fixture; no physical runtime advantage follows. PROOF.md states the general price inequalities and a dense implementation with separately charged access, travel, preparation and control obligations.
Only
research/mutable-source-connector/is added. Start with README.md and PROOF.md; SOURCES.json pins the three live predecessor inputs. Base/current main:bce54fb3f895cbe5cd4c0eb477c3afeed100190f; contribution:f1dcab36fa63f8226f70dd07e26f44afb9d39b51. Selector noncea083d7387e219510c2de83d13581da77, recursive-interfaces track, refinedconnector-alphabet-changecard. TASK.json includes the question, pilot, stop rule, local claim, exact overlapping heads and next steps.Validation
Windows 11 / CPython 3.12.14, standard library:
All pass, along with the card's unchanged PR943 positive control and staged whitespace checks. Evidence includes exact free noncommutative replay of all 40 incoming dirty rows in both directions, both predecessor repairs, the complete 2,600-set census, 3,024 separate dense matrix executions, nine primary mathematical controls, two concrete oracle controls and four package test groups covering optimized relocation, deterministic regeneration, occupied-output preservation and eight source/certificate corruption cases. VALIDATION.md records an initial Windows temp-directory failure and its passing scratch-directory correction.
Scope, overlap and credit
The selected record and frozen inputs are unchanged. No selected cold replay, fresh native supplier run, complete repository suite, Lean, hosted CI pass, physical supplier instantiation, ownership/frame admission, precision/tape realization or analytic-transfer proof is claimed. The next practical task is to locate an actual common-B boundary and price one source XOR completely; source immutability or an unfavorable tariff should stop that adoption attempt.
Final overlap refresh covered 821 open PRs including drafts, with complete public REST pagination at 2026-10-13 23:03:34 UTC. The repository helper searched their titles/bodies and local notes/ledger. Public discussion listing, start-here, handoff and mechanism pages were inspected; complete Discussion pagination and a connected Discussion-write tool were unavailable, so the claim is local. This is bounded overlap evidence, not proof of novelty.
Credit Ross Richardson's PR943/934, shhxera/CubeJerry's PR889, Chafik Boukhalfa's PR628, Douglas Colkitt and the retained framework. PR1185 at
4a60772285ce70f6414458f6d3a54948652bbed0extends the unchanged alphabet to six sources; Hanson Sun's PR1215 at8870e80d720ffa3a666bb5496c33373c45b90751checks its free-algebra word. They are complementary and no pending code is imported. PR1103/982 borrows outputs; PR1318 concerns a different four-valued complex-phase model. No priority is claimed for classical finite-group difference bases or dirty echo cancellation.Prepared by Arham Tahir with substantial OpenAI Codex assistance in research, algebra, both implementations, tests and writing. No subagents or independent human review. New work is Apache-2.0; predecessor sources/notices are retained unchanged.