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
1 change: 1 addition & 0 deletions docs/research/research-glossary.md
Original file line number Diff line number Diff line change
Expand Up @@ -13,6 +13,7 @@ and contracts govern a proof; historical packages may use different conventions.
| Role / register / helper | A logical data or workspace position. A helper may hold arbitrary initial data; it is not automatically zero or disposable. |
| Dirty state / restoration | A routine must work for arbitrary initial workspace and return the state required by its caller's contract. |
| Frame / label | The representation attached to a role or operation. Changing frames can require paid recursive work. |
| Controller | A program combining native invocations into independent target jobs. Owner, helper, routing and error contracts determine which [two-FULL result](two-full-controller-contract-map.md) applies; inverse recipes and a favorable invoice alone do not establish a complete caller. |
| Decoder / copy cost | In the complex E8 algebraic model, a sum of support-pair terms realizing the required Gram identity; each term is charged its binary label-pairing rank. Term count, all-pairs versus masked exactness and retained readers change which [decoder bound](complex-decoder-scope-map.md) applies. A decoder alone does not supply a physical COPY program. |
| Rank / paid profile / histogram | The size of each recursive child and the count at each size, derived from the actual frame transitions and other charged calls. |
| Moment / invoice | The normalized recursive cost at a proposed saving, including the applicable extra charges. It must satisfy strict inequalities. |
Expand Down
109 changes: 109 additions & 0 deletions docs/research/two-full-controller-contract-map.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,109 @@
{
"schema_version": 1,
"base_commit": "b91956876e5b4122fd89179f1b57557ff8378f15",
"checked_at": "2026-10-23T05:24:59.113644+00:00",
"priority_revision": 7,
"task": "scope-navigation",
"assignment_seed": "69e7607a18fdb0eea80d9683e58f4194",
"track": "consolidation",
"candidate_task_ids": [
"scope-navigation",
"overlap-receipt"
],
"actual_scope": "Navigate the distinct two-FULL exact endpoint, owner/helper/routing, Laurent independent-error, inverse and shared scalar-potential contracts. No strategic priority, selected frontier or scientific acceptance change.",
"outcome": "Documentation source/cross-reference correction; no new kappa.",
"source_inputs": [
{
"commit": "b91956876e5b4122fd89179f1b57557ff8378f15",
"path": "research/two-full-central-obstruction/README.md",
"git_blob": "0b74451d2501318e3c4d1e5d3b4b0de96830d89f",
"sha256": "52663560c13b18547752af243b47693a9c7e76cd3cb7bb86328e609533c5a4e1",
"scope": "Source scope read for navigation; scientific verifier not rerun."
},
{
"commit": "b91956876e5b4122fd89179f1b57557ff8378f15",
"path": "research/two-full-central-obstruction/TASK.json",
"git_blob": "5a7627f4b79c8d5ceb4bd7831db257fa96591ea0",
"sha256": "545427fe9840bbd412cb5127b27d1039babad7c44961222f3ab08a5fa81ab230",
"scope": "Source scope read for navigation; scientific verifier not rerun."
},
{
"commit": "b91956876e5b4122fd89179f1b57557ff8378f15",
"path": "research/two-full-retained-helper-ceiling/README.md",
"git_blob": "dc4353d52e32cd327ef4cce7152a28a1ada1388e",
"sha256": "9540363e1fba2379ec8ac89216b8865aa838e992d5e2806ead3c4ac398107efa",
"scope": "Source scope read for navigation; scientific verifier not rerun."
},
{
"commit": "b91956876e5b4122fd89179f1b57557ff8378f15",
"path": "research/two-full-retained-helper-ceiling/TASK.json",
"git_blob": "7b62f5388fb5f3cfc0dd86e39bdac1e26c76cc94",
"sha256": "fee585131e63265f7ab7336aa07d671339d5e59403f45e130549c4cdc9c7976b",
"scope": "Source scope read for navigation; scientific verifier not rerun."
},
{
"commit": "039b6ea51ab7a7efb38fc6851f345839683251b0",
"path": "research/two-full-border-paid-precision/inverse-interface/PROOF.md",
"git_blob": "7d939c4dc662af9cdbf306b7e5ab4f4acf21c35c",
"sha256": "753f0e1e7f6305ed550cb7247204190d9f4f258e07744e16ee55a35ee42e3f85",
"scope": "Source scope read for navigation; scientific verifier not rerun."
},
{
"commit": "039b6ea51ab7a7efb38fc6851f345839683251b0",
"path": "research/two-full-border-paid-precision/paid-sensitivity/PROOF.md",
"git_blob": "f2260e452a301c86238ac88976fba16fae69456a",
"sha256": "8b47f2a6c6bd8e6ef035e0faeced6877037a6beac3b8cb535617988d0c3088b3",
"scope": "Source scope read for navigation; scientific verifier not rerun."
},
{
"commit": "acb28c0b5708d0aee91e457050c973e3df476fa4",
"path": "research/coherent-frame-additivity/PROOF.md",
"git_blob": "67dd02c9d31d77be390a9e3fdfc09c7dd8de56c2",
"sha256": "0f72ad943e6f1803d6cdc5749f6b6880463fc8dba8ce57e8de3c3550a8eaea79",
"scope": "Source scope read for navigation; scientific verifier not rerun."
},
{
"commit": "b91956876e5b4122fd89179f1b57557ff8378f15",
"path": "research/two-full-central-obstruction/PROOF.md",
"git_blob": "66df36c04d0f88018fd640aa095bb55eeacb17e1",
"sha256": "9babe77410543665f197cd1846d71d775d306c97716aedefc6f25f4256f5a699",
"scope": "Source theorem hypotheses read for navigation; scientific verifier not rerun."
},
{
"commit": "b91956876e5b4122fd89179f1b57557ff8378f15",
"path": "research/two-full-retained-helper-ceiling/science/PROOF.md",
"git_blob": "85eb3ade566aecd21b681085543eff617fc0f5db",
"sha256": "63ec5034fb526dc9243de487f97477e51221773f4b7cae21b38df719ba1362c7",
"scope": "Source theorem hypotheses read for navigation; scientific verifier not rerun."
}
],
"overlap": {
"terms": [
"two-full controller",
"controller contract map"
],
"coverage": {
"local": {
"head": "b91956876e5b4122fd89179f1b57557ff8378f15",
"records": 6636,
"head_records": 6636,
"complete_head_inventory": true,
"unsearched_head_paths": []
},
"open_prs": {
"fetched_at": "2026-10-23T05:23:13.776726+00:00",
"complete_pagination": true,
"records": 331
},
"discussions": {
"fetched_at": "2026-10-23T05:24:14.722610+00:00",
"complete_pagination": true,
"records": 4083
}
},
"matches_total": 0,
"limitations": "Remote PR scope is open PRs including drafts. Closed work is searched through local READMEs, TASK metadata and ledger only. Local coverage compares searched working-tree notes with regular note paths at coverage.local.head; it does not certify HEAD contents or historical coverage. No code diffs or arbitrary package files are searched. Recheck relevant heads before submission."
},
"scientific_replays": "Not rerun; this is navigation only.",
"author": "Cinna Davis with substantial OpenAI Codex assistance"
}
93 changes: 93 additions & 0 deletions docs/research/two-full-controller-contract-map.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,93 @@
# Two-FULL controller contracts

