Repository navigation
Bound QQ16 transcript capacity and rule out the full initial R2 query - #2153
Merged
Mister-Meeseeks merged 1 commit intoOct 15, 2026
Merged
Conversation
…ails At the fixed QQ16 F0/B1 cut, the known erased-input family carries an original selected A/T defect of dimension at least ceil(88|G|/7). An added read-only rational-linear record of rank d leaves at least max(0, ceil(88|G|/7) - d) of it invisible. So the full initial R2 X query (at most 8|G| outputs on the family) does not restore the selected inputs, and neither does any record of at most twelve scalars per cover owner. Thirteen is necessary, not shown sufficient. PR CrocSwap#2104's three-query trace bound is rederived against main's packet. This is information dimension, not paid rank; no supplier or kappa change. Adds research/qq16-transcript-capacity/ 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 was referenced Oct 14, 2026
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 15, 2026
Answers the two-record handoff of PR #2153. With the two initial ordinary records (B0 X_U, B2 X_U), the post-B1 selected values of pair 0, the forward histories f0 and f2, and the completed-X descendant Y_(0,U)^final, a decoder D with D O = J recovers pair 0's original selected A/T inputs for arbitrary inputs in all four bank pairs, not only PR #2153's erased family. The tail identity is Y_(0,U)^initial = Y_(0,U)^final - K_(2,U) f2, and the decoder reconstructs the transient F0 A output instead of saving it. Access to the post-B1 cut is a premise; this is an information lemma, not a final-only controller or a paid bill. No supplier or kappa change. Adds research/qq16-two-query-kernel/ 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
At the fixed QQ16
F0/B_1_2cut (the witness from PR #1969), the known erased-input family carries an original selected(X_A, X_T)defect of dimension at least ⌈88|G|/7⌉. An added read-only rational-linear record of rank d leaves at leastmax(0, ⌈88|G|/7⌉ − d)of it invisible.Consequence: the full initial
R2 Xquery, which has at most 8|G| outputs on this family, does not restore the selected inputs: at least ⌈32|G|/7⌉ defect dimensions stay invisible. No record of at most twelve rational scalars per regular-cover owner does either. Thirteen per owner is necessary in this model, not shown sufficient. This answers the full-initial-R2 Xhandoff in discussion #2074.Status: a scoped proof (written in
PROOF.md) with exact finite source checks. It is information dimension, not paid recursive rank or native cost; no supplier or κ change.What is new: PR #2104 bounds the A loss after the B2 read with a three-query trace bound. This package rederives that bound against main's packet (
tr K = 1152|G|,tr K² = 64512|G|, sorank[B0;B1;B2] ≥ 144|G|/7) and measures the joint A/T defect,dim J(ker B1) = rank[B0;B1;B2] − 8|G|. That lets the record read every original coordinate, including selected inputs and cross-owner mixing, so the bound covers the fullR2 Xread as well as the narrower observation models of PR #2079 and PR #2122.The package:
research/qq16-transcript-capacity/(eight new files) holds:PROOF.md: the observation and capacity contract, the rebound three-query premise, the joint defect isomorphism, the record-capacity inequality and the explicitR2 Xformula;verify.py: reads main's frozen QQ16 packet; checks the Gram identities of the 96 ordinary ports, route distinctness for each of the three stage pairs and the F1/F2 alignment routes against B1's; replays the retained formal-h ordinary tail. Exact rational fixtures with noncommuting selected sections test the ordered compensation, the defect inverse, theR2 Xformula and a concrete invisible direction;Remaining obligations.
Task and overlap
joint-query-controller/0e34adbc1dd119161c3a, refined toQQ16-fixed-F0-B1/full-initial-R2-X/arbitrary-linear-transcript/A-T-defect-dimension. Chooser nonce714dbcab67b2539705b72cb500a3f046, track recursive-interfaces, priority revision 4. Following revision 4's preference for a live, unclaimed central handoff, this was taken over the chooser's generic suggestions (connector-alphabet-change, coverage-law-change, centre-path-sharing); no reroll.0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2, rechecked unchanged at 21:02 UTC; contribution5646398dcdc01769df83b939c6b3eb5ecb4d5ebd. PR Add native joint centre-query transfers on sixteen selected ports #1969 (a6e6ad3936f67b8f63b5b68c5e75d540610a65e7, merged) is consumed from main with blob and SHA-256 pins inSOURCES.json. PR Quantify QQ16 information loss after the extra B2 query #2104 (4bdc574da394a39f955e8cf4637075649c43a632) is method credit, not a code dependency; PR Bounded B2 observation result for the QQ16 witness #2079 (49df8190b158e3028e702b2c6b798117006f7249) and PR Rule out one mixed affine helper for the QQ16 interface #2122 (7045301a8c15eb4408e3e9d80969c9d50a914cde) are the narrower predecessors. No pending PR executable is imported.(X_A, X_T)map onW(ker B1), and whether a narrow read-only record of the complete initial input can preserve it, especially the fullR2 X.R2 Xopen); PR Rule out one mixed affine helper for the QQ16 interface #2122 (excludesB0 + M·B2for scalar rational 8×8 M); PR Bounded B2 observation result for the QQ16 witness #2079 (the B2 read); PR Prove a QQ16 first-forward A logger obstruction #2086 (changed A logger) and PR Exhibit a QQ16 kernel invisible to nonzero-chart source queries #2093 (an explicit nonzero-chart witness); philippeVV's first-pair catalogue finding in CLAIM: one paid pre-F0 B2 source observation (seed 3e62c004) #2074. Added value: the joint A/T defect and a capacity bound for every linear record.Validation
Linux x86_64, CPython 3.12.3, standard library, single process. The registered replay was run again on the final package bytes before submission, under an 8 GiB memory cap: it passed in about 6 seconds and left the worktree unchanged.
The quantified statement follows from the written proof; the fixtures are failure-mode tests, not sampling evidence. No hosted CI result is claimed.
Credit
R2 Xhandoff.AI assistance: submitted by @commdata2338 with substantial AI assistance. OpenAI Codex (GPT-6 Astra) did the derivation, the implementation, the checking and the writing; it was packaged and submitted with Claude Code. No independent human review is claimed.
Open next questions
From the package README:
(B0 X_U, B2 X_U)recovers the selected defect on this erased family. First step: characterize the complete observation kernel on all inputs, then test that pair on it. Blocker: this family is only a subspace, so recovering it is not enough for a controller or a favorable bill.[B0;B1;B2]with the actual route algebra. Blocker: the regular cover is too large for naive matrix expansion, and a sharper rank would still not price a legal implementation.Workflow feedback (optional)
--task joint-query-controllerreturned 1,484 possible matches, because nested starting points contribute the generic folder wordevidence; exact formula searches were needed to find the handoff. This account's claim in Agent workflow feedback: friction, detours, and better next steps #1200 addresses that helper.🤖 Generated with Claude Code
https://claude.ai/code/session_01X86sCSXdoDd61SDFfC1PKG