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
3 changes: 3 additions & 0 deletions research/sol1337-global-centre-cut/.gitattributes
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
# Preserve authenticated predecessor bytes, including their CRLF line endings.
vendor/dynamic_neighbors.cpp -text
vendor/neighbors.hpp -text
37 changes: 37 additions & 0 deletions research/sol1337-global-centre-cut/BUDGET.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
# Research decision and optimistic bill

The assigned changed premise was coordinated retagging across different original
chart groups of the actual retained640 centre contact graph. PR4867 had closed
single, adjacent coherent pair and arbitrary-subset/single-original-group moves;
it had not permitted all 184 choices simultaneously across original groups.
The prospective scope and fixed invoice were sent to the parent before the sweep.
A public claim was not posted before the sweep finished; this file is retained
local decision evidence, not a retrospective public claim.

The paid-only optimistic test keeps `{1:2201,2:412,3:510,4:127,5:40,8:8}` and
all helper targets `{4:28,7:7,8:47,9:326}` until actual edge repricing. It retains
all 640 original boundary charts, every native map and scalar operation, and
zero independent centre reward. Only 184 actual contact charts are variable.
Each chooses old or T_a(old), with one common declared ambient nonzero axis a.
There are 262143 such axes; the nine-chart common intersection is zero.

The potentially problematic eight rank-eight edges are all singleton leaves,
so conditional leaf elimination exactly reduces every tariff to a cut on 176
empty-chart contacts. A 4096-axis benchmark found only 145 distinct rank-energy
configurations and finished 1450 cuts in 0.15s. This justified all nine integer
prefix tariffs in the complete domain: the final 419 configurations and 4190
cuts finish in a few seconds. No search seeds, random restarts or unbounded
expansion were used.

Result: every prefix optimum is zero, hence no strict paid-moment improvement
for any 0<theta<1. Stop at this decision. No physical supplier construction is
warranted by this grammar. Native phase/word implementation, all 640 arbitrary
primal/raw-dual checks, source-bound owned caller, compiler/precision and outer
funding remain additional obligations, unrun here. There is no positive invoice
to justify launching them. The frozen inputs and selected result are unchanged.

A precisely declared independent/mixed-axis grammar or changed source operation
or caller demand could change the decision. Another common-axis subset or seed
cannot; the complete family is already covered. Do not manufacture a peripheral
PR from this negative extension; root review decides whether to archive or leave
it as compact decision evidence.
201 changes: 201 additions & 0 deletions research/sol1337-global-centre-cut/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.
8 changes: 8 additions & 0 deletions research/sol1337-global-centre-cut/NOTICE.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
Apache-2.0. New graph binding, complete changed-center screens, cut certificates
and written paid-moment argument prepared for Chris R with substantial OpenAI
Codex assistance. Retained exact-byte source files in vendor/ come from Cinna
Davis #4694/#4690 and Dugongue #4841; original headers and assistance disclosures
are preserved. The native payload is Cao Yifan #4610's frozen round-three word.
Retain all original #4470, native Gaussian/Clifford, helper, scalar, precision,
compiler and outer contributor attribution. No predecessor scientific admission
or independent human proof review is asserted by this package.
78 changes: 78 additions & 0 deletions research/sol1337-global-centre-cut/PAIRS-ADDENDUM.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,78 @@
# Independent distance-one neighbours on any adjacent internal pair

This additive result preserves every original common-axis scientific file.
The source-bound pair proof is [pairs/PROOF.md](pairs/PROOF.md), produced by
the separately assigned shared-producer agent. All eight producer scientific
and handoff files are retained byte-for-byte, authenticated in pairs/ORIGIN.json.
The copied original source receipt records their hashes and the exact freshly
regenerated graph. The new wrapper adapts execution paths only: the original
producer Python writes its outputs in scratch, and tracked receipts stay fixed.

The combined result covers a second grammar: choose any one of the 264 actual
internal edges and independently replace both endpoint charts by arbitrary
nontrivial distance-one Lagrangian neighbours. This grammar does not require
that their axes agree. All 640 owners/endpoints, native maps and scalar
operations, 408 helper targets and every incident paid transition remain fixed;
there is zero independent centre reward.

For the 256 rank-zero edges, each original chart has 511 hyperplanes and two
neighbours per hyperplane. Identical new charts are inherited from PR4867's
coherent-pair result. The original exact single/coherent-pair receipts are
source-pinned and their complete concave-prefix class bounds are replayed here;
their old neighbourhood searches are not rerun or claimed as new.

The new direct C++ screen covers all 261,632 assignments to opposite neighbours
above the same hyperplane: 1,831,424 exact incident-edge rank calculations yield
44 complete histogram classes. An independent Python implementation imports no
predecessor rank engine and combines complete single-endpoint bills with the
shared-edge correction. It exactly reproduces every class and multiplicity.
All classes dominate `3H1 + H7 - H8` in the nine integer-prefix tariffs, so
paid loss is at least `3 + 7^theta - 8^theta >= 2` for `0<=theta<=1`.

For different hyperplanes, the new charts have distance two. The inherited
single-contact loss and a simple shared-edge census give

```
Delta >= 2*(1+7^theta-8^theta) - 2 + 2^theta
>= 2 - 2^theta > 0 (0<=theta<1).
```

The eight rank-eight edges have degree-four endpoints and no parallel shared
edge. At each endpoint, at least two external edges originally have rank zero;
the remaining external edge has rank at most two. Both changed endpoints
therefore cost at least two jointly outside the shared edge, whose rank remains
at least six. Even granting independent best cases for all these obligations,

```
Delta >= 2 + 6^theta - 8^theta >= 2 - 2^theta > 0
(0<=theta<1).
```

Their full nominal 8,355,872 independent-neighbour assignments were **not
scanned**: this complete optimistic bill stops the route analytically. The
actual eight edge inventories are regenerated and compared exactly against
pairs/RANK8-CENSUS.json. The written proof supplies the metric/concavity
implications; the finite screen and census provide their source-specific data.
Thus every nontrivial independent-neighbour move on any one actual adjacent
internal pair strictly loses for `0<=theta<1`. No strict endpoint claim at
theta=1, changed word/target, larger independent block or new kappa is supplied.

Direct replay, requiring Python3 and C++20 g++:

```
python3 -I -W error -B research/sol1337-global-centre-cut/verify_pairs.py
python3 -I -O -W error -B research/sol1337-global-centre-cut/verify_pairs.py
```

Expected output is `PASS_INDEPENDENT_ADJACENT_PAIRS opposite_cases=261632
profiles=44 rank0_edges=256 rank8_edges=8 graph_controls=3`. The wrapper also
checks the actual C++ entry point rejects a negative paid sign, nonidentity
shared map and an inconsistent simple-edge domain. The original Python's
same/opposite-neighbour and unsupported rank-inventory controls remain active.

Credit PR4867's Cinna Davis/Cao Yifan/David Ganz lineage, the separate producer
agent's exact screen and analytic extension, and Nick Petalas PR4864's general
tuple/cycle geometry. Source attribution and substantial OpenAI Codex assistance
are retained. No predecessor scientific source or original common-axis result
was edited. Primary research toward higher kappa proceeds through a different
changed-operation/complete-invoice gate; no further graph search is proposed.
Loading