diff --git a/research/p104-public-relation-family-bound/INDEPENDENT-REVIEW.md b/research/p104-public-relation-family-bound/INDEPENDENT-REVIEW.md new file mode 100644 index 0000000000..f8cd7f4bf9 --- /dev/null +++ b/research/p104-public-relation-family-bound/INDEPENDENT-REVIEW.md @@ -0,0 +1,105 @@ +# Independent mathematical acceptance of the two-dimensional relation family + +I accept the source-bound classification, original-coordinate funding table +and separately conditional preparation corollary as stated in the final text +with SHA256 +`8069a088ae749255889a581ab3a104e0ad673009d5d79dfa6641c3d5a54073bf`. +The root and portable copies agree. No remaining mathematical objection was +found under their explicit hypotheses. This is a separate proof review; +the root's fresh source/support/rank/eleven-control replay remains its own +computational evidence. I did not repeat a heavy source or intersection census. + +## Exhaustion of the relation subspaces + +Let g=e885-e705, h=e1459 and L=span(g,h). Every subspace is zero, the full +plane, the line span(h), or a unique line span(g+lambda*h). The last form +includes lambda=0 and all finite nonzero values over the stated field. + +Isolation of the e885 coefficient restricts any coframe containing a vector +with nonzero g coefficient to 3 or 189. Frame 3 consists of coordinate initials +and lacks 705, so its intersection with L is zero. Thus every finite-lambda +line can affect only 189. There its unique expression is + + g+lambda*h = r40710-r40708+lambda*r_initial1459. + +The two arrival coefficients are fixed nonzero numbers. Hence40710 remains +the unique latest support for every lambda, with no exceptional cancellation +and no singleton support. It is the sole rank-eight cache and no MOVE is zero. +This is a symbolic support argument, not extrapolation from sampled lambda. + +The final added h paragraph is essential and correct. Its support is confined +to the initial unit in 189 and two arrivals in 127. Inside127, + + h=r45748-(1/4)*r52233-r52236 + +is unique by original-family independence. All three coefficients are nonzero; +52236 is latest and no single MOVE lies in span(h). Thus h=0 has exactly +that rank-one cache and no zero MOVE. The earlier draft referred to this as +already proved without displaying it; the pinned final text repairs that gap +and removes the need for an external singleton theorem. + +For the full plane, every coframe other than189 sees at most span(h), so +the preceding classification covers it. In189 use original-family coordinates +for(initial h, r40708, r40710). The relation space is generated by +(1,0,0) and(0,-1,1). Only the initial generator itself lies in that plane; +neither MOVE basis row does. Quotienting kills the initial h and makes40710 +equal40708, with no additional dependency. The full plane therefore has +exactly the two stated nonzero caches and no zero MOVE. Zero R has no effect +by the original full-row-rank certificate. All subspace cases are exhausted. + +## Exact minimum debit + +Surjectivity onto jointly retained original coordinate inputs implies that +restriction of R to the lost columns is injective. Otherwise a nonzero +relation supported only on retained coordinates would constrain arbitrary +retained inputs. Losing extra coordinates outside the support cannot help. + +For span(g), at least one of 705/885 is lost, costing f(8). For a nonzero +lambda line,1459 is an available nonzero column and gives the minimum f(1); +choosing a rank-eight pivot costs at least f(8). For span(h), 1459 is required. +For the full plane the restriction matrix has columns(-1,0),(1,0),(0,1), +so full rank requires 1459 and at least one of 705/885. These conditions are +also sufficient as algebraic free-initialization relations. Thus every +minimum debit and information-only gain in the table is correct. The tie +at kappa=1 is harmless, with the explicit f(0)=0 convention. + +In particular, the nonzero-lambda information gain f(8)-f(1) may be positive. +It must not be conflated with the nonpositive conditional implementation +conclusion. Supplied correlated initial inputs remain an explicit exception. + +## The preparation corollary is valid within its narrower access model + +For the cheapest pivot,1459's initial correlated value is unavailable and +must be prepared. Interpret the scalar probe as the family obtained by +multiplying its direction by an arbitrary whole input array Z. The original +nonempty-frame providers are then independent of Z before 40710, except for +the unavailable demoted resource; 885 in empty frame 3 carries the dependence. +This follows from the fixed original history and no885 donor use, rather +than from the mere nonzero value of a single numerical input. + +In the explicit fixed coframed dataflow model, dependence must reach 189 on +a charged new transport path. Along such a path the canonical frame maps +telescope from the empty frame to 189. Scalar coframed operations and +monomial adapters do not supply an unpaid frame channel. The complete +source-to-destination Fourier rank is 8; row-support submultiplicativity +therefore forces the sum of paid path ranks to be at least 8. Increasing +subadditivity gives at least f(8) path cost. Fanout or reuse cannot reduce +the whole added bill below one compulsory path. This yields -f(1) for the +cheap-pivot line. All other table cases are already nonpositive before +preparation; extra costs cannot improve them. + +The exclusions added to the final text matter: no input-dependent control +or descriptor channel, no new payload in already-paid original carriers, +no ordinary alternative frame algorithm, and no additional free original-job +credits from newly prepared scratch. Without these restrictions this is not +a general Turing-machine preparation lower bound. The proof correctly labels +the corollary separately and does not remove the native/owned/compiler/ +precision/analytic foundations or claim a new kappa. + +The lightweight exact fixtures in checks.py test the full-plane lost-column +criterion, local basis/quotient incidence and the distinction between the +positive information allowance and the negative transport-charged budget. +They corroborate algebraic steps only; the universal argument is above. + +Prepared for Jerry Chen / CubeJerry with substantial OpenAI assistance. +Independent agent review is not human or formal-kernel acceptance. diff --git a/research/p104-public-relation-family-bound/LICENSE b/research/p104-public-relation-family-bound/LICENSE new file mode 100644 index 0000000000..261eeb9e9f --- /dev/null +++ b/research/p104-public-relation-family-bound/LICENSE @@ -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. diff --git a/research/p104-public-relation-family-bound/NOTICE b/research/p104-public-relation-family-bound/NOTICE new file mode 100644 index 0000000000..eeb956dab8 --- /dev/null +++ b/research/p104-public-relation-family-bound/NOTICE @@ -0,0 +1,18 @@ +Integer multiplication research contribution +Prepared for Jerry Chen / CubeJerry, 2026. +Substantial OpenAI assistance was used for research, code, review and writing. +New material is under the repository Apache-2.0 license. + +The exact native source is from Clear1nsight/integer-mult-bounds, commit +89eaa9d8cae37c1540de98f2d29a3abaabb96a2b, originating in +CrocSwap/integer-mult-bounds#7481. Its complete original notice is retained +as inputs/PREDECESSOR-NOTICE. + +inputs/all_history_independent.py is retained byte-for-byte from the +CubeJerry all-history package, commit fdbb41450a98594bdf1f5fe4535e77d2466adb4f, +prepared for Jerry Chen with substantial OpenAI assistance. Its source-only +full-row-rank theorem and implementation are credited, not newly claimed. + +The earlier single-relation and initial-access audit are preserved at the +recovery checkpoint08e336f6f0ffaaad2862c8d14fdb6efc86b73d0e. A stopped general +intersection census is not counted as evidence for this support proof. diff --git a/research/p104-public-relation-family-bound/OPEN-QUESTIONS.md b/research/p104-public-relation-family-bound/OPEN-QUESTIONS.md new file mode 100644 index 0000000000..211dcc1805 --- /dev/null +++ b/research/p104-public-relation-family-bound/OPEN-QUESTIONS.md @@ -0,0 +1,16 @@ +# Open next questions + +1. Can the correlated1459 entrance value be obtained within a complete paid + producer interface? This determines whether the positive f8-f1 allowance + can be used. First specify the actual available inputs, owner lifecycle, + transport, backing and precision; final-target debit alone is insufficient. +2. Can an additional original-carrier edit change the history obstruction? + The present histories are fixed. First emit an exact changed word and + full caller bill. Existing paid payloads cannot silently absorb new work. +3. Do other helper relation spaces admit useful simultaneous credits? This + two-dimensional plane is exhausted only under its declared model. First + identify a nonoverlapping relation space and prove original-target + surjectivity before optimizing its moment. +4. Can a public exact-zero transition be admitted in the compiler with its + actual physical layout/ownership contract? No free public CLEAR or retag + is inferred here. A source-specific typed extension and cost are required. diff --git a/research/p104-public-relation-family-bound/PR-DESCRIPTION.md b/research/p104-public-relation-family-bound/PR-DESCRIPTION.md new file mode 100644 index 0000000000..0e257bc038 --- /dev/null +++ b/research/p104-public-relation-family-bound/PR-DESCRIPTION.md @@ -0,0 +1,66 @@ +## What this changes and why it matters + +The most favorable individual public-cache price in the exact #7481 word is +at MOVE40710. A single promising relation does not determine whether nearby +relations create extra credits or retain original helper outputs. This +package classifies every scalar-linear helper promise with annihilator in +span(e885-e705,e1459), with unchanged original histories and arbitrary mains. + +## Exact result and novelty + +Every line span(g+lambda h), including lambda=0, has exactly the rank 8 cache40710; the h-only +line has exactly rank 1 cache52236; the full plane has both and no other cache. +No subspace creates a zero MOVE. The original-target debits exactly cancel +all allowances except a nonzero-slope line's optimistic f8-f1. Exact support +isolation and unique circuits prove this uniformly over real or complex +parameters, extending the earlier single-relation checks without relying on +a finite parameter search. + +The preparation corollary is explicitly conditional: if the correlated +initial 1459 value is unavailable free and new cross-frame dependencies use +separately billed whole jobs with unchanged original payloads and no unbilled +control/descriptor channel between frames, rank 8 transport +removes the cheap pivot's gain. Losing final target credit alone does not +imply that input-access premise. + +## Sources and predecessor credit + +Canonical base: e54523517d0f03e58352e647c403a5af3e525a57. +Native: #7481 at 89eaa9d8cae37c1540de98f2d29a3abaabb96a2b, retained exact +bytes and Clear1nsight notice. The original-history theorem and byte-identical +rank helper are credited to [the verified predecessor commit](https://github.com/CubeJerry/integer-mult-bounds/commit/fdbb41450a98594bdf1f5fe4535e77d2466adb4f). +The earlier single-promise and initial-access investigations are preserved +in [checkpoint13](https://github.com/CubeJerry/integer-mult-bounds/tree/08e336f6f0ffaaad2862c8d14fdb6efc86b73d0e/research/kappa-swarm-20261113/evidence). +The abandoned intersection census is not claimed as evidence. + +## Reproduction and checks + +```sh +python3 -I -W error -B research/p104-public-relation-family-bound/verify.py +python3 -O -I -W error -B research/p104-public-relation-family-bound/verify.py +python3 -B scripts/research_package.py --package research/p104-public-relation-family-bound +``` + +Expected status: PASS_COMPLETE_TWO_DIMENSIONAL_PUBLIC_RELATION_CLASSIFICATION. +The source-only verifier checks all 76,475 events,7,780 observations,979 +coframes, complete support isolation, two exact circuits and original target +ranks. A modular rank certificate reaches the literal row-count upper bound, +which proves full rational rank. Eleven executed failure controls exercise +source mutation, missing/added observations, wrong signs/coframes/latest +members and invalid debit choices. A separate mathematical review accepts all projective-line/full-plane cases, +the original-coordinate debit criterion and the narrowly conditional transport +corollary. Its exact basis/lost-column fixtures are registered too. Execution +receipts and the full independent review are included with the package. + +## Limitations and kappa status + +No new kappa. No selected certificate or shared compiler is changed. No +physical cache implementation or global assumption discharge is claimed. +Other relation spaces, changed producers, freely supplied correlated inputs, +block operators and alternative frame algorithms are outside scope. All five +foundational assumptions remain. Open next questions are in the package. + +Prepared for Jerry Chen / @CubeJerry with substantial OpenAI assistance in +research, implementation, adversarial review and writing. Prior source and +verifier authors retain credit; no independent human or formal-kernel +acceptance is implied. diff --git a/research/p104-public-relation-family-bound/PROOF.md b/research/p104-public-relation-family-bound/PROOF.md new file mode 100644 index 0000000000..081620bef5 --- /dev/null +++ b/research/p104-public-relation-family-bound/PROOF.md @@ -0,0 +1,204 @@ +# Classify the entire two-dimensional relation space at the cheapest public cache + +Source-bound theorem and separately conditional preparation corollary. +Prepared for Jerry Chen / CubeJerry with substantial OpenAI assistance. + +## Source, inherited certificates and exact scope + +Use the unchanged #7481 word with SHA256 +`acee323696b18914bd863d55341f92112b48d3d1dc1443c276efb6c396fcc0a9`. +Write g=e885-e705, h=e1459 and L=span(g,h). Consider exactly the scalar-linear +helper promises whose annihilator R is a subspace of L. Main inputs remain +arbitrary and independent. All other inputs range over the full kernel of R. +Instructions, event clocks, physical coframes and whole MOVE targets stay +fixed. Histories contain only strict earlier original observations. + +The published all-history theorem at fork commit +`fdbb41450a98594bdf1f5fe4535e77d2466adb4f` proves independence of all 7,780 +original observations across 979 coframes. This package reconstructs the +full exact-rational source rows and rechecks that rank certificate using its +byte-identical credited column-rank helper. Every other fact needed below is +reconstructed directly from the bundled word; the later singleton census is +credited as related work, not a runtime or theorem dependency. + +## A support isolation lemma replaces an expensive parameter census + +Owner885 has exactly four original touches: + +| Event | Instruction | +| --- | --- | +|30780|ADD into885 from 943, coefficient1/2, frame 3| +|40710|MOVE885 from 3 to189| +|40711|ADD into885 from 705, coefficient-1/2, frame 189| +|41698|ADD into885 from 943, coefficient-1/2, frame 189| + +It is never an ADD/COPY donor. Induction on the source instructions implies +that no other field ever acquires a nonzero e885 coefficient. Thus the only +original history generators containing e885 are its initial row in frame 3 +and its arrival at 40710 in frame 189. Frame3 has no MOVE arrivals at all; its +history consists solely of its1,060 original coordinate units. Neither705 +nor1459 initially has frame 3 (their frames are105 and 189). + +Consequently, a vector g+lambda*h cannot lie in any final coframe span other +than189: every other frame except3 lacks e885 entirely, and frame 3 lacks the +mandatory e705 coefficient. This is uniform over every scalar lambda. It is +not inferred from checking a finite list of parameters. + +Exact source replay gives the frame 189 rows + + r_initial1459 = h, + r40708 = e705+e943, + r40710 = e885+e943. + +Therefore + + g+lambda*h = r40710-r40708+lambda*r_initial1459. + +The full frame 189 family is independent, so this representation is unique. +Its latest nonzero support member is always40710, including lambda=0. + +## One-circuit criterion and every one-dimensional promise + +Let B be an independent chronological observation family and let a nonzero +relation u belong to span(B). Its unique expression in B is the only new +dependency after quotienting by span(u). A MOVE arrival becomes recoverable +from strict earlier observations exactly when it is the latest nonzero +support member of that expression. A row vanishes individually exactly when +the expression has singleton support. If u is outside the final span, no +prefix changes rank at all. + +Apply this to u=g+lambda*h. The sole new cached MOVE is40710, of rank 8; no +MOVE is zero. The actual decoder identity under the promise is + + r40710 = r40708-lambda*r_initial1459. + +All providers are strictly earlier and in the exact same physical frame 189. +There are no exceptional finite lambda values creating another cache. The +remaining projective direction is span(h). Fresh source replay shows that +the only observations with a nonzero e1459 coefficient are its initial +unit in frame 189 and the arrivals at 45748 (owner 1459) and 52236 (owner 763), +both in frame 127. No other coframe can contain h. Inside frame 127 the exact +circuit is + + h = r45748 - (1/4)*r52233 - r52236. + +The original frame 127 observation family is independent, so this expression +is unique. Its latest nonzero support is52236, and its three-term support +excludes a zero MOVE. Inside189 the unique expression is the initial unit, +which is not a MOVE. Thus h=0 enables exactly the nonzero rank-one cache +at 52236 and no zero MOVE. All three circuit rows are directly reconstructed +and bound to their actual physical frame 127; no saved membership verdict or +separate singleton theorem is needed. + +## The full two-dimensional promise + +For any other coframe P, every vector in P intersect L has zero g coefficient, +because g has the isolated e885 coefficient. Thus P intersect L is contained +in span(h); frame 3 has zero intersection with L. The only effects outside189 +are therefore exactly the effects of h=0 just proved, namely event 52236. + +Inside189, h is an initial generator and g=r40710-r40708. Quotienting by L +kills that initial h generator and makes40710 equal40708. Independence of the +full original family excludes every other new dependency. No MOVE row lies +in L: among the relevant generators only the initial h does. Hence R=L +enables exactly the two nonzero cached MOVEs40710 and 52236, of ranks8 and 1, +and no zero MOVE. R=0 changes no target. This exhausts every subspace of L. + +## Exact original-target funding + +The original helper target ranks are R705=R885=8 and R1459=1. Retain only +original coordinate targets, and fully debit every helper not retained. For +surjectivity onto the retained coordinates, a rank-one relation must have at +least one nonzero coefficient on a debited coordinate. For R=L, the two +relation rows must remain independent on the debited columns. This forces +loss of 1459 and at least one of 705 or885. Extra debits cannot improve the +budget. Write f(r)=r^(1-kappa),0<=kappa<=1, with f(0)=0. + +| Annihilator R | Newly cached MOVE events | Least target debit | Optimistic native gain | +| --- | --- | --- | --- | +|0|none|0|0| +|span(g)|40710|f(8)|0| +|span(g+lambda*h),lambda nonzero|40710|f(1)|f(8)-f(1)| +|span(h)|52236|f(1)|0| +|L|40710,52236|f(8)+f(1)|0| + +These are information-relaxation prices with free correlated initialization, +history backing, ordinary processing and zero reframing. They are not +physical savings or an assembled exponent. In particular the positive line +cannot be dismissed merely by deleting 1459's final target credit: the exact +cache decoder uses1459's initial value. + +## Conditional preparation conclusion + +Add the explicit access contract that retained original885 and 705 are given +at their original entrances while the correlated demoted1459 value is not a +free input resource and must be constructed or separately charged. Freeze +the original producer histories and use a fixed instruction/dataflow schedule +of coframed scalar operations and paid whole native MOVEs. Dataflow fanout is +allowed. Every information dependency crossing frames must follow a charged +transport edge; an input-dependent control/descriptor channel or ordinary +frame algorithm may not bypass that graph. These are restrictions of this +corollary, not an assumption about every Turing-machine implementation. For lambda nonzero the probe + + x885=1, x705=0, x1459=-1/lambda, all other inputs zero + +satisfies the relation. After excluding the demoted initial slot, the only +available nonzero dependence before 40710 is in 885 at empty frame 3. It must +reach dimension-eight frame 189. Every such new path has total integer rank +at least8: a Clifford with Fourier rank r has row support size 2^r, and +composition gives r(UV)<=r(U)+r(V). The source-to-destination rank from +empty frame 3 to189 is8. Increasing subadditivity therefore makes the total +new whole-job price at least f(8). No new payload may be inserted into an +already paid original carrier/job; such a changed producer is outside this +access/transport corollary. The +cheapest-target line then has net gain at most-f(1). Choosing an expensive +pivot705 or885 instead already loses at least f(8), so its information +budget is at mostzero even before preparation. All other rows of the table +also have nonpositive gain before preparation. + +This corollary prices only the original-history cache and zero-MOVE credits +in the table. Intermediate setup scratch is not an additional free history +provider for other original jobs; any such further supplier modification +needs a new credit classification and full invoice. + +Thus no scalar subspace of this particular L improves the native moment +through the classified original-history replacements under that additional +access/transport contract. The unchanged17-call +comparison gains no native price from this modification. This is not an +unconditional preparation lower bound, and does not rule out supplied +correlated inputs, changed producers, other helper relations, cross-call +encodings, ordinary alternative frame algorithms or newly priced target +interfaces. Public zero-reframing still needs its own admitted contract. + +## Verification and limitations + +`verify.py` freshly executes all 76,475 instructions over Q, checking live +owners, coframes, nesting, COPY freshness and final lifetimes. It checks all +7,780 original observation rows, their exact e885/e1459 supports, all four +885 touches, no885 donor use, no frame 3 arrivals, both exact circuits and +original target ranks. Its column certificate reaches every literal bank +row count modulo the proved prime 1,000,033; invertible rational denominators +and the trivial row-count upper bound prove full rank over Q, and therefore +over R and C. Used physical-frame IDs are checked to have no span aliases, +so no phase equivalence is inferred from equal spans. + +The source-support statements and unique-circuit proof establish the infinite +parameter classification. No finite list of lambda values is used as a +universal certificate. The exact two-row restriction matrix establishes the +minimal-debit rule: for a nonzero-lambda line the 1459 column is nonzero; for +the full plane the 1459 column and either705 or885 are necessary and sufficient. + +Executed failure controls reject a changed source byte, an added885 donor, +an unaccounted frame 3 arrival, an omitted1459 observation, a wrong circuit +sign/coframe/latest member, and illegal cheap debit sets. Checks remain +active under optimized Python. Normal, optimized and read-only export +receipts are recorded in VALIDATION.json after execution. + +The abandoned general intersection-census attempt produced no completed +receipt and is not evidence. This support proof replaces that computation. +Only scalar-linear annihilators inside this particular two-dimensional L are +classified. Other relations, block-operator promises, changed producers, +supplied correlated inputs and general frame algorithms remain outside its +scope. No global foundational assumption is removed and there is no new +kappa. Original sources and prior all-history, public-price, singleton-zero +and preparation investigations retain their authorship. diff --git a/research/p104-public-relation-family-bound/README.md b/research/p104-public-relation-family-bound/README.md new file mode 100644 index 0000000000..6e2d1441ee --- /dev/null +++ b/research/p104-public-relation-family-bound/README.md @@ -0,0 +1,74 @@ +# Complete helper-promise classification at public MOVE40710 + +On the exact unselected #7481 native word, write +\(g=e_{885}-e_{705}\), \(h=e_{1459}\) and \(L=\operatorname{span}(g,h)\). +This package classifies **every scalar-linear helper promise whose +annihilator is a subspace of L**, with unchanged native histories and +arbitrary independent main inputs. It proves the classification uniformly +over the real or complex scalars, using exact source-support isolation and +unique circuits rather than sampling parameter values. + +| Promise annihilator | New nonzero cached MOVEs | Least original target debit | +| --- | --- | --- | +| 0 | None | 0 | +| span(g) | 40710, rank 8 | f(8) | +| span(g+lambda h), lambda nonzero | 40710, rank 8 | f(1) | +| span(h) | 52236, rank 1 | f(1) | +| L | 40710 and 52236 | f(8)+f(1) | + +No case produces a zero MOVE. Here f(r)=r^(1-kappa), for 0<=kappa<=1. +All prices are information-relaxation prices for original retained targets. +The only potentially positive allowance is f(8)-f(1), from a nonzero-lambda line, before +constructing the correlated initial value of 1459 and every other physical +cost. + +A **separately conditional corollary** says this entire family cannot improve +the native moment when that initial 1459 value is not supplied free, original +producer histories are fixed, and every new nonzero cross-frame dependency +uses separately billed whole native jobs without adding payload to existing +jobs or using an unbilled control/descriptor channel between frames. A probe then forces rank 8 transport for the cheap1459 pivot. Deleting +1459's final target credit does not itself imply this access premise. + +## Evidence and reproduction + +The standard-library verifier reconstructs all 76,475 events and 7,780 +observations in 979 used physical coframes; checks the two exact circuits, +all support-isolation facts and target ranks; and rechecks the published +full-row-rank certificate. It runs 11 meaningful failure controls. + +```sh +python3 -I -W error -B research/p104-public-relation-family-bound/verify.py +python3 -O -I -W error -B research/p104-public-relation-family-bound/verify.py +python3 -B scripts/research_package.py --package research/p104-public-relation-family-bound +``` + +Expected status: `PASS_COMPLETE_TWO_DIMENSIONAL_PUBLIC_RELATION_CLASSIFICATION`. +No Git, network, saved matrix dump or optional library is needed. The verifier +writes only stdout. A separate mathematical review accepted every subspace, +the exact debit criterion and the conditional transport corollary; its small +exact basis fixtures are also registered in normal and optimized modes. +See PROOF.md, INDEPENDENT-REVIEW.md, SOURCES.json and VALIDATION.json. + +## Scope, provenance and next obligations + +Canonical base: `e54523517d0f03e58352e647c403a5af3e525a57`. +Source #7481 head: `89eaa9d8cae37c1540de98f2d29a3abaabb96a2b`. +The word is unselected; no claimed exponent from that PR is admitted here. +This package builds on the complete original-history theorem at fork commit +`fdbb41450a98594bdf1f5fe4535e77d2466adb4f`, with its rank helper retained +byte-for-byte and credited. The single relation and preparation investigations +are preserved in recovery checkpoint13; the infinite family proof is new. + +There is **no new kappa**, full supplier, physical cache implementation or +foundational assumption discharge. Other helper relation spaces and changed +producers remain open. See OPEN-QUESTIONS.md for precise next obligations. + +Prepared for Jerry Chen / @CubeJerry with substantial OpenAI assistance in +research, implementation, adversarial review and packaging. Retain the +bundled Clear1nsight native notice and credited predecessor verifier. + +## Open next questions + +The initialization resource, changed producer, other relation-space and +public zero-transition obligations are stated with first steps and blockers +in [OPEN-QUESTIONS.md](OPEN-QUESTIONS.md). diff --git a/research/p104-public-relation-family-bound/RESULT.json b/research/p104-public-relation-family-bound/RESULT.json new file mode 100644 index 0000000000..8c58b8929b --- /dev/null +++ b/research/p104-public-relation-family-bound/RESULT.json @@ -0,0 +1,151 @@ +{ + "MOVE_arrivals": 6279, + "certificate_prime": 1000033, + "classification": [ + { + "annihilator": "0", + "least_debit_ranks": [], + "nonzero_cache_events": [], + "zero_MOVE_events": [] + }, + { + "annihilator": "span(g)", + "least_debit_ranks": [ + 8 + ], + "nonzero_cache_events": [ + 40710 + ], + "zero_MOVE_events": [] + }, + { + "annihilator": "span(g+lambda*h), lambda!=0", + "least_debit_ranks": [ + 1 + ], + "nonzero_cache_events": [ + 40710 + ], + "zero_MOVE_events": [] + }, + { + "annihilator": "span(h)", + "least_debit_ranks": [ + 1 + ], + "nonzero_cache_events": [ + 52236 + ], + "zero_MOVE_events": [] + }, + { + "annihilator": "span(g,h)", + "least_debit_ranks": [ + 1, + 8 + ], + "nonzero_cache_events": [ + 40710, + 52236 + ], + "zero_MOVE_events": [] + } + ], + "e1459_observations": [ + [ + -1, + 1459, + 189 + ], + [ + 45748, + 1459, + 127 + ], + [ + 52236, + 763, + 127 + ] + ], + "e885_observations": [ + [ + -1, + 885, + 3 + ], + [ + 40710, + 885, + 189 + ] + ], + "events": 76475, + "executed_failure_controls": [ + "mutated source bytes", + "added885 donor", + "new frame3 arrival", + "omitted1459 observation", + "wrong circuit sign", + "wrong physical coframe", + "omitted latest circuit member", + "incorrect latest event", + "lambda-zero cannot use cheap1459 debit", + "full plane must debit1459", + "full plane also needs a rank8 debit" + ], + "frame3_arrivals": 0, + "frame3_original_units": 1060, + "full_rational_row_rank": 7780, + "g_circuit": [ + [ + [ + 40710, + 885, + 189 + ], + "1" + ], + [ + [ + 40708, + 705, + 189 + ], + "-1" + ] + ], + "h_circuit": [ + [ + [ + 45748, + 1459, + 127 + ], + "1" + ], + [ + [ + 52233, + 557, + 127 + ], + "-1/4" + ], + [ + [ + 52236, + 763, + 127 + ], + "-1" + ] + ], + "observations": 7780, + "physical_coframes": 979, + "proof_scope": "All scalar subspaces over R or C by exact support isolation and unique circuits; no finite parameter search. Physical preparation requires the additional explicit unavailable1459 access and billed transport premises in PROOF.md. No new kappa.", + "rank_helper_sha256": "ddad7c43a02b3df025dba8dd31ea866079cf61ddd00c5f6e1af40461798cf207", + "source_observation_digest": "4f58fe50ea1a09ec1684c34afd8b585cb2071893e8f306624c40ce84f04710eb", + "source_sha256": "acee323696b18914bd863d55341f92112b48d3d1dc1443c276efb6c396fcc0a9", + "status": "PASS_COMPLETE_TWO_DIMENSIONAL_PUBLIC_RELATION_CLASSIFICATION" +} diff --git a/research/p104-public-relation-family-bound/SOURCES.json b/research/p104-public-relation-family-bound/SOURCES.json new file mode 100644 index 0000000000..e50467e69e --- /dev/null +++ b/research/p104-public-relation-family-bound/SOURCES.json @@ -0,0 +1,66 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + }, + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + } + ], + "bundled_external_inputs": [ + { + "path": "research/p104-public-relation-family-bound/inputs/WORD.json.gz", + "source_repository": "Clear1nsight/integer-mult-bounds", + "source_commit": "89eaa9d8cae37c1540de98f2d29a3abaabb96a2b", + "source_path": "research/p104-funded-485-1455-return/producer54/reroute/WORD.json.gz", + "source_git_blob": "77df4ad624f4ed3d4bb5e08b4ac1891534d2261d", + "sha256": "acee323696b18914bd863d55341f92112b48d3d1dc1443c276efb6c396fcc0a9" + }, + { + "path": "research/p104-public-relation-family-bound/inputs/PREDECESSOR-NOTICE", + "source_repository": "Clear1nsight/integer-mult-bounds", + "source_commit": "89eaa9d8cae37c1540de98f2d29a3abaabb96a2b", + "source_path": "research/p104-funded-485-1455-return/NOTICE", + "source_git_blob": "4133e9216529e7a1dbceb092a05db2300305d102", + "sha256": "78e060cbd33ebc4078cabf39e50191a977fb9eb5c41104533079e22da1d9d248" + }, + { + "path": "research/p104-public-relation-family-bound/inputs/all_history_independent.py", + "source_repository": "CubeJerry/integer-mult-bounds", + "source_commit": "fdbb41450a98594bdf1f5fe4535e77d2466adb4f", + "source_path": "research/p104-earlier-destination-cache-bound/all_history_independent.py", + "source_git_blob": "33965272fdc85459392b608d4dccf238d5754d1a", + "sha256": "ddad7c43a02b3df025dba8dd31ea866079cf61ddd00c5f6e1af40461798cf207" + } + ], + "dependency_policy": "Exact native, notice and credited rank helper are bundled. Source-only replay needs no external Git objects, network or result dump. Predecessor commits are provenance, not asserted ancestry.", + "predecessors": [ + { + "pr": "https://github.com/CrocSwap/integer-mult-bounds/pull/7481", + "head": "89eaa9d8cae37c1540de98f2d29a3abaabb96a2b", + "role": "Exact unselected native source." + }, + { + "url": "https://github.com/CubeJerry/integer-mult-bounds/commit/fdbb41450a98594bdf1f5fe4535e77d2466adb4f", + "role": "Published full independence of all original history rows; byte-identical column-rank helper reused." + }, + { + "url": "https://github.com/CubeJerry/integer-mult-bounds/tree/08e336f6f0ffaaad2862c8d14fdb6efc86b73d0e/research/kappa-swarm-20261113/evidence", + "role": "Prior single-relation/public-price/initial-access investigations; unfinished claims remain labelled. This package independently reconstructs the needed source facts." + } + ], + "independent_review": { + "reviewed_proof_sha256": "8069a088ae749255889a581ab3a104e0ad673009d5d79dfa6641c3d5a54073bf", + "review_sha256": "00f47047f2be8304b476fb6c8c78888c89478d0d8e6bbef0957e35a90e7c9abd", + "fixtures_sha256": "2006cd0556a62665dd0ab87d6edf85e5758b918fdc67e755190f8da3a2a787da", + "scope": "Separate mathematical review accepted all scalar subspace cases, minimum original-target debits and the explicitly conditional preparation corollary. Source/rank replay remains the root implementation, with a credited prior rank helper." + } +} diff --git a/research/p104-public-relation-family-bound/TASK.json b/research/p104-public-relation-family-bound/TASK.json new file mode 100644 index 0000000000..63de82cdf5 --- /dev/null +++ b/research/p104-public-relation-family-bound/TASK.json @@ -0,0 +1,107 @@ +{ + "schema_version": 1, + "task_id": "scalar-to-moment", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "scalar-to-moment", + "question": "Can a scalar/frame rewrite improve the complete signed moment through paid jobs, productive targets, or both?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "docs/research/recursive-invoice-preflight.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "Require a legal chronological rewrite and favorable complete signed target-minus-paid moment with all extra charges. Unchanged ADD counts or unchanged paid-call counts alone decide neither success nor failure. Compiler, native and outer admission remain separate obligations.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Construct one legal source-bound rewrite and compare complete before/after P and T. Charge restoration, source windows and owned helpers. A paid call need not disappear: a legal target split or rank redistribution may win. Stop if the signed moment is unchanged or the consumer repays the gain. Do not extend a scalar-only census on ADD counts.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "signed moment", + "target split", + "rank exchange", + "scalar rewrite" + ], + "existing_checks": [ + { + "scope": "PR #3998: consecutive A2 scalar contraction", + "evidence": "research/staged544-a2-graph-rewrite/README.md", + "remaining": "A genuinely changed paid itinerary or a distinct independent audit; no default scalar-only expansion.", + "status": "author-checked", + "source_commit": "389268a6b5e0373a3125d5c6fcd6995f4ea324f5", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4019: separated A2 sites with unchanged recursive histogram", + "evidence": "research/staged544-separated-a2/README.md", + "remaining": "A genuinely changed paid itinerary or a distinct independent audit; no default scalar-only expansion.", + "status": "author-checked", + "source_commit": "f408e09df300b575235f7f77f81948071397e16d", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4112: composition audit", + "evidence": "research/staged544-a2-composition-audit/README.md", + "remaining": "A genuinely changed paid itinerary or a distinct independent audit; no default scalar-only expansion.", + "status": "author-checked", + "source_commit": "205b7380656ba4b6316a8a493b1a3c679b8f7a0e", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4152: A1858 contraction audit", + "evidence": "research/staged544-a1858-contraction-audit/README.md", + "remaining": "A genuinely changed paid itinerary or a distinct independent audit; no default scalar-only expansion.", + "status": "author-checked", + "source_commit": "caaa14cde5962adc372fdca71f63d0f29e73c8b2", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "refined", + "actual_scope": "Classify every scalar annihilator subspace of span(e885-e705,e1459) for original-history cache and zero-MOVE credits, and separate its conditional entrance-preparation cost.", + "scope_change_reason": "The best single-target price allowance occurs at40710; exact source-support isolation makes its complete two-dimensional helper family reviewable without a parameter census.", + "bottleneck_link": "Tests whether the largest one-relation public-cache allowance composes with additional history credit and original-target funding.", + "budget_minutes": 45, + "stop_rule": "Prove the full scalar family through exact supports/circuits; run source-only verification and independent mathematical review. No other relation spaces or changed producers.", + "outcome": "negative-result", + "evidence": "PROOF.md; exact source replay, full original rank, support isolation, two circuits and executed failure controls.", + "author": "Jerry Chen / CubeJerry", + "ai_assistance": "Substantial OpenAI assistance, including separate mathematical review; no independent human or proof-kernel acceptance.", + "open_questions": [ + { + "question": "Can correlated1459 initialization be supplied with a complete paid physical interface?", + "why_it_matters": "The only positive information allowance depends on this resource.", + "first_step": "Specify available inputs and every transport/storage/ownership cost.", + "blocked_by": "Final target debit does not establish initial-resource unavailability." + } + ] +} diff --git a/research/p104-public-relation-family-bound/VALIDATION.json b/research/p104-public-relation-family-bound/VALIDATION.json new file mode 100644 index 0000000000..0b3f50be15 --- /dev/null +++ b/research/p104-public-relation-family-bound/VALIDATION.json @@ -0,0 +1,42 @@ +{ + "status": "PASS_REGISTERED_NORMAL_OPTIMIZED_INDEPENDENT_REVIEW_AND_READ_ONLY_EXPORT", + "canonical_base": "e54523517d0f03e58352e647c403a5af3e525a57", + "scientific_commit": "ff4a33347f838f9215fec9993d40b3ca3ba361b2", + "registered_commands": 4, + "normal_optimized_primary_and_fixtures_equal": true, + "primary_stdout_sha256": "2f05c62c6e6e61c94868e12f386c85562d6c2cf32528df2a57a289eab6cf22f0", + "independent_fixture_stdout_sha256": "58fac3bb34c5e1bb7c68a2db571fa2028a4dc9dbf3ec654ac2dfc448b5a6e021", + "independent_review": { + "status": "ACCEPTED_WITH_EXPLICIT_SCOPE", + "reviewed_proof_sha256": "8069a088ae749255889a581ab3a104e0ad673009d5d79dfa6641c3d5a54073bf", + "review_sha256": "00f47047f2be8304b476fb6c8c78888c89478d0d8e6bbef0957e35a90e7c9abd", + "not_human_or_kernel_acceptance": true + }, + "read_only_export": { + "status": "PASS_READ_ONLY_GIT_FREE_EMPTY_PATH_EXPORT", + "tested_commit": "ff4a33347f838f9215fec9993d40b3ca3ba361b2", + "files": 17, + "declared_inputs_checked": 3, + "seconds": 11.424, + "exit_code": 0, + "stdout_sha256": "2f05c62c6e6e61c94868e12f386c85562d6c2cf32528df2a57a289eab6cf22f0", + "read_only_modes": true, + "git_free": true, + "empty_path": true, + "package_bytes_and_modes_unchanged": true, + "stderr_empty": true + }, + "independent_fixture_readonly_export": { + "status": "PASS", + "package_bytes_modes_unchanged": true, + "empty_path": true, + "stderr_empty": true + }, + "scientific_file_sha256": { + "verify.py": "a25952be7092fdb7de8108f52fc80cbc6cf9eb7805a6386dfffd476defddef9b", + "independent_checks.py": "2006cd0556a62665dd0ab87d6edf85e5758b918fdc67e755190f8da3a2a787da", + "inputs/all_history_independent.py": "ddad7c43a02b3df025dba8dd31ea866079cf61ddd00c5f6e1af40461798cf207", + "inputs/WORD.json.gz": "acee323696b18914bd863d55341f92112b48d3d1dc1443c276efb6c396fcc0a9" + }, + "scope": "No new kappa. Universal scalar relation classification; separately conditional access/transport corollary." +} diff --git a/research/p104-public-relation-family-bound/VERIFY.json b/research/p104-public-relation-family-bound/VERIFY.json new file mode 100644 index 0000000000..8bcbf5e9eb --- /dev/null +++ b/research/p104-public-relation-family-bound/VERIFY.json @@ -0,0 +1,63 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [ + "research/p104-public-relation-family-bound/inputs/WORD.json.gz", + "research/p104-public-relation-family-bound/inputs/PREDECESSOR-NOTICE", + "research/p104-public-relation-family-bound/inputs/all_history_independent.py" + ], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 300, + "checks": "Fresh full source matrices, complete e885/e1459 observation supports, both exact circuits, all original row ranks, full scalar-family support proof and11 executed failure controls." + }, + { + "argv": [ + "{python}", + "-O", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 300, + "checks": "Fresh full source matrices, complete e885/e1459 observation supports, both exact circuits, all original row ranks, full scalar-family support proof and11 executed failure controls." + }, + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/independent_checks.py" + ], + "timeout_seconds": 30, + "checks": "Separate exact lost-column subsets and quotient-basis/latest fixtures; corroborates the independent written subspace and preparation proof review." + }, + { + "argv": [ + "{python}", + "-O", + "-I", + "-W", + "error", + "-B", + "{package}/independent_checks.py" + ], + "timeout_seconds": 30, + "checks": "Separate exact lost-column subsets and quotient-basis/latest fixtures; corroborates the independent written subspace and preparation proof review." + } + ] +} diff --git a/research/p104-public-relation-family-bound/independent_checks.py b/research/p104-public-relation-family-bound/independent_checks.py new file mode 100644 index 0000000000..7be7f0cf6c --- /dev/null +++ b/research/p104-public-relation-family-bound/independent_checks.py @@ -0,0 +1,31 @@ +#!/usr/bin/env python3 +"""Tiny exact proof-step fixtures; no source or parameter census.""" +from fractions import Fraction as F +from itertools import combinations +import json +def rank(rows): + a=[list(map(F,r)) for r in rows];k=0 + for j in range(len(a[0]) if a else 0): + p=next((i for i in range(k,len(a)) if a[i][j]),None) + if p is None:continue + a[k],a[p]=a[p],a[k];q=a[k][j];a[k]=[v/q for v in a[k]] + for i in range(k+1,len(a)): + q=a[i][j];a[i]=[x-q*y for x,y in zip(a[i],a[k])] + k+=1 + return k +def need(x,label): + if not x:raise ValueError(label) +def contains(rows,v):return rank(rows)==rank(rows+[v]) +g=[-1,1,0];h=[0,0,1];tests=0 +for size in range(4): + for H in combinations(range(3),size): + full=rank([[row[i] for i in H] for row in [g,h]])==2 + need(full==(2 in H and (0 in H or 1 in H)),'full-plane lost columns');tests+=1 +e=[[1,0,0],[0,1,0],[0,0,1]];plane=[e[0],[0,-1,1]] +need([contains(plane,v) for v in e]==[True,False,False],'only initial row is in plane') +need(not contains([e[0]]+plane,e[1]) and contains(e[:2]+plane,e[2]),'only latest MOVE is enabled') +hr=[1,F(-1,4),-1] +need(not any(contains([hr],v) for v in e),'h circuit has no zero row') +need([contains(e[:i]+[hr],e[i]) for i in range(3)]==[False,False,True],'h circuit latest') +need(8-1>0 and 8-1-8==-1,'information allowance is distinct from charged bound') +print(json.dumps({'status':'PASS_EXACT_FAMILY_PROOF_STEP_FIXTURES','lost_column_subsets':tests,'plane_zero_and_latest_checks':True,'h_zero_and_latest_checks':True,'conditional_budget_distinction':True},sort_keys=True,indent=2)) diff --git a/research/p104-public-relation-family-bound/inputs/PREDECESSOR-NOTICE b/research/p104-public-relation-family-bound/inputs/PREDECESSOR-NOTICE new file mode 100644 index 0000000000..4133e92165 --- /dev/null +++ b/research/p104-public-relation-family-bound/inputs/PREDECESSOR-NOTICE @@ -0,0 +1,16 @@ +Apache-2.0. Clear1nsight, with substantial OpenAI Codex assistance. +ChatGPT Pro audited the adjacent signed-swap approach and recommended checking +full input and output defects at a coframe. The literal witness was found by +the local chart-component scan and checked over the rationals. + +Exact #7314 and its recursive sources are retained with their original notices. +Credit Clear1nsight for #7314 and #7274, Rohan Arun for #7277 and the signed +#7113 caller, ToikY for the #7312 public MOVE contact study, the independent +#7317 replay, #7329's scalar-contraction bound and the directed price engines. +The earlier compensated fusion #6529 and the work it credits supply a related +precedent. Credit dillona, Ali Romman, Jerry Chen / CubeJerry, DreamingOfClouds, +and all contributors named in the retained sources. + +Successor helper449 paid high-readout correction: Rohan Arun with substantial OpenAI Codex assistance. Extends Clear1nsight helper319 construction, retains all nested notices and authors. Apache-2.0. + +Funded485/1455 successor,2026-11-13: the new two-shear encoding, funded itinerary change, proof and initial full replay were developed with verified GPT-6 Pro. Clear1nsight with OpenAI Codex assistance audited, integrated, independently replayed and prepared this contribution. The preceding paragraphs describe retained predecessor work; their chart-component authorship claim does not describe this successor. All source notices remain unchanged under inputs/. No independent human or formal-kernel acceptance is claimed. diff --git a/research/p104-public-relation-family-bound/inputs/WORD.json.gz b/research/p104-public-relation-family-bound/inputs/WORD.json.gz new file mode 100644 index 0000000000..77df4ad624 Binary files /dev/null and b/research/p104-public-relation-family-bound/inputs/WORD.json.gz differ diff --git a/research/p104-public-relation-family-bound/inputs/all_history_independent.py b/research/p104-public-relation-family-bound/inputs/all_history_independent.py new file mode 100644 index 0000000000..33965272fd --- /dev/null +++ b/research/p104-public-relation-family-bound/inputs/all_history_independent.py @@ -0,0 +1,155 @@ +#!/usr/bin/env python3 +"""Fresh Q coframe matrices; distinct-prime sparse COLUMN independence. + +Only the pinned original word is an input. Root prototype rows are not used. +""" +from collections import Counter,defaultdict +from fractions import Fraction as Q +from hashlib import sha256 +from pathlib import Path +import argparse,gzip,json,math,sys,time +PIN='acee323696b18914bd863d55341f92112b48d3d1dc1443c276efb6c396fcc0a9' +PRIME=1000033 +def need(ok,label): + if not ok:raise ValueError(label) +def isprime(n):return n>=2 and all(n%d for d in range(2,math.isqrt(n)+1)) +def framekey(U): + s={0} + for u in U:need(u not in s and 0=n),'source ownership flag') + left,right=set(classes[e[2]]),set(classes[e[3]]);need((left0 and rows[a],'positive paid rank and nonzero unrestricted MOVE row');paid[r]+=1;move_rows[event]=(rows[a].copy(),r,a,e[2],e[3]) + if len(rows[a])==1: + h=next(iter(rows[a])) + if h in helpers:pure[h].append((event,r,rows[a][h])) + cur[a]=e[3];observe(event,a,e[3],'arrival') + elif op=='INIT':need(a>=n and cur[a] is None and rows[a] is None,'fresh owned INIT');cur[a],rows[a]=e[2],{} + elif op=='CLEAR':need(a>=n and cur[a]==e[2] and rows[a] is not None,'owned CLEAR chart');cur[a],rows[a]=None,None + elif op=='SCALE':need(cur[a]==e[-1] and Q(e[2]),'nonzero coframed SCALE');rows[a]={h:Q(e[2])*v for h,v in rows[a].items()} + elif op in ('ADD','COPY'): + b=e[2];need(a!=b and cur[a]==cur[b]==e[-1],'coframed scalar contact') + if op=='COPY':need(a>=n and not rows[a],'COPY into fresh zero') + add(rows[a],rows[b],Q(e[3])) + else:raise ValueError(op) + need(cur==w['final']+[None]*owned,'complete source endpoints and lifetimes');need(len(move_rows)==6279,'all paid MOVE rows collected');need(sum(len(b) for b in banks.values())==7780,'all1501 initial plus6279 arrivals') + cold={h for h in helpers if Counter(r for event,r,c in pure[h])==Counter({target_rank[h]:1})};need(len(cold)==72,'fresh exact72 pointwise-neutral helpers') + neutral_moves={pure[h][0][0]:h for h in cold};need(len(neutral_moves)==72,'one distinct pure MOVE per neutral helper');lost=Counter(target_rank[h] for h in cold);removed=Counter(move_rows[e][1] for e in neutral_moves);need(lost==removed,'actual72 target/paid rank cancellation') + replay_seconds=time.monotonic()-start;emit({'phase':'fresh_exact_Q_matrices_complete','rows':7780,'coframes':len(banks),'neutral_helpers':72,'seconds':replay_seconds}) + inverses={};rational_entries=0;records=[];zero_rows=[];denominator_count=Counter();source_matrix_digest=sha256();projected_matrix_digest=sha256();original_pivots=projected_pivots=0 + def residue(q): + denominator_count[q.denominator]+=1 + return rational_mod(q,prime,inverses) + for index,(key,bank) in enumerate(sorted(banks.items(),key=lambda item:(-len(item[1]),aliases[item[0]][0]))): + need(time.monotonic()-start