Repository navigation
Prove the sharp 66-port threshold for a QQ16 witness family - #2354
Merged
Mister-Meeseeks merged 1 commit intoOct 15, 2026
Merged
Conversation
This was referenced Oct 15, 2026
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 15, 2026
Takes PR #2354's excluded adaptive-coordinate premise. On PR #2354's rational QQ16 hidden-input family, every exact deterministic reader needs at least 66 distinct source-port reads on every input, whatever its adaptive choices, nonlinear computation or stopping rule; for input-independent random seeds the same bound holds almost surely. The source geometry classifies all 45 optimal read sets: each contains 22 mandatory ports and 44 of the 45 coordinates in one relation, every one omits the same 29 ports, and port 77 can replace 44 specific ports of PR #2354's attaining set. Explicit rational decoders attain all 45. Information-access counts only; no supplier or kappa change. Adds research/qq16-adaptive-coordinate-reads/ only. Submitted by @commdata2338 with substantial AI assistance (OpenAI Codex research and implementation; packaged with Claude Code). Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01X86sCSXdoDd61SDFfC1PKG
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 15, 2026
Answers PR #2354's second open question. Its attaining 66-port read set fails on a second-axis input family: with c = (-1,-1,-1,+1) on unread ports 44, 49, 58 and 70 and second local axes (25,145,4,4), the source columns satisfy -r44 - r49 - r58 + r70 = 0, so every positive-stage query vanishes for every owner while B0 h(I) = (-1,0,-1,0,0,-1,0,-1). The original selected A input at the identity owner is (1/2,0,-1/2,0,1/2,0,1/2,0), yet all 66 reads, the selected outputs, completed-X descendants and the five forward histories stay zero through the fixed F0/B1 pair and full ordinary tail; the selected shear does not help. Negative result for this read set only; no supplier or kappa change. Adds research/qq16-66port-second-axis/ only. Submitted by @commdata2338 with substantial AI assistance (OpenAI Codex research and implementation; packaged with Claude Code). Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01X86sCSXdoDd61SDFfC1PKG
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.
Change and mathematical scope
The QQ16 coordinate-tap handoff in #2326 left the sharp threshold for its common-axis witness family open. This package proves that exactly 66 fixed ordinary source-port reads are needed to eliminate that family. Fewer than 66 always leave an original selected A-input defect invisible; the complement of a specified 30-port, common-axis group attains the threshold for this family.
The new step is a certificate for the complete owner array: the map
c -> B0 h, withh_p(d)=c_p bit_0(d b_p), has rank 74, and its restriction toker(R_U)has rank 66. A 74-by-74 integer minor has determinant36317027395115679744; a matching group-rank upper bound makes the rank exact. Evaluations use identity and actual registered stage-1 owner routes. No formal independence assumption about bit functions is needed.This is a scoped proof with exact finite evidence. The 66 dimensions are across the entire owner array, not per owner. The threshold is for eliminating this witness family, not full controller recovery or a native-cost tariff. No supplier, selected-source or kappa change. Even free implementation cannot repair the family with fewer permitted coordinate reads; physical access, retention, hosting, precision, all-size admission and the complete supplier invoice remain open.
Task and overlap
joint-query-controller, refined scope; key0e34adbc1dd119161c3a, chooser nonce19ff9482038bcc5873e8a54d230d4e65, recursive-interfaces, priority revision 4. Metadata:research/qq16-owner-separation/TASK.json.0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2; contribution308ebc7405303bb7ed91b012bb705949c6091a16.fb7d64cd4a51c49bc56920305b0aca64011a420c; common-axis family from Exhibit a QQ16 kernel invisible to nonzero-chart source queries #2093 at8b21a900eb520e4f11ea177b310f66316f8e8983; QQ16 maps from Add native joint centre-query transfers on sixteen selected ports #1969 retained on main. No pending Python package is imported or vendored.Validation
Native Windows, CPython 3.12.14: registered normal and optimized replays pass, including 12 rejecting controls and three isolated integrity tests. CPython 3.14.6 reproduces the same exact receipt. The checker authenticates the sources, binds 1,008 routes, verifies rational ranks and the integer determinant, checks the attaining 66-tap and failing 65-tap cases, and replays the reduced 19-event ordinary trajectory. Altered receipts and manifests reject without rewriting evidence. Package metadata/source checks and
git diff --checkpass.Expected:
PASS_QQ16_OWNER_SEPARATION rank=74 defect=66 sharp_family_taps=66 controls=12 no_new_kappa.Not run: full supplier cold replay, native child execution, proof-assistant formalization or independent human review. Local tests do not assert a hosted-CI pass.
Credit
commdata2338 (#2326), Adam Gall (#2093), Ali Romman (#1969), Cinna Davis (#2216/#2268), the concurrent EdDiboi investigation, and the retained construction/compiler lineage are credited in the README. New material is Apache-2.0; frozen source notices are unchanged. Substantial OpenAI Codex assistance was used for derivation, implementation, verification and writing; this is author-checked evidence.
Open next questions
The README and TASK.json give the precise follow-ups: test the attaining coordinate set against other full-controller input families, or test a dense old-chart record with an explicit retention contract. The latter now has a separate active claim; the coordinate-family theorem does not settle it.