Skip to content
Open
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
52 changes: 52 additions & 0 deletions research/complex-contact-recharting-bound/INDEPENDENT-REVIEW.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,52 @@
# Independent full-corridor review and integration receipt

## Scope and method

A separate research worker rebuilt the pinned source with an independent
visit parser, union-find construction and finite-field subspace implementation.
It derived public floors and caps without importing the primary solver's
domains, then enumerated all mixed growth/shrink choices and checked owned
comparability in both directions. The portable scientific core of that review
is `independent.py`. It does not execute the primary `core.py` or `solver.py`.

The integration wrapper compares the complete profile multiset, not only the
optimum: 96 variables, 77 factors, 253 raw factor assignments and 214 legal
assignments. All profiles agree. The independent inventory has 6,232 ascending
public MOVEs, 23 ascending owned MOVEs and 24 descending owned MOVEs. Public
edges alone may be used for monotone boundary propagation. There are 13 edges
between growth and shrink variables; separate one-direction checks would not
prove the combined result.

## Mathematical checks

The original source chart belongs to every enumerated domain. Subspaces in
each floor/cap interval are enumerated completely through its quotient; the
quotient dimensions are at most 3. Every affected MOVE is assigned to exactly
one connected factor. The checker rejects illegal public containment and
checks owned comparability in either orientation. All factor maxima are zero
for each of the nine tariffs `min(r,k)`.

The nonnegative cone decomposition in `PROOF.md` extends those exact integer
inequalities to all increasing concave tariffs. The rank inequality for the
symplectic mixing block gives a dimension-gap lower bound for any actual
quotient, while ordinary maps and their phase, address, lifecycle and precision
costs are optimistically free. No assertion that a rank-zero quotient is the
identity is used. The theorem is restricted to fixed template positions; it
does not prove all-column multiplicity scaling or admit a full supplier.

## Controls and complete invoice

The same primary optimizer accepts the older canonical positive control with
exact `min(r,2)` saving 1 and paid delta {1:+1,2:-2,3:+1}. This improvement is
already in #7481. The main wrapper rejects a mutated source in both parsers and
a false ownership flag. Its full caller recount matches all target and paid
entries, not just totals: 17 calls, 22,461 targets, 110,519 paid jobs.

An earlier exploratory review accidentally labelled a decimal power-price
value as the integer-tariff result. The reviewer corrected it: the integer
tariff saving is exactly 1. No decimal power-price estimate is needed or used
by this published proof or verifier.

The review and integration are OpenAI-assisted algorithmic cross-checks for
@CubeJerry, not independent human acceptance or a proof-assistant theorem.
`VALIDATION.json` records the final executed package checks.
201 changes: 201 additions & 0 deletions research/complex-contact-recharting-bound/LICENSE
Original file line number Diff line number Diff line change
@@ -0,0 +1,201 @@
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/

TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION

1. Definitions.

"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.

"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.

"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.

"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.

"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.

"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.

"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).

"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.

"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."

"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.

2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.

3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.

4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:

(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and

(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and

(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and

(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.

You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.

5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.

6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.

7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.

8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.

9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.

END OF TERMS AND CONDITIONS

APPENDIX: How to apply the Apache License to your work.

To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "[]"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.

Copyright [yyyy] [name of copyright owner]

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
15 changes: 15 additions & 0 deletions research/complex-contact-recharting-bound/NOTICE
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
Complete contact-preserving frame obstruction
Prepared for Jerry Chen / CubeJerry, with substantial OpenAI assistance.
Copyright 2026 respective contributors. Licensed under Apache-2.0.

The exact native source and caller are from Clear1nsight's #7481 and its
credited predecessors. Canonical grammar and historical positive control are
from CrocSwap/integer-mult-bounds at the exact base in SOURCES.json.
Retain inputs/NOTICE-pr7481 and inputs/NOTICE-canonical in full. They preserve
the original credits, including Clear1nsight, Rohan Arun, ToikY, CubeJerry,
Douglas Colkitt and the nested source contributors as stated there.

Prior common-frame/local-domain studies #7454, #7458, #7459 and #7453 and the
input/output rechart lineage #7122 and #7277 retain their credit. The new work
is the complete public-corridor reduction, joint factor enumeration, exact
concave-cone proof, independent full profile replay and caller-bound package.
52 changes: 52 additions & 0 deletions research/complex-contact-recharting-bound/PR-DESCRIPTION.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,52 @@
## Summary

This proves a complete, source-scoped obstruction to improving the #7481
native word by simultaneous frame changes with its scalar contacts and external
boundaries fixed. Every admissible per-component canonical subspace choice has
nonpositive paid saving for every increasing concave rank tariff. The unchanged
assignment attains zero. **No new kappa** is claimed.

Public boundary paths reduce the full class to 96 variable components and 77
interaction factors. The package exhausts 253 factor assignments, including all
214 legal profiles and all 13 growth/shrink interaction edges. Main, helper and
owned visits are included; owned edges may reverse nesting. Zero recursive rank
is allowed optimistically without treating the ordinary quotient as identity.

This extends the restricted domains in #7454, #7458, #7459 and #7453. It credits
the native/caller work in #7481, the #7122/#7277 rechart lineage and all retained
source notices. The known earlier canonical gain is already incorporated and
appears only as a positive control.

## Verification

Canonical base: `e54523517d0f03e58352e647c403a5af3e525a57`.
Exact #7481 source: `89eaa9d8cae37c1540de98f2d29a3abaabb96a2b`.
All original paths, blobs and SHA256 pins are in `SOURCES.json`; all runtime
inputs are bundled. Two separately implemented source parsers and subspace
enumerators agree on every legal profile. Exact checks of the nine tariffs
`min(r,k)` prove the entire concave cone by nonnegative linear combination.

```sh
python3 scripts/research_package.py --package research/complex-contact-recharting-bound
```

Expected status: `PASS_COMPLETE_CONTACT_RECHARTING_INDEPENDENT_REPLAY`.
The registered normal and optimized replays also rebuild the exact complete
17-call target/paid invoice and run source/ownership rejection controls. The
same optimizer finds exact positive-control saving 1 at `min(r,2)` on the
older canonical source. See `VALIDATION.json` for executed final checks and
`INDEPENDENT-REVIEW.md` for the separate algorithmic review.

## Limitations and credit

The source is an unselected comparator; this package does not admit its
claimed bound. Scalar coefficients, operands, chronology, contact equalities,
external frames, owners and lifetimes are fixed. Changed contacts, productive
boundaries, histories, source compression and broader frame grammars remain
open. All five foundational assumptions and whole-job multiplicity conventions
remain inherited; there is no new unconditional multiplication theorem.

Prepared for Jerry Chen / @CubeJerry with substantial OpenAI assistance in
research, separate implementations, adversarial review and packaging. Retain
all predecessor credits and notices. Full proof, source pins, controls and open
questions are in `research/complex-contact-recharting-bound/`.
Loading
Loading