Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
134 changes: 134 additions & 0 deletions research/qq16-affine-helper-mix-seed98c45/PROOF.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,134 @@
# One mixed affine QQ16 helper cannot recover the lost input

## Statement and scope

Fix the source-bound QQ16 `F0/B1` pair, retained ordinary schedule, and
standard observations (selected outputs, completed-X descendants, and all five
forward-query histories). On a finite regular cover `G`, let
`B_s : Q^(96|G|) -> Q^(8|G|)` be the actual ordinary-source query operators
for `s=0,1,2`.

Allow exactly one additional eight-coordinate helper, immediately before
`F0`, with response

```text
H' = H + B0 X_U + (M lifted cover-wise) B2 X_U + c,
```

where `M` is any rational 8x8 matrix, `H` is an arbitrary but common dirty
pre-state, and `c` is any fixed 8-vector lifted identically at each cover
location. For every `M`, `H`, and `c`, the augmented observation map is
noninjective. More precisely,
`dim B2(ker[B0+M B2; B1]) >= 32|G|/7`. This is an information obstruction,
not a native cost or new `kappa` result.

## Pinned rank input

The exact three-query rank bound used here is the source-checked result in
[PR #2104](https://github.com/CrocSwap/integer-mult-bounds/pull/2104), head
`4bdc574da394a39f955e8cf4637075649c43a632`, exact base
`0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2`. Its `PROOF.md` SHA-256 is
`9c2ad4600d65dd3354db4bae5ac78d13fedf2da6e500224fafaeed596846c887`.
That proof pins the QQ16 source/certificate and checks, for each pair
`(0,1),(0,2),(1,2)`, that the 96 relative route labels are distinct and the
cross-Gram identity coefficient is `192 I_8`; it also checks the actual
ordinary column norms and Gram. The local source-specific verifier from that
exact PR head was run read-only against this base with Python 3.14. It printed
`PASS_QQ16_EXTRA_QUERY_RESIDUAL rank_stack>=144|G|/7 missing_A>=ceil(32|G|/7) no_new_kappa`.
At the last successful hosted-status check at 19:52Z, PR #2104 was open and
its checks were pending. A later status refresh hit the GitHub API rate limit,
so its current hosted status is unverified.

For `N=|G|`, those exact route facts imply

```text
B_s B_s* = 48 I_(8N),
tr((B_s B_s*)^2) = 18432 N,
tr(B_s B_t* B_t B_s*) = 1536 N (s != t).
```
For `S=[B0;B1;B2]` and `K=S* S`,

```text
tr(K) = 1152 N,
tr(K^2) = 64512 N,
rank(S) >= tr(K)^2/tr(K^2) = (144/7) N. (1)
```
The rank bound is Cauchy--Schwarz on the nonzero eigenvalues of `K`. The
current package uses this exact predecessor lemma; it does not rederive the
route labels.

## All-matrix kernel argument

Let `A_M = B0 + (M lifted cover-wise) B2` and `T_M=[A_M;B1]`. Both query
blocks have `8N` rows, so `rank(T_M) <= 16N`. Appending `B2` recovers exactly
the row space of `S`, since

```text
A_M = B0 + M B2, B0 = A_M - M B2,
row([A_M;B1;B2]) = row([B0;B1;B2]).
```
This holds for every rational `M`, including singular `M`. Therefore (1)
gives

```text
rank([T_M;B2]) - rank(T_M)
>= (144/7)N - 16N = (32/7)N > 0. (2)
```
The left side is `dim B2(ker T_M)`. Rationality of all maps means the
rational nullspace spans the real nullspace. Thus some rational `h` satisfies

```text
B1 h = 0, B0 h + M B2 h = 0, B2 h != 0. (3)
```
Clearing denominators preserves (3).

Use the same `H,c` for inputs `h` and `0`. Equation (3) makes their new
helper records equal. The affine offset and dirty pre-state cancel in the
difference.

## Existing selected-value witness

For any `h` satisfying (3), use the source-pinned QQ16 input compensation on
pair 0:

```text
X_U = h, Y_U = 0,
X_A = -P_(0,A) B0 h - P_(2,A) B2 h, Y_A = -X_A,
X_T = P_(0,T) ell_(0,A) P_(2,A) B2 h, Y_T = -X_T.
```

The formulas are linear in `h`. The selected pair sums vanish; the ordered
`F0/B1` equations use only `B1h=0`, `B2h!=0`, and the pinned two-sided
selected-section identities. They leave a nonzero initial selected value
`X_(0,T)` but zero selected outputs, completed-X descendants and all five
forward histories, as detailed in
`research/joint-query/evidence/QQ16-SELECTED-WITNESS.md`. By (3), the mixed
affine helper also agrees with the zero input. No decoder from these
observations can restore every original selected input.

The zero-cost relaxation grants every potentially relevant expense for free:

| Expense | Favorable charge |
|---|---:|
| Source access and query arithmetic | 0 |
| Helper storage and output hosting | 0 |
| Helper update, inverse, and dirty-state restoration | 0 |
| Frame and address transitions | 0 |
| Local calls and recursive child operations | 0 |
| Recursive precision | 0 |

It still fails injectivity, so there is no implementable cost or moment gain
to invoice for this interface.

## Limits

The theorem allows all rational 8x8 mixers and fixed offsets on one helper.
It keeps the actual `F0/B1` maps, ordinary tail, observation set and source
cut fixed. It does not cover a second independent helper, an input-dependent
offset, another source field, a changed first pair or tail, or a later read of
other ordinary banks. `32|G|/7` is an information dimension, not a paid
recursive-child rank.

`verify.py` checks the rank/row-space corollary on exact rational controls and
checks the exact trace arithmetic. It does not replace the pinned route
verification of (1) or replay the full inherited native trajectory.
49 changes: 49 additions & 0 deletions research/qq16-affine-helper-mix-seed98c45/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
# QQ16 mixed affine helper obstruction

**Scoped negative result; no supplier or kappa claim.** One added 8-coordinate
affine helper `H + B0 X_U + M B2 X_U + c` cannot restore all original
selected inputs under the fixed QQ16 `F0/B1` pair and retained schedule, for
any rational 8x8 mixer `M`. The proof converts the exact three-query rank
bound from PR #2104 into an all-mixer kernel bound. The helper and every
operation needed to implement or restore it are granted free, yet the
observations remain noninjective.

## Reproduce

From the repository root:

```sh
python3 -I -O -B research/qq16-affine-helper-mix-seed98c45/verify.py
python3 scripts/research_package.py --package research/qq16-affine-helper-mix-seed98c45 --check-only
```

Expected direct result: `PASS_QQ16_AFFINE_HELPER_MIX cases=4 positives=4 controls=3 no_new_kappa`.
Expected metadata result: `PASS_PACKAGE_METADATA_AND_PINS (not a mathematical acceptance check)`.
Registered replay uses Python 3.12; hosted CI is the runtime check if that
interpreter is unavailable locally.

The exact route lemma is pinned to PR #2104 head
`4bdc574da394a39f955e8cf4637075649c43a632`, `PROOF.md` SHA-256
`9c2ad4600d65dd3354db4bae5ac78d13fedf2da6e500224fafaeed596846c887`.
Its source-specific verifier ran locally on Python 3.14 against the exact
base. At the last successful status check at 19:52Z, that PR was open with
hosted checks pending; the later refresh hit the GitHub API rate limit, so
current hosted status is unverified. Full argument and scope limits are in
[PROOF.md](PROOF.md); original source and selected witness remain unchanged.

## Attribution and limits

Credit Ali Romman and PR #1969 for the QQ16 maps and selected witness; Cinna
Davis PR #2104 for the source-bound three-query rank result; Cinna Davis PR
#2079 for the B2-only observation this result extends. Adam Gall PR #2093 and
#2086 address related but different observation/logger cases. Prepared with
substantial OpenAI Codex assistance. No independent human or formal-kernel
review is claimed.

## Open next questions

- **Can a second independent ordinary-to-selected record restore injectivity?**
The row-count cap used here would no longer apply. Specify the second source
and compute the joint kernel before native synthesis.
- **Can one changed ordinary-tail map retain the erased selected value?**
Derive its inverse and observations before expanding the controller.
24 changes: 24 additions & 0 deletions research/qq16-affine-helper-mix-seed98c45/RESULT.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
{
"dimension_bound": "dim B2(ker[B0+M B2;B1]) >= 32|G|/7 for every rational 8x8 M",
"no_kappa_change": true,
"outcome": "negative-result",
"remaining_limits": [
"Uses the exact route-rank theorem in open PR #2104; its hosted checks were pending at 19:52Z and the later status refresh failed on API rate limit.",
"No native helper implementation, complete physical cost, supplier admission, precision proof, or global controller."
],
"reproduction": "python3 -I -O -B research/qq16-affine-helper-mix-seed98c45/verify.py",
"schema_version": 1,
"source_rank_predecessor": {
"git_blob": "388bca8797d90d385d984ad8bfa72af20cf80123",
"head": "4bdc574da394a39f955e8cf4637075649c43a632",
"local_check": "Downloaded exact-head verifier run against pinned base on Python 3.14; PASS_QQ16_EXTRA_QUERY_RESIDUAL.",
"name": "QQ16 three-query route-rank proof",
"path": "research/qq16-extra-query-residual/PROOF.md",
"sha256": "9c2ad4600d65dd3354db4bae5ac78d13fedf2da6e500224fafaeed596846c887",
"status_at_claim": "open; hosted checks pending",
"url": "https://github.com/CrocSwap/integer-mult-bounds/pull/2104",
"verifier_path": "research/qq16-extra-query-residual/verify.py",
"verifier_sha256": "68e3c1c8c044a9b7ae245b189ef2154b6cfe6c96faca87349cd336ebf731fd2e"
},
"status": "SCOPED_NEGATIVE_RESULT"
}
100 changes: 100 additions & 0 deletions research/qq16-affine-helper-mix-seed98c45/SOURCES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,100 @@
{
"base_commit": "0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2",
"catalog_sha256": "d46eb6d5b3e279428753d770653663fbdf1063e55c255ea073d768f344927ef7",
"external_dependencies": [
{
"git_blob": "388bca8797d90d385d984ad8bfa72af20cf80123",
"head": "4bdc574da394a39f955e8cf4637075649c43a632",
"local_check": "Downloaded exact-head verifier run against pinned base on Python 3.14; PASS_QQ16_EXTRA_QUERY_RESIDUAL.",
"name": "QQ16 three-query route-rank proof",
"path": "research/qq16-extra-query-residual/PROOF.md",
"sha256": "9c2ad4600d65dd3354db4bae5ac78d13fedf2da6e500224fafaeed596846c887",
"status_at_claim": "open; hosted checks pending",
"url": "https://github.com/CrocSwap/integer-mult-bounds/pull/2104",
"verifier_path": "research/qq16-extra-query-residual/verify.py",
"verifier_sha256": "68e3c1c8c044a9b7ae245b189ef2154b6cfe6c96faca87349cd336ebf731fd2e"
}
],
"files": [
{
"git_blob": "e8870e5917057d59b730eb14721a778639eca050",
"path": "docs/research/agent-task-catalog.json",
"sha256": "d46eb6d5b3e279428753d770653663fbdf1063e55c255ea073d768f344927ef7",
"usage": "provenance"
},
{
"git_blob": "ae6a99f28aa468649eb66a361e764d769363bf11",
"path": "certificates/selected-result.json",
"sha256": "10b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32",
"usage": "provenance"
},
{
"git_blob": "9b6cbfef0fb725f28c177038d32f482706e12c94",
"path": "autoresearch.md",
"sha256": "79d0c8be61d90dd6c46b6e7250e0c88713d29854128d8d1361b6343682dad1d8",
"usage": "provenance"
},
{
"git_blob": "e51435543687f1bd88ab22248082dc689ce8b853",
"path": "CONTRIBUTING.md",
"sha256": "df5b5646602f42cb5da5844f04ac925182ddcd0f627b9de1c96a5095bb7a277a",
"usage": "provenance"
},
{
"git_blob": "fc9704487ccf5fbf0472950117741c219fe98151",
"path": "docs/research/community-efficient1000-review.md",
"sha256": "bac19ca28be781e7ac444e0666320ef77c0ac159467eafa3198e07b7c280442e",
"usage": "provenance"
},
{
"git_blob": "3e66629292d42f592a0d73a4a42f7f3a02bd62a5",
"path": "research/joint-query/SOURCES.json",
"sha256": "fabc6686e5d3ac0e4bb4397c147037b9285abfa671614590dad6d4e16b4dc0fc",
"usage": "provenance"
},
{
"git_blob": "c6e876d8b48d768214deee265ade428f8983b566",
"path": "research/joint-query/certificate.json.gz",
"sha256": "a5ed85fac5ebf3c091482a113ab0d351eb5a7892fe2841a35e16017ec1ff49f7",
"usage": "input"
},
{
"git_blob": "4639583c1be02c2fb60ed8a8072c9969ef1569ce",
"path": "research/joint-query/evidence/CONSERVED-QQ16.md",
"sha256": "60f0de3a7205ba5046b5ae7ffa8bf2b1ea42ea46b498face0a77966b59e7f3fb",
"usage": "provenance"
},
{
"git_blob": "7a155a27dcf7f1ccd48e40d57a2c5d2724016e9b",
"path": "research/joint-query/evidence/CONSERVED-QQ16.json",
"sha256": "b91eb8599c403db55c889bb225a1cd93f46fdb83eb339f101d18843d52b1c920",
"usage": "provenance"
},
{
"git_blob": "307650f45e37c28d14fe913958efa4fb429242b7",
"path": "research/joint-query/evidence/QQ16-SELECTED-WITNESS.md",
"sha256": "52f2ee565320f05282c637aa79eee100606c24240b1b5866f0c8d62e7913c9fc",
"usage": "input"
},
{
"git_blob": "5082d791d0b993492cbc5bf61ac3b69e82c96f3f",
"path": "research/joint-query/evidence/QQ16-SELECTED-WITNESS.json",
"sha256": "e35e5868a1322e406191079c0675975b139692ba50b1e2e5fb8a40b6480519f4",
"usage": "input"
},
{
"git_blob": "ede9e7e42744dd0c96790516a9acdfe07d180018",
"path": "research/joint-query/verify_native.py",
"sha256": "1c58e7b6e8e1cde4df455c2129601c145ed763fc63a3ab427eb1058d1fc08bd2",
"usage": "provenance"
},
{
"git_blob": "3e85a06d1848e94a4eb0908d6ec6c0bccde16b2f",
"path": "research/joint-query/replay.py",
"sha256": "61a3c2ddc3e62f965bfc9ee47b6a1e8c03b0071c5021feb6612ebbdd9561038e",
"usage": "provenance"
}
],
"schema_version": 1,
"selected_record_sha256": "10b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32"
}
Loading
Loading