This is navigation across scoped results, checked against canonical main
`b91956876e5b4122fd89179f1b57557ff8378f15` on October 23, 2026. It neither
replays nor scientifically accepts the cited proofs. The selected conditional
κ remains [60403/20000000](../../certificates/selected-result.json). The
[source receipt](two-full-controller-contract-map.json) pins the exact inputs
and assignment context; later PR status does not change those frozen sources.

A FULL is a complete native invocation, including its main and productive
helper outputs. A controller joins such invocations to produce independent
target jobs. An attractive formal invoice still needs its declared endpoint,
actual source frames, independent input owners and a complete recursive bill.

## Which result covers which contract

| Source | Contract actually covered | Result and boundary |
|---|---|---|
| [Two changed central functions](../../research/two-full-central-obstruction/README.md), original theorem | Two main owners; arbitrary owner controls over the specified separated central-monomial/transverse algebra; source helpers remain autonomous and untouched; restored dirty scratch is permitted. | The two independent nonmonomial main targets cannot both be completed. This does not permit spending existing transformed helper values as identity scratch. |
| [The same package's full-routing addendum](../../research/two-full-central-obstruction/README.md#addendum-full-monomial-routing-on-exactly-two-owners) | Full monomial Clifford interstage routing, including central/fresh mixing, with exactly two main owners and no access to other states. | The lower-grade purity argument excludes the two rank-seventeen targets. Its full-routing permission and the original theorem's additional scratch are separate scopes. |
| [Retained productive helpers](../../research/two-full-retained-helper-ceiling/README.md) | Two main owners plus distinct simultaneous helper jobs and restored B-valued spectators; every helper job must remain a distinct output; controls retain central/transverse separation. | A projected-rank obstruction excludes the endpoint. This is neither the exactly-two-owner full-routing theorem nor a theorem about an arbitrary joint 224-main-owner controller. |
| [PR4966 paid-site precision proof](https://github.com/Lyy-iiis/integer-mult-bounds/blob/039b6ea51ab7a7efb38fc6851f345839683251b0/research/two-full-border-paid-precision/paid-sensitivity/PROOF.md) | The actual round-three Laurent border; independent per-paid-site operator errors; the explicitly declared leading cost linear in precision. | Main-visible rank-one faults alone reject the concave moment under that policy. This does not exclude correlated, adaptive or differently priced implementations. |
| [PR4966 inverse-interface proof](https://github.com/Lyy-iiis/integer-mult-bounds/blob/039b6ea51ab7a7efb38fc6851f345839683251b0/research/two-full-border-paid-precision/inverse-interface/PROOF.md) | Each persistent child exposes the inverse of its same realization at the same declared rank charge; deterministic owned centers are recomputed on unchanged capture fields. | Exact persistent inverse recipes retain the paid profile. The other retained source orientation is not automatically that actual inverse, and an inverse does not supply the second fresh-D caller or linear Gaussian identities. |
| [PR4983 scalar compatibility](https://github.com/1337isnot1337/integer-mult-bounds/blob/acb28c0b5708d0aee91e457050c973e3df476fa4/research/coherent-frame-additivity/PROOF.md) | A gatewise proof using one shared potential per frame, unchanged scalar ADDs and arbitrary persistent inputs. | Every active frame in each source orientation must have an additive potential. Nonlinear inverse/warp compatibility alone is insufficient. This does not exclude a different global correlated-error argument or a changed scalar circuit. |

The first two source packages are retained on the pinned main. PR4966 and
PR4983 are separately pinned submissions; their inclusion here is a pointer,
not a maintainer acceptance or selected-frontier update. Their source notices
identify author checks and any separately performed review. A submitted
checker pass does not change the quantifiers of its written proof.

## Contract checks before a new experiment

First name the actual native source and the main input/output owners. The
central-obstruction and retained-helper packages bind the #4610 native source
at `20bb93cd990d2ff683e4d0fc56b87a42cd5d3296`. The precision and inverse
proofs instead consume the round-three `ACTUAL-WORD.json.gz`, whose compressed
SHA256 is
`7679daa4ec6a40f56fc7f0202379a6f454310e94945aba4f48beaaaafb838d05`.
Do not transfer an invoice or a source-normalizer identity between them
without checking the actual version and interface.

Then state which helpers may be touched, whether their original outputs are
retained, and what scratch must be returned. Extra helper owners change the
exactly-two-owner contract. Allowing address mixing changes the separated
algebra contract. Two source relaxations proved in different theorems cannot
simply be joined into one stronger exclusion.

For a Laurent approximation, distinguish its formal exact algebraic identity,
its error model, and the leading precision tariff. Deterministic inverses can
correlate errors without restoring Gaussian/frame identities. A coherent
potential proposal must address the actual scalar gates as well as paid and
warp transitions. Changing the scalar gates, using nonlinear potentials, or
allowing a quantitative scalar defect requires its own caller and bill.

Finally price all target, helper, center, correction, return and precision
work. A passing optimistic moment is a reason to continue the endpoint test;
an impossible endpoint cannot be repaired by a more accurate evaluation of
that same invoice. Conversely a scoped negative moment does not establish
the failure of a different cost model.

## Open changed contracts

The retained-helper source explicitly leaves literal central/fresh monomial
routing that preserves both distinct helper jobs open. Begin with the actual
forward/backward owner frames: the rank-one X entrance and empty Y/helper
entrance differ. Price every conversion and cleanup before a routing search.
The full-routing main-only addendum does not already close that helper access.

The inverse-interface source leaves a Gaussian-compatible paired caller with
both independent fresh D factors open. An additive coherent realization must
satisfy its paid and warp relations with a complete precision/storage bill.
A nonlinear realization could instead change its scalar circuit or bound and
pay scalar defects; no such implementation follows from invertibility alone.

These are source-stated remaining obligations, not recommendations that a
particular mechanism will improve κ. Recheck live discussions and PR heads
before claiming or expanding either route.

## Attribution and validation

Chris R / Clear1nsight's packages retain their source, algebra, accounting and
review contributor notices. Yiyang (@Lyy-iiis) supplies the paid-site precision
and inverse-interface work. Cao Yifan supplies the round-three actual word;
the native, E8/Clifford, controller, compiler and outer predecessor credit
remains in the original notices. Cinna Davis supplies the additive-frame
boundary and this navigation; all cited AI-assistance disclosures remain.

The documentation check resolves every relative link/anchor, authenticates the
receipt's Git blobs and SHA256 values, and compares the named source scopes.
No scientific verifier, selected cold replay, Lean or physical suite was rerun
for this map. Prepared by Cinna Davis with substantial OpenAI Codex assistance.
Apache-2.0. No independent human review is claimed.