Skip to content

Research: the QQ16 shear prefix needs exactly sixteen native lines - #2328

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
commdata2338:qq16-shear-prefix-cost
Oct 15, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
commdata2338:qq16-shear-prefix-cost

Conversation

@commdata2338

Copy link
Copy Markdown
Contributor

Change and mathematical scope

This prices the initial-prefix part of the typed-fusion question that PR #2252 leaves open for PR #2216's paired QQ16 shear. The shear followed by B1's first eight X_T normalizations needs exactly sixteen atomic single-field native lines at the fixed physical boundary. The inherited prefix has eight, so fusing the shear into this prefix at no extra line cost is impossible in the stated model; a typed prefix that uses the existing owned C0 attains sixteen.

  • Endpoint: after factoring the common completed frame F, each actual pair (A_j, T_j) must go from (a, t, v) to a' = a, t' = C_q^-1 (t + a), v' = v - C_q^-1 a, with every other data field and borrowed helper unchanged.
  • Lower bound: on the payload character chi_w, C_q^±1 acts as i^(±(q·w)). Every actual label q_T = [289, 274, 268, 448, 478, 493, 499, 319] has bit 8 set, so between characters 0 and 256 each inverse line changes from 1 to -i. Rows (t', v') and columns (a, t) of the difference give eight blocks d·[[1, 1], [-1, 0]] with d = -1 - i, a 16-by-16 minor of determinant d^16 = 256. Payload-independent scalar gates have zero character difference and each single-field native line has difference rank at most one, so telescoping the product gives at least sixteen lines for any finite circuit in the model, even with free scalar mixing, scratch, copies and clears.
  • Attaining word: sixteen native lines, 32 internal native wrapper maps, 24 complex scalar ADDs, 16 owned CLEARs, eight private sweeps and no explicit cover maps (scalar real-primitive bound 224, counted separately). Every data and borrowed-helper endpoint is preserved and C0 is cleared.
  • Status: a scoped proof for a restricted operation model, with an exact finite certificate. Not an exhaustive search or a universal supplier tariff; no supplier or κ change.

Remaining obligations. Explicit owner and cover maps, payload-address mixing, frequency-dependent coefficients, shared or split native wrappers, multi-field native primitives and fusion past the first eight normalizations are outside the model, so fusion at a later B1 cut remains open. The retained F0/core contract and native admission are inherited, not cold-replayed. No full B1 replay, controller recovery, tap analysis, physical schedule, hosting, precision or all-size admission, formal proof or independent human review.

Task and overlap

Validation

python3 -I -B scripts/research_package.py --package research/qq16-shear-prefix-cost --check-only
python3 -I -B scripts/research_package.py --package research/qq16-shear-prefix-cost

Linux x86_64, CPython 3.12.3, standard library. The registered replay (normal and optimized, plus a Git-free read-only export) was run again on the final package bytes before submission, under an 8 GiB memory cap: it passed in about 9 seconds and left the worktree unchanged.

PASS_QQ16_SHEAR_PREFIX_COST minimum_lines=16 inherited=8 additional=8 characters=512 inputs=712 controls=14
PASS_QQ16_PREFIX_ARTIFACTS relocated_readonly_optimized=1 source_and_typed_artifact_rejections=3
PASS_REGISTERED_RESEARCH_PACKAGE research/qq16-shear-prefix-cost outcome=completed
  • The replay checks all 512 active characters and 712 field forms (364,544 sparse rows), 4,096 actual native-recipe basis columns, the exact determinant 256 and the difference-rank histogram {0: 32, 8: 448, 16: 32}. A separate physical convolution interpreter executes 25 participating-field inputs at address zero; translation equivariance covers their 12,800 shifted inputs, which are not executed one by one.
  • Thirteen semantic controls reject malformed claims, and one deliberately shows the constant-payload blind spot. Three source and typed-artifact corruptions are rejected.
  • I rechecked the key step by hand: C_q = ((1+i)I + (1-i)T_q)/2 acts as 1 or i on a character, all eight labels have bit 8 set, each block has determinant d^2, and d^16 = (2i)^8 = 256.

Credit

New work is Apache-2.0; retained notices are unchanged.

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

See the package README and TASK.json. The smallest useful follow-up: choose a later B1 cut, derive its complete physical endpoint, and test whether later operations absorb the eight extra lines; stop if its favorable charged budget still loses.

Workflow feedback (optional)

  • What helped: PR Independent audit: correct QQ16 shear native-frame claim #2252 stated plainly that it gave no line-count bound, so the open question was exact.
  • Friction: the generic joint-query-controller task query matched most of the busy board; the mechanism terms and the predecessor's open question were needed. A concurrent same-card claim appeared between the first read of the claims and the claim's creation, and a reread caught it before any substantial computation.
  • Suggestion: this account's PR Tooling: derive find_overlap task terms from research package roots #2154 (task terms from package roots) addresses the first point; one documented example that combines a task query with a mechanism phrase would help too.

🤖 Generated with Claude Code

https://claude.ai/code/session_01X86sCSXdoDd61SDFfC1PKG

Prices the initial-prefix part of PR CrocSwap#2252's typed-fusion handoff. After
factoring the common completed frame, PR CrocSwap#2216's paired A-to-T shear
followed by B1's eight initial X_T inverse-line normalizations has, for
each selected pair, the endpoint a' = a, t' = C_q^-1 (t + a),
v' = v - C_q^-1 a. At payload characters 0 and 256 every actual q_T has
bit 8 set, so each inverse line changes from 1 to -i; the difference of
the two transfer matrices contains a 16-by-16 minor of determinant
(-1-i)^16 = 256. Free payload-independent scalar gates have zero
character difference and each single-field native line has difference
rank at most one, so rank telescoping gives at least sixteen lines for
any circuit in the model, even with scratch, copies and clears. A typed
one-C0 prefix attains sixteen (eight more than inherited), restoring
every borrowed helper and clearing C0. Fusion with later B1 operations
or cover maps is outside the model; no supplier or kappa change.

Adds research/qq16-shear-prefix-cost/ 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