Skip to content

Bound QQ16 transcript capacity and rule out the full initial R2 query - #2153

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
commdata2338:qq16-transcript-capacity
Oct 15, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
commdata2338:qq16-transcript-capacity

Conversation

@commdata2338

Copy link
Copy Markdown
Contributor

Change and mathematical scope

At the fixed QQ16 F0/B_1_2 cut (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 least max(0, ⌈88|G|/7⌉ − d) of it invisible.

Consequence: the full initial R2 X query, 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 X handoff 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|, so rank[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 full R2 X read 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 explicit R2 X formula;
  • 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, the R2 X formula and a concrete invisible direction;
  • eight semantic and parser controls, two receipt mutants and three artifact tests, including an optimized read-only relocation without Git and source and receipt corruption rejection.

Remaining obligations.

  • No independent or formal-kernel review. No compact witness for the actual regular cover and no precision bound; the witness exists by the rank argument.
  • Native full-word replay, legal endpoint access, chronological hosting, the all-size compiler and supplier admission are not addressed.
  • Widths 13 to 16 and the complete observation kernel remain open. Nonlinear encoders, changed first pairs or schedules, and uncounted payload storage are outside the theorem; a separately saved transient F0 A output counts as additional information.

Task and overlap

Validation

python3 -I -B scripts/research_package.py --package research/qq16-transcript-capacity --check-only
python3 -I -B scripts/research_package.py --package research/qq16-transcript-capacity
python3 -I -O -B research/qq16-transcript-capacity/verify.py
git diff --check

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.

PASS_QQ16_TRANSCRIPT_CAPACITY defect>=88|G|/7 q<=12_excluded full_R2_X_insufficient
PASS_REGISTERED_RESEARCH_PACKAGE research/qq16-transcript-capacity outcome=completed

The quantified statement follows from the written proof; the fixtures are failure-mode tests, not sampling evidence. No hosted CI result is claimed.

Credit

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:

  1. Can two query records recover the complete controller? (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.
  2. What is the exact required record dimension? The gap between the necessary width of thirteen and the sixteen-coordinate description of the family remains. First step: sharpen the exact rank of [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)

  • What helped: the handoff in CLAIM: one paid pre-F0 B2 source observation (seed 3e62c004) #2074 named the exact next question, so the session could go straight to it.
  • Friction: --task joint-query-controller returned 1,484 possible matches, because nested starting points contribute the generic folder word evidence; 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.
  • Suggestion: handoffs should state observation timing explicitly. "Selected endpoints" can hide whether F0's transient A output is retained, and that changes the admissible information; this package states the boundary and includes a control for it.

🤖 Generated with Claude Code

https://claude.ai/code/session_01X86sCSXdoDd61SDFfC1PKG

…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
@Mister-Meeseeks
Mister-Meeseeks merged commit 6bd33bc into CrocSwap:main Oct 15, 2026
41 of 61 checks passed
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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants