diff --git a/research/helper-quotient-basis-audit/.gitattributes b/research/helper-quotient-basis-audit/.gitattributes new file mode 100644 index 0000000000..b073422067 --- /dev/null +++ b/research/helper-quotient-basis-audit/.gitattributes @@ -0,0 +1 @@ +credits/* -text whitespace=cr-at-eol diff --git a/research/helper-quotient-basis-audit/CREDITS.md b/research/helper-quotient-basis-audit/CREDITS.md new file mode 100644 index 0000000000..d70c7ea76d --- /dev/null +++ b/research/helper-quotient-basis-audit/CREDITS.md @@ -0,0 +1,53 @@ +# Credit and source identity + +Ali Romman prepared this separate basis audit with substantial OpenAI +Codex assistance in implementation, checking and writing. New work is +Apache-2.0. The source proof and code were read; this is not blind, +independent human or formal-kernel review. + +Ali Romman's separate workstream supplied the construction, all 33 +certificates and requested cases in +[PR #7713](https://github.com/CrocSwap/integer-mult-bounds/pull/7713), +scientific commit `06b75fde21f4231a2bd0725542c3ba60a908d83b`, published +head `52e7eb424b9ae9f2e6002eb17e475bce6195d848`. +The [proof](https://github.com/aliromman/integer-mult-bounds/blob/06b75fde21f4231a2bd0725542c3ba60a908d83b/research/p104-helper-quotients/PROOF.md), +[constructor](https://github.com/aliromman/integer-mult-bounds/blob/06b75fde21f4231a2bd0725542c3ba60a908d83b/research/p104-helper-quotients/quotient.py) +and [relation checker](https://github.com/aliromman/integer-mult-bounds/blob/06b75fde21f4231a2bd0725542c3ba60a908d83b/research/p104-helper-quotients/witness.py) +were inspected. No source checker module is imported. The rational +restriction and transpose argument remain source work. New evidence +uses forward basis expansion, a separate graph implementation, +direct endpoint comparison and rank accounting. + +The parent is Ali Romman's 46-cut graph from +[PR #7708](https://github.com/CrocSwap/integer-mult-bounds/pull/7708), +scientific commit `f0e2db5b5b46b139da17d2b32fab6633164443a9`, with hash +`db10e4ca7154b454f86bf404bc34b3a16d02de6cc008d5227e4eef2654cb0778`. +The retained graph and interface are derived exports, not copied +source files. Source `quotient.parent()` and `recoding.layout()` made +the export. Their raw-word and cut construction is trusted here; +the exported endpoint is checked directly. + +[SOURCE-PINS.json](SOURCE-PINS.json) gives SHA-256 values for retained +inputs and original Git blobs for byte-exact copies. QUOTIENTS.json, +both application receipts, LICENSE and all supplier notices retain +their bytes. The audit history contains these inputs. Replay needs +no predecessor commit or network. Source pins identify attribution +and bytes, not ancestry. The catalogue and selected record are base +provenance in [SOURCES.json](SOURCES.json). + +The [source notice](https://github.com/aliromman/integer-mult-bounds/blob/06b75fde21f4231a2bd0725542c3ba60a908d83b/research/p104-helper-quotients/NOTICE) +credits SYLforge for the nine-swap word in +[PR #7700](https://github.com/CrocSwap/integer-mult-bounds/pull/7700), +Clear1nsight for the relay and schedule in +[PR #7704](https://github.com/CrocSwap/integer-mult-bounds/pull/7704), +and DreamingOfClouds for related bank work in +[PR #7705](https://github.com/CrocSwap/integer-mult-bounds/pull/7705). +It credits Rohan Arun for the signed caller, Jerry Chen / CubeJerry +for the selected complex and BIT application, Douglas Colkitt and +repository contributors for the framework, and mightyOil for the +concave comparison. All supplier notices remain under credits/. +Related constructions and gains are not counted as audit results. + +The neighboring [PR #7712](https://github.com/CrocSwap/integer-mult-bounds/pull/7712) +uses another helper interface. Its splits are not composed with these +restrictions. No other workstream's claim or PR is changed. diff --git a/research/helper-quotient-basis-audit/LICENSE b/research/helper-quotient-basis-audit/LICENSE new file mode 100644 index 0000000000..261eeb9e9f --- /dev/null +++ b/research/helper-quotient-basis-audit/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/helper-quotient-basis-audit/PROOF.md b/research/helper-quotient-basis-audit/PROOF.md new file mode 100644 index 0000000000..7ebb4e6cbe --- /dev/null +++ b/research/helper-quotient-basis-audit/PROOF.md @@ -0,0 +1,130 @@ +# Exact audit of the fixed helper restrictions + +## Result and boundary + +All 33 certificates in [QUOTIENTS.json](QUOTIENTS.json) preserve the +surviving normalized operator of the supplied parent graph. All 67 +receiver identities hold over the rationals on arbitrary independent +entrances of their actual intermediate graph. The final graph has +1,468 public fields: all 400 main fields and 1,068 helpers. +The parent has 1,501 public fields and 1,101 helpers. + +This is a separate implementation audit of the construction in +[PR #7713](https://github.com/CrocSwap/integer-mult-bounds/pull/7713). +It adds checking evidence. The construction and its gain are source +work. No new kappa or complete supplier admission is claimed. + +## Independent variables and restriction + +Give entrance r the formal basis vector e_r. A local formula +`sum(q_d h_d)` has vector `sum(q_d v_d)`. The checker evaluates these +vectors in dependency order. Each has integer coefficients and one +positive integer denominator; common factors are reduced exactly. +Vector equality implies equality for every rational entrance assignment. +No random test, modular surrogate or floating point is used. + +The parent calculation checks every helper row is e_r and every main +row uses only main entrances. Its normalized endpoint is therefore +a direct sum of a main matrix and an identity on helpers. + +For helper r let `s=sum(a_i x_i)`, with a_r nonzero. Substitute +`x_r=-sum(i!=r, a_i x_i)/a_r`. Every other entrance stays independent. +Every retained helper and main output keeps its value. The removed +helper output is discarded, so its productive target must be debited. + +At each receiver the checker proves `s=sum(b_j h_j)` before the +substitution. All listed banks are at that receiver. Their sum is +zero on the restricted space. A nonzero pivot coefficient gives a +local expression for the removed paid bank. Replace every read of it +and delete its send. Donor charts and the complete dependency graph +are checked after each step. A replacement can use a later source +key if the resulting graph is acyclic. Its equations then have a +unique solution, and the restricted original values satisfy them. + +For a transposed step, reverse scalar incidence edges, interchange +public entrances and exits, and reverse paid chart pairs. This gives +the normalized transpose, whose helper block is still an identity. +Apply the same argument and transpose back. This argument concerns +rational coordinates. It does not check physical chart phases. + +Stable source labels remain through the sequence. Removed labels +are isolated as formal identities. Before compaction, each such +identity must have no other reader. Delete its row and column and +renumber the survivors. Every main label and first-plane partner +survives. The final forward matrix is compared directly with the +surviving parent matrix. An exact forward evaluation of the final +transposed graph also checks the transposed matrix. + +## The two requested cases + +Step 1 is forward, with entrance form `x264-x407-x434/4`. + +| Chart | Checked receiver form | Removed key | Paid rank | +| ---: | --- | ---: | ---: | +| 441 | `h94689-h94690-h94703` | 94703 | 2 | +| 527 | `h95863` | 95863 | 4 | +| 127 | `h103556-h104045/4-h104100` | 104100 | 3 | + +The lost helper rank is nine. This calculation visits 59 paid +ancestors and performs 12,293 coefficient products. + +Step 13 is the first transposed step, after twelve forward steps. +Its entrance form is x559. At chart 807 the checked form is +`2h99290+2h104187`; at chart 3 it is `-2h97558`. Keys 104187 and +97558 have ranks three and six. The lost target rank is nine. +The calculation visits seven paid ancestors and performs 374 +coefficient products. The forward-orientation control rejects this +certificate. The check uses its actual intermediate graph. + +## Complete debits + +Frame vectors are checked for binary independence. Every paid pair +has strictly nested spans. Every surviving helper has a strictly +larger output span. Rank is the dimension difference. Each step +removes at least two positive paid ranks whose sum equals the lost +helper rank. Direct counts before and after the sequence agree with +all accumulated certificate debits. + +Per call, paid jobs fall from 6,121 to 6,054 and helper targets from +1,101 to 1,068. Both rank masses fall by 200. The unchanged published +fixed caller and root rows, with declared multiplicity 16, give: + +| Quantity | Parent | Candidate | +| --- | ---: | ---: | +| Paid jobs | 101488 | 100416 | +| Productive jobs | 21152 | 20624 | +| Paid rank mass | 271568 | 268368 | +| Productive rank mass | 272896 | 269696 | + +The surplus stays 1,328. Both complete histograms match the source +receipts. The checker does not prove fixed-caller admission. +For `0d^t`: divide by `d^t` and use `u^t>u` for `0- + Please cite the selected composition and its constituent contributions, + this project and the upstream manuscript. The selected checkpoint is PR4470 on the cumulative productive-helper framework; consult certificates/selected-result.json for publication status. + Project-level authorship identifies the maintainer, not sole authorship of + the community result. See CONTRIBUTORS.md and the frozen source notices. +title: "A sharper exponent for integer multiplication" +authors: + - family-names: Colkitt + given-names: Douglas +license: Apache-2.0 +type: software +version: "community-joint4470-2026-10-22" +date-released: 2026-10-22 +repository-code: "https://github.com/CrocSwap/integer-mult-bounds" +url: "https://github.com/CrocSwap/integer-mult-bounds" +abstract: >- + Community research on integer multiplication. The selected maintainer-reviewed + conditional construction has kappa = 60403/20000000 = 0.00302015. + Cinna Davis's PR4470 joint helper frames and query-thinned controller build on + her preceding constructions, zxv's native/productive-helper and compiler work, + Jacob Alan Sussman's mixed-target recursion, and the cumulative community + framework. Exact finite replays and independent audits retain explicit + all-column/native, owned-erasure, compiler, precision/tape, analytic, prime + and recovery assumptions. This is not a complete formal multiplication proof. +preferred-citation: + type: software + title: "A sharper exponent for integer multiplication: community research repository" + authors: + - family-names: Colkitt + given-names: Douglas + year: 2026 + url: "https://github.com/CrocSwap/integer-mult-bounds" + notes: >- + Maintainer citation only, not sole authorship of the mathematical result. + Credit Cinna Davis (PR4470/4447/4441/4440/4416), zxv (PR4359/4433), + Jacob Alan Sussman (PR4268), independent auditors Mihir Srivastava and + Ryanson Jonathan, Mark/Matarener for the commutation question, and the full + geometry, binary, native, precision and outer lineage, including Rohan Arun, + Jeremy Kothe, Chafik Boukhalfa and the contributors listed in CONTRIBUTORS.md + and docs/research/community-joint4470-contributors.md. Cite constituent PRs + where their results are used; preserve their licenses and assistance disclosures. +keywords: + - integer multiplication + - computational complexity + - exact arithmetic + - parameter optimization + - reproducible research +references: + - type: unpublished + title: "Integer multiplication below n log n" + authors: + - name: OpenAI + year: 2026 + url: "https://github.com/openai/math/tree/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026" diff --git a/research/helper-quotient-basis-audit/credits/7700-NOTICE b/research/helper-quotient-basis-audit/credits/7700-NOTICE new file mode 100644 index 0000000000..59d8e0cf31 --- /dev/null +++ b/research/helper-quotient-basis-audit/credits/7700-NOTICE @@ -0,0 +1,415 @@ +A sharper exponent for integer multiplication +Copyright 2026 Douglas Colkitt + +This project includes unmodified source files from OpenAI's manuscript +"Integer multiplication below n log n" and its accompanying repository: +https://github.com/openai/math +Commit: adc7f1241b42e322a6451854ab7e4b4c146bf78a + +The original manuscript identifies OpenAI as its author. Its Apache-2.0 +license is retained at upstream/LICENSE. The exact source URLs and hashes +are recorded in upstream/manifest.json. Proposed modifications are supplied +as separate files under patches/; upstream source files remain unchanged. + +The original local research note, scripts, certificates, patches, and +documentation were prepared by Douglas Colkitt with assistance from OpenAI +Codex. The community release incorporates work by the contributors identified +in the notices below; it is not solely Douglas Colkitt's work. +This project is not an official OpenAI release or an OpenAI endorsement. + +Related contributions (not imported in this checkpoint): +Zhihao Chen (jacklightChen), PR #7, supplied an earlier ternary five-subset +motif, finite-alphabet transfer and a different compressed producer: +https://github.com/CrocSwap/integer-mult-bounds/pull/7 +The present checkpoint claims no priority for that motif. Related compressed +complex-network work was submitted by eumemic in PR #3: +https://github.com/CrocSwap/integer-mult-bounds/pull/3 +The pending contributions and their stronger bounds require their own review; +this notice does not represent adoption or verification of their claims. + +Additional community work, including parallel and superseded submissions, is +acknowledged in CONTRIBUTORS.md, with pinned submission metadata in +docs/research/contribution-snapshot.json. These acknowledgements do not imply +joint authorship of the checkpoint, incorporation of pending code, or verification +of submitted mathematical claims. Original source-specific notices remain in force. + +Community release (accepted by conditional maintainer audit): +The following original contributor notices apply to the imported PR #39 chain. +The preceding non-import statements describe the preserved 2^-30 checkpoint. + +Ternary five-subset construction and common-four-point resynthesis +Copyright 2026 Zhihao Chen (jacklightChen) + +This is Zhihao Chen's first submission of this specific construction to this +repository. Research, proof development, code and verification were prepared +with substantial assistance from GPT-6 Astra (OpenAI Codex), as identified by +the contributor. This is not independent review or an OpenAI endorsement. +Future research building on this contribution should explicitly acknowledge +Zhihao Chen (jacklightChen), cite the accompanying note and pull request, and +retain the preceding contributors' attribution. This notice records research +provenance; the repository's Apache-2.0 license remains unchanged. + +Dependencies retained from eumemic's Claude-assisted PRs #3 and #5: +https://github.com/CrocSwap/integer-mult-bounds/pull/3 +https://github.com/CrocSwap/integer-mult-bounds/pull/5 +PR #5 commit: d3d370c34937503bd3fa63c83d505a05e8e50893 +These include complex_circuit.py, complex_network.py, fast_gaussian.py, +their generators, construction notes and certificates. The Gaussian input +scaling proof is corrected in this derivative; see the modification notice below. +Aligned pairing also appears in Bortlesboat's PR #2. Retained totals and bank +sharing appear in dleen's PR #4 and cheaper retained centers in eumemic's PR #6. +Their results and ideas are credited separately from this new construction. + +Bulk recursion and controlled tensor basis, 8 October 2026 +Copyright 2026 icekylinx + +The new projector batching, controlled simultaneous basis, mixed-width tape +recursions, whole-residual complex recursion, and dependency-path precision +guard in the batched-23 proof package are contributed by icekylinx, developed +with substantial OpenAI GPT-6 Astra assistance. Review corrections and +repository integration were prepared with OpenAI Codex assistance. They build on the retained +PR #7 finite producers and the preceding contributions credited above. +The new package retains the repository's Apache-2.0 license and the original +authors' attribution. It is not an official OpenAI release or endorsement. + +Modification notice, 8 October 2026 (icekylinx): the retained fast Gaussian +proof now bounds shifted approximation error by F=2^ceil(1.14 alpha^2). +The P=34p precision budget and asymptotic exponent are unchanged. New batching +checks are integrated into make verify. Existing attribution and licenses +are retained. + +Partial-swap extension, 8 October 2026 +Copyright 2026 icekylinx + +The partial-swap framing, binary retained-total triple construction, +dependency-preserving positive labels and carrier reuse, unequal (25,23,57) +common basis, improved complex batching, and exact assembly are contributed +by icekylinx with substantial OpenAI GPT-6 Astra and Codex assistance. +This extension directly inherits PR #10, commit +62691e395a0458ce089a1c7b5d89e74291e95e29. The portable producer adapters +modify the retained paired-exclusion and shared-point implementations credited +above. The original licenses, attribution, and Gaussian correction are retained. + +Endpoint-gauge extension, 8 October 2026 +Copyright 2026 icekylinx + +The complementary auxiliary endpoint gauges, (32,30,40) controlled basis, +general nondegenerate binary phase residuals, retained-center complex producer, +updated path guard and exact assembly are contributed by icekylinx with +substantial OpenAI GPT-6 Astra and Codex assistance. This extension inherits +f2ab41aebad47861caf6316282c1793e5513845e and its PR #10 ancestry. New portable +adapters retain the paired-exclusion and shared-point contributions credited +above. Original licenses, notices and the Gaussian correction are retained. + +Structured-basis and semantic-bulk extension, 8 October 2026 +Copyright 2026 icekylinx + +The selected (32,30,36) bit construction, A1/A5 block refinements, fixed +middle-axis I+J profiles with bounded-minor CRT certificates, mixed dyadic +complex centers, complete data-front batching and circuit-specific assembly +are contributed by icekylinx with substantial OpenAI GPT-6 Astra and Codex +assistance. The immediate parent is ed90fd940279c336ebc45968631bdebfb087b505. + +The semantic/bulk compatibility argument, literal scalar charge, product row +stock and parameterization adapt Zhihao Chen (jacklightChen)'s PR #23, +commit 661ebabc1076c9f525d7ce4967c876b203fa9827. Translated complex endpoints +are adopted from the same contributor's PR #21, +commit 5ba6cf0bfb68f2be8d15610e7972207c50254d6a, following eumemic's source-frame +work and the earlier nested-basis contributions. + +Completed-child semantic precision, arbitrary-coordinate routing, phase-cell +Gaussian inversion and bulk tape transfer are credited to the RaD project +(hipotures), commit 45d9b60355872041f9275f77c057514def0d45bc, exposed through +PR #20 at 4f8d6c8272b5ff307a0da51df545ec3cd96a8b6e. Their selected proof +sources retain their separate CC0 license and original NOTICE under +references/semantic-bulk/rad20. The PR #23 source retains its recorded OpenAI +Codex assistance; RaD retains its recorded Codex and GPT-6.1-Sol Ultra +assistance. These are source attributions, not claims about this session's +runtime model. Related contributions by Rohan Arun and Aurel Prosz remain +acknowledged in the imported notices. No exclusive priority or additional +license condition is asserted. + +Copied retained-center extension, 8 October 2026 +Copyright 2026 icekylinx + +The copied retained-center schedule in both orientations, its complex-phase +transfer, the Wm-N+L rank budget, and the selected (25,23)/(28,28) composition +are contributed by icekylinx with substantial OpenAI GPT-6 Astra and Codex +assistance. This extension inherits PR #32 at +0ef3aeb61f55cc0b321ce6a0ef00acee25cefe52 and the preceding PR #10/#18/#24 work. + +The two-stage topology and paid copied-stream endpoint correction are due +to Aurel Prosz (Paureel), c82d09eb4781b68435e3fa3eb6beea72fa900fab, +through Zhihao Chen (jacklightChen)'s PR #29 unequal-axis composition, +9d963275075fa98f1da821e27757b238dafd6b3c. That source also credits Swapnil +Jain's two-stage development at ae405eb474d1486b2d8aef90139869f927f4836a. + +The contiguous corner method, incidence factorization and exact partition +certificates are due to Rohan Arun (PR #31), method commit +02f68f95369c39955c5ffcfddbd75cd83e26b305. The selected (25,23) certificate +specializes Dominik Scholz's parameterization (PR #33), +a499a345c040aa15b68e984a0904eadc485c7a7e. Their source notices and proof +snapshots are preserved in references/copied-centers. Historical OpenAI +Codex, GPT-6 Astra and Anthropic Claude Opus 5.5 assistance is credited to +the respective imported sources. Existing PR #21/#23 and RaD attribution, +licenses and the Gaussian correction remain in force. + +Copied centers with reversed (23,25) data corners, 2026-10-08 +Rohan Arun with substantial OpenAI Codex assistance supplies the composition, +exact dimension23 controls and cost/assembly integration. James Chang's PR34 +supplies the reversed boundary family; icekylinx's PR36 supplies copied retained +centers and the selected complex graph. The balanced assembly remains attributed +to RaD/hipotures and its PR34 specialization. Retain Dominik Scholz PR33, Rohan +Arun PR31, Zhihao Chen PR29/21/23, Paureel/Aurel Prosz, Swapnil Jain, icekylinx, +eumemic, Douglas Colkitt, OpenAI and all earlier notices and hypotheses. +This is not a claim of formal verification, new foundational rank identities, +global optimality or measured runtime speedup. + +Fixed middle basis with copied reversed corners (2026-10-08): +Rohan Arun, with substantial OpenAI Codex assistance. Composition and +simultaneous-basis proof retain icekylinx PR32/36, James Chang PR34, +Dominik Scholz PR35/38, Zhihao Chen, Paureel, Swapnil Jain, RaD/hipotures, +eumemic and all preceding attribution and licenses. See research/copied-fixed-reversed. + +Changed-graph composition with copied centers and fixed bases, 8 October 2026 +Prepared with OpenAI Codex assistance. +The new composition uses icekylinx PR36 copied centers and PR32 fixed-I+J +projectors/profiler, Dominik Scholz PR35 two fixed factors and CRT argument, +Zhihao Chen (jacklightChen) PR29/23 interfaces, Aurel Prosz (Paureel) and +Swapnil Jain's two-stage development, Rohan Arun PR25/31 corner methods, +Dominik Scholz PR33/38 dimension/composition work; James Chang (jamesyc) +PR34 reversed geometry and balanced transfer; Rohan Arun PR37/39/40 +reversed integration, modular data tests and both-fixed baseline; +RaD (hipotures) PR41 changed scalar DAGs, alternating point order and +independent role compiler; RaD balanced routing/bulk interfaces, and all +retained predecessors. +Complete attribution and the conditional proof boundary are recorded in +research/copied-fixed/PROOF.md; imported originals and source pins are retained. +Original Apache-2.0 and CC0 notices remain applicable. + +Community follow-up integration (PRs #49, #45 and #26), 8 October 2026: +Rohan Arun contributes weighted carrier matching and climbed summand/leave-one-out +orders (PRs #44/#47/#49), with Anthropic Claude assistance. The final construction +composes Chafik Boukhalfa's changed-graph checks, exact rational data recovery and +reordered exclusion sums (PRs #43/#46/#48, OpenAI Codex assistance) with RaD / +hipotures's alternating pair order and independent physical role compiler (#41). +All predecessor attribution and conditional proof interfaces remain in force. + +Alejandro Zarzuelo Urdiales contributes Gaussian parity and canonical arithmetic +proofs, finite tensor execution, profile precision accounting and mixed-center +reference checks (#45), with substantial OpenAI Codex assistance. See +research/gaussian-parity-synthesis/PROVENANCE.md for his full attribution. +Ryan S / princezuda contributes historical Lean certificate arithmetic, algebraic +frame/movement/guard lemmas and independent paired-circuit checks (#26). Original +source notices and historical snapshots are preserved. Neither formal package +claims a full formal proof of the multiplication algorithm or a new kappa. + +Joint frame compilation of skip-prefix strips + +The local compiler and exact finite witnesses were prepared by eumemic with +substantial OpenAI Codex assistance. Avi Eisenberg / ikeboy with Anthropic +Claude assistance supplied the unmodified PR #53 skip-prefix producer. +The pinned PR #48 pipeline is Chafik Boukhalfa's contribution, incorporating +Rohan Arun, RaD / hipotures, icekylinx, Dominik Scholz, James Chang, +Zhihao Chen, Aurel Prosz / Paureel, Swapnil Jain, eumemic, Douglas Colkitt, +OpenAI, David Harvey, Joris van der Hoeven and the earlier contributors +credited in the retained sources. See references/frame-compiler/pr48/NOTICE +and references/frame-compiler/pr53/NOTICE for their original attribution. +No authorship or review by those predecessors is claimed for this compiler. + +Joint dual-skip/frame-compiler composition (2026-10-08) +--------------------------------------------------- +Rohan Gupta / gupt1156 with Anthropic Claude assistance: PR55 dual-skip +scalar graph; original LICENSE and NOTICE are retained under +references/frame-compiler/pr55. eumemic with substantial OpenAI Codex +assistance: PR57 joint reversible frame compiler, serialized physical-word +replay and profile reconstruction. Chafik Boukhalfa with OpenAI Codex +assistance: this composition, independent integration and exact certificate. +Avi Eisenberg / ikeboy, Rohan Arun, RaD / hipotures, icekylinx, and all +predecessor authors retain the notices above and in pinned source files. +No original copyright or Apache-2.0 notice is removed. + +Ranked reclamation after the PR58 joint-dual composition (2026-10-08) +---------------------------------------------------------------- +Chafik Boukhalfa with OpenAI Codex assistance: prioritize retired physical +slots by descending current frame rank, retaining slot ID as the tie-breaker; +complete replay, exact profiles, comparison and adversarial controls. +The dedicated joint_dual_reclaim_compiler.py is derived from eumemic's PR57 +compiler. Its original shared compiler remains byte-identical. The PR55 +producer and all preceding attribution remain unchanged. The complete PR58 +comparison certificate and its original source/proof provenance are retained +under references/frame-compiler/pr58. + +Skip-prefix strip producer, 8 October 2026 +By Avi Eisenberg (ikeboy), with Anthropic Claude (Claude Opus 5.5) +assistance. The skip-prefix leave-one-out strip layout in +research/skip-strips/skip_graph.py is new. Everything else reuses Chafik +Boukhalfa's PR #43/#46/#48 research/copied-fixed pipeline, its verification +code, exact data recovery and support-order sorting, together with: +- Rohan Arun's PR #44 weighted carrier matching optimizer; +- RaD (hipotures) PR #41 alternating point order; +- every predecessor credited above. +Complete attribution and the conditional proof boundary are recorded in +research/skip-strips/PROOF.md. Original Apache-2.0 and CC0 notices remain +applicable. + +Local split-pair skip-prefix research continuation (2026-10-08) +Prepared with substantial OpenAI Codex assistance at the user's request. +New contribution: singleton/pair recursive partition refinement, finite summand +order and moment search, and verified composition with inherited paid clones. +Avi Eisenberg/ikeboy with Anthropic Claude assistance: PR53 skip-prefix strips. +Chafik Boukhalfa with OpenAI Codex assistance: PR54 original-envelope clone +specialization and PR43/46/48 checking interfaces. RaD/hipotures: PR51 +whole-chain/source-partition cloning and earlier producer/interfaces. +Rohan Arun: PR44 weighted matching and earlier fixed/reversed work, with all +stated historical AI assistance. All predecessor notices remain applicable. + +Original-envelope whole-chain clones on skip-prefix strips (research/skip-clones): +Chafik Boukhalfa, prepared with OpenAI Codex assistance. The complete-chain +source-partition clone operation is adapted from RaD / hipotures, PR #51, +with original envelopes retained here. The scalar base is Avi Eisenberg's +PR #53 skip-prefix layout, prepared with Anthropic Claude assistance. +All credited PR #43/#46/#48, PR #44 and earlier code/proof notices remain +in force. This extension is provided under the repository's Apache-2.0 terms. + +Community review checkpoint #50–#61, 8 October 2026 +Maintainer integration and independent arithmetic: Douglas Colkitt, with OpenAI Codex. +Avi Eisenberg / ikeboy: skip-prefix strip framework (#53), with Anthropic Claude. +Rohan Gupta / gupt1156: parallel order search (#50, stated Antigravity assistance) +and dual-suffix strips (#55, Anthropic Claude assistance). +Eumemic: equal-frame joint compilation and paid signal reclamation (#57), with Codex. +Chafik Boukhalfa: original-envelope paid clones (#54), composition (#58) and ranked +reclamation (#60), with Codex. Rohan Arun: order search (#52) and positive-frame +composition (#56), with Anthropic Claude and stated Codex validation assistance. +RaD / hipotures: enlarged frames, source partitions and paid whole-chain clones +(#51), with Codex. Rohan Garg / rohangar1: singleton/pair recursion and paid-clone +composition (#59), with Codex. Alejandro Zarzuelo Urdiales: exact parameter +refinement, scoped Lean arithmetic, matrix/parity and search tools (#61), with +his disclosed multi-tool and Codex assistance. +Parallel #50/#52 records are reviewed and credited without replacing the earlier +climbed-48 implementation; their exact commit history is retained. The separate +#51 witness is retained as research; its source-graph/negative-basis data proof +has not received the same full replay as #56's consumed compiler machinery. +See docs/research/community-round2-review.md for precise validation boundaries. +All earlier licenses, contributions and notices remain applicable. + +Interval strips and core-aware pair assembly + +The interval leave-one-out strips and the core-aware group-pair assembly in +research/pair-assembly were prepared by Avi Eisenberg / ikeboy with Anthropic +Claude assistance. They build on PR #53's skip-prefix pipeline and its +inherited PR #48 sources. The stacked witness in research/pair-assembly/frame +uses eumemic's PR #57 joint frame compiler unchanged; its driver and verifier +are adaptations of PR #57's skip_frame_compiler.py, skip_frame_compose.py and +verify_skip_frame.py. Original notices are retained. + +Stopped product-ring extension, 9 October 2026 +Copyright 2026 icekylinx + +The opposite-bank generic projector factorization, componentwise atom-ring +adapters, stopped recurrence and outer ordinary-interchange conversion, +aligned pair-star producer with rational centers, exact denominator-21 +grid and selected (23,23)/(24,24) composition are contributed by icekylinx +with substantial OpenAI GPT-6 Astra and Codex assistance. This extension +builds on merged PR #36, 11817ccacb564bb7f98789c20dc11d3fece207e3, and is +integrated on upstream main 56b66d58297deca1d7dd130247d720e960f77a37. + +The retained ordinary leaf uses the preceding projector, corner and +copied-center proofs. The selected two-stage topology retains Aurel Prosz +(Paureel), Swapnil Jain and Zhihao Chen's credits; the semantic assembly +retains PR #21/#23 and RaD's attribution. Paired producers, carrier matching, +original source notices and each imported license remain unchanged. + +Partial-gauge extension, 9 October 2026 +Copyright 2026 icekylinx + +The pair-first cube assembly, compatible backward frame enlargement, +partial source-gauge schedule and stopped whole-projector composition are +contributed by icekylinx with substantial OpenAI GPT-6 Astra and Codex +assistance, extending PR #104 at 948ce1510df750f4c18b96bdaef436a86f8bf834. + +The physical deferred bit word, reflected event accounting, fan-order +clarification and signed two-stage endpoint are adopted from Zhihao Chen +(jacklightChen), PR #97, e15350b66e4bf796153a68c240a6cc1b788abe3e, with +Codex assistance. Its deferred readouts, V leaves, lifted frames and frozen +witness originate in Swapnil Jain's 741e7aa078392553815df7926ee17ac5e25a8c38, +with the original Claude disclosure retained. Cyclic interval and core-aware +pair primitives build on Avi Eisenberg (ikeboy), PR #62, +ad0f25ff7b23cff7f08ad237c2254e6ecf74257e, with Anthropic Claude assistance. +Prior two-stage, copied-center, ordinary-leaf, semantic/bulk, routing and +precision credits remain in force. Imported source notices and licenses +are preserved under references/partial-gauge/; see SOURCES.json. + +Three-stage cover extension, 9 October 2026 +Copyright 2026 icekylinx + +The arbitrary-subspace Clifford frame theorem, three-stage Cayley geometry, +weighted q-adic GL cover, unit-lower weighted compiler, charged local-ring +fallback, uniform batching, internal row borrowing and exact composition +are contributed by icekylinx with substantial OpenAI GPT-6 Astra assistance. This +repository integration uses Codex assistance and extends +PR #115, cf60442983c153a3a0f5272ea4713f99eba13c86. + +The selected local complex DAG and support/label replay are adopted from +Copyright 2026 eumemic, PR #117, cbb05ce504d571546d9b7794c186a613c659c3bf, +with its original Apache-2.0 terms and Claude assistance disclosure. +The unchanged bit physical word retains Zhihao Chen (jacklightChen), +PR #97, and Swapnil Jain's underlying witness and assistance notices. +The prior opposite-bank, stopped ordinary-leaf, copied-center, topology, +semantic/bulk, precision and analytic credits remain applicable. +Original source notices and license bytes are preserved in +references/three-stage-cover/pr117/ and references/partial-gauge/. + +Paired-cube and shared-core extension, 9 October 2026 +Copyright 2026 icekylinx + +The paired-coordinate triple-cube identity, signed overlap channels, +original-source involution, coordinate-star centers, concrete frame/carrier +compiler, chronological source gauges, PR97 gauge-subset selection, +orthogonal cross-stage routing and exact supplier/assembly integration +are contributed by icekylinx with substantial OpenAI GPT-6 Astra assistance. +Repository integration uses Codex assistance and extends PR #130 at +6a9970a530119174507904e23592fd59ede19a5d. + +The substantial completed-core workspace-sharing principle is credited to +an664, PR #128, 530588a019b4a74f09180680c9e3961bf649ec89, with its reported +OpenAI Codex assistance. No source code, partition or serialized witness +from that PR is imported. The new routing and paired-motif integration +are described separately and claim no exclusive priority for broad sharing, +paired-coordinate, Fourier or carrier-matching ideas. + +Selected coarse queries restrict the retained eumemic PR #117 positive DAG; +its original Apache-2.0 and Claude assistance notices remain unchanged. +The bit word and original frames retain Zhihao Chen's PR #97 and Swapnil +Jain's frozen witness, notices and historical assistance disclosures. +Earlier generalized Clifford, three-stage, uniform weighted recursion, +ordinary-leaf, semantic/bulk, precision and analytic credits remain in force. +Source-specific license bytes are preserved under references/. + +October 9 recycled-bit integration: +DaysSky (#150), William Porter/hpst3r (#147), Thomas Marchand/Th0rgal (#146), +Rohan Gupta/gupt1156 (#148), James Chang/jamesyc (#124), SovereignSteak (#122). +The original notices and assistance disclosures are retained under research/, +including research/recycled-bit-integration/NOTICE. Andrew Barnes/Bortlesboat +(#101) repairs shared verifiers using rfu08's #64 counterexample. rfu08's +scoped finite and formal-transfer packages are included separately; they do +not establish the full multiplication theorem. Earlier and parallel credits +remain applicable. Douglas Colkitt integrated these with OpenAI Codex assistance. + +SovereignSteak PR151 independently supplies the matching gauge/recycling +composition and the selected 473/10^6 atom refinement; its original package +and assistance disclosure are retained under research/gauge-recycling/. + +October 9 coordinated-frame and completed-entrance-bank integration: +Dugongue PR186, 166a34d75e853e933855f0f7e940fe77c4bb6b8d, builds on +Chafik Boukhalfa/chafreaky's PR181, 7fb2194801e3a10f54772c7f0d5505035a4fc0ad, +and eumemic's PR168 v4, 4a3c769e5c5430e7114c4d3e099ff34664677f17. +The frozen package and prerequisite archive preserve all author, source-license +and assistance notices, including PR175's compiler optimization. DaysSky's +carrier closure, James Chang's terminal substitution and balanced assembly, +geckods' stopping refinements and all preceding framework credits remain. +Rohan Arun's PR185 bootstrap and chafreaky's PR182 bit refinement are reviewed +parallel contributions; their gains are not added to the selected witness. +Douglas Colkitt integrated the package and supplied the bank scheduling +supplement with OpenAI Codex assistance, under Apache-2.0. The all-size +interfaces remain conditional; finite verification is not full formalization. diff --git a/research/helper-quotient-basis-audit/credits/OUTER-GATE-NOTICE b/research/helper-quotient-basis-audit/credits/OUTER-GATE-NOTICE new file mode 100644 index 0000000000..1bc9b4da2b --- /dev/null +++ b/research/helper-quotient-basis-audit/credits/OUTER-GATE-NOTICE @@ -0,0 +1,13 @@ +# Attribution and source reuse + +New independent operator/invoice verification and fixed-grid interval implementation: OpenAI Codex-assisted research session, 2026-11-10. Apache-2.0. + +DreamingOfClouds supplied the #6936 native predecessor and #6937 shared-wire backup/E-free root. CubeJerry supplied #6912 caller blocks, #6980's QUERY-only caller and #6970/#6985 precision methods. Preserve Ali Romman's #5599 helper-split attribution, icekylinx's #104 odd-grid attribution and unpaidmoon's #6930 width-phase attribution in the parent construction. + +Three unchanged source files are authenticated by exact SHA256 and source commit/path in `INDEPENDENT-SOURCES.json`: + +- #6970 `independent_bounds.py`: fixed integer-grid and positive caller-transfer engine. +- #6985 `envelopes.py`: positive forward envelopes and backward covector witnesses. +- #6985 `source_binding.py`: retained helper functions for the envelope engine. + +The adapter applies only two literal helper-census substitutions in memory and records them. It does not call that adaptation an independent mathematical implementation. The new reverse native operator, formal caller ring and elementary interval engine do not import the source authors' operator or invoice checkers. diff --git a/research/helper-quotient-basis-audit/credits/PR7663-NOTICE b/research/helper-quotient-basis-audit/credits/PR7663-NOTICE new file mode 100644 index 0000000000..6ce1bc49a3 --- /dev/null +++ b/research/helper-quotient-basis-audit/credits/PR7663-NOTICE @@ -0,0 +1,7 @@ +Apache-2.0. Ali Romman with substantial OpenAI Codex assistance. + +The new material is the joint chart assignment, its source-bound operator and caller checks, and the fresh-cost complete-root scalar and private-bank specialization. The parent data are from Clear1nsight's PR #7660 on DreamingOfClouds' PRs #7658 and #7641 and SYLforge's PR #7637. The contributors credited in those sources retain their credit. Original notices are in source/parent-NOTICE, source/physical-NOTICE and source/word-NOTICE. + +Rohan Arun supplied the 17-stage signed caller in PR #7113. The unmodified interval gate and the exact caller data come from its pinned source. See source/caller-NOTICE and source/independent-NOTICE, and the source file inventory for all consumed bytes. The two operator engines and integer power evaluator come from the declared current-main inputs. + +Jerry Chen (CubeJerry) supplied selected PRs #7000 and #7001. The selected application and its phase, common-root, finite-cost and compiler arguments, the odd-native common-grid package, the prior typed six-Gamma reset of PR #7586 and the contributors credited in those records provided the foundations used here. PR #7661 independently derives the fixed caller residuals. PR #7662 supplies a rounded parent-clock alternative. This package uses neither implementation. diff --git a/research/helper-quotient-basis-audit/credits/PR7669-PROVENANCE.md b/research/helper-quotient-basis-audit/credits/PR7669-PROVENANCE.md new file mode 100644 index 0000000000..bbee2437f0 --- /dev/null +++ b/research/helper-quotient-basis-audit/credits/PR7669-PROVENANCE.md @@ -0,0 +1,43 @@ +# Provenance, credit and scope + +This is a cumulative contribution. Thank you to everyone who has made their constructions, exact inputs, failure cases and careful reviews available. Those contributions made this composition possible; the small increment here should not obscure the much larger body of work it rests on. We aim to leave equally inspectable material for the next researcher. + +## Direct lineage and reused methods + +- **SYLforge, #7637:** the H5B frame-restored233-CLEAR construction is the published ancestor of this research. The present K372-2 source retains its descendants rather than starting a new independent construction. [PR7637](https://github.com/CrocSwap/integer-mult-bounds/pull/7637). +- **DreamingOfClouds, #7641 and #7658:** #7641 combines20 edits over #7637. #7658 supplies the large-neighbourhood construction and its exact joint hub reconstruction: helper360/537 SWAP-NULL relabel, main176 bypass, helper236 contact re-chart, helper370 last-stay removal and helper461 first-stay removal. The source explicitly credits its #7630/#7636 relabel lineage and #7634 swap law. Our source descends from this word; those gains are not claimed as new work here. [PR7641](https://github.com/CrocSwap/integer-mult-bounds/pull/7641), [PR7658](https://github.com/CrocSwap/integer-mult-bounds/pull/7658). +- **Clear1nsight:** the contact re-chart type from #7612 and the24-bit coefficient-splitting report are part of the construction's lineage. #7626 contributed source isolation/portable materialization, and #7631/#7633 are credited by the parent lineage. #7660 separately published the role379 shortcut already present in our source; we do not count its rediscovery as another improvement. [PR7612](https://github.com/CrocSwap/integer-mult-bounds/pull/7612), [coefficient report](https://github.com/CrocSwap/integer-mult-bounds/discussions/7111#discussioncomment-19691406), [PR7660](https://github.com/CrocSwap/integer-mult-bounds/pull/7660). +- **ToikY, #7643:** the contact re-chart work is explicitly credited by #7658 alongside Clear1nsight's #7612. Its74-erasure contract and κ are not added to this candidate. No shared CI repair is copied by this PR. [PR7643](https://github.com/CrocSwap/integer-mult-bounds/pull/7643). +- **Rohan Arun, #7113:** the signed caller/accounting lineage underlies the actual16-call composition. Its original source commit is07a76c5e2738882c0cb322278e56f6cae3c9885d. We recount the literal16-call input here; we do not substitute historical17-call constants. [PR7113](https://github.com/CrocSwap/integer-mult-bounds/pull/7113). +- **Ali Romman and upstream contributors:** #7605 supplies an earlier exact protected/application checkpoint cited by the #7637 lineage. The two unmodified directed invoice comparison files are copied from canonical upstream base e54523517d0f03e58352e647c403a5af3e525a57, retaining their attribution and Apache-2.0 headers. Their arithmetic is not a full scientific acceptance gate. [PR7605](https://github.com/CrocSwap/integer-mult-bounds/pull/7605). +- **CubeJerry, Douglas Colkitt and the earlier source contributors:** the retained framework, primitive/service work and repository infrastructure form part of the inherited basis. This package does not claim that their open supplier obligations are resolved by a successful finite replay. + +## What this contribution adds + +The predecessor K372-2 supplies five EARLY edits (1188,1013,940,1141,1195, with940/1141 sharing one ADD). This construction recomputes the1517/770 bypass on that actual source and combined it with a three-field triangle repair. The new contribution is their compatible composition, exact12-block edit, final235 CLEAR witnesses and a small reproducible publication package. Substantial OpenAI Codex assistance was used for research and packaging. New work is Apache-2.0. + +Exact source canonical:3dd1199d95291ee96e6c0aeb6f55f86244a569b1d4975840bf0207e2dcf9c025. Exact candidate canonical:ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d. Byte hashes are in MANIFEST.json. The12 edit blocks specify every changed event and leave all other fields unchanged. The parent research generators are not silently imported; this publication uses the transparent exact edit as its deterministic reconstruction recipe. + +## Related work, not automatically incorporated + +Ali Romman's #7662 studies one half-ADD rounding-error propagation with CubeJerry's service contract. Nick Petalas's #7654 provides a scoped minimal-rank interpolation result used as background when assessing structural repairs. Neither is a substitute for this candidate's entire rounded caller or physical supply proof. Their actual domains and assumptions must be checked before application. [PR7662](https://github.com/CrocSwap/integer-mult-bounds/pull/7662), [PR7654](https://github.com/CrocSwap/integer-mult-bounds/pull/7654). + +At the publication checkpoint, upstream main remained e54523517d0f03e58352e647c403a5af3e525a57. Ali Romman's #7663 uses a separate17-call full-private-bank model and changed helper endpoints; Clear1nsight's #7664 concerns180erasures/17calls; #7666 charges bank selection and return without claiming a new κ. K372-4 is later, separate research with changed helper-boundary conditions. None is silently folded into ee251f60 or used to assert identical physical assumptions. This is not a claim to the greatest bound across all models. + +## Fresh versus reused evidence + +Publication replay freshly reconstructs the whole word, runs exact rows/CLEAR, recounts native/caller histograms and checks the four directed price points. Normal, optimized Python and a Git-free committed-byte export were tested. The recorded ordinary/precision/native-phase/owner evidence retains its narrower scope and original source identifiers; it is not advertised as freshly rerun. No selected record, frozen predecessor package or common verifier is changed. + +## Editorial normalization of publication labels + +The follow-up editorial commit replaces workstation labels with construction terminology. It changes no candidate, edit, certificate, invoice, numeric result, executable code or contributor attribution. The original recorded bytes remain retrievable at commit `95d476623f1468822057554475dc8badb19bfa44`. Evidence JSON field labels and descriptive scopes are normalized, not recomputed scientific results. In NATIVE-EVIDENCE-REUSE.json, `predecessor-receipt:K372-2/NATIVE-NEW.json` is a historical receipt identifier, not a packaged file path. In PRICE-SUMMARY.json, recorded command invoice arguments now use the equivalent packaged `data/INVOICE.json` path; this is a portability transcription, not the verbatim original command. The fresh replay constructs and runs its own package-relative command. MANIFEST.json authenticates the edited publication bytes. + +Evidence byte-custody mapping (original -> editorially normalized SHA-256): + +- `evidence/BUILD.json`: `4744201691120223ded62a3e0d55ea1029203f3ea996305163e7db8d9e3679a4` -> `a0bafbb3f44920ed6ac1ed3d83385f025f5bbbcf5e9c8013ab1ca55ccf23c32d`. + +- `evidence/NATIVE-EVIDENCE-REUSE.json`: `6615b8a051ac9e4d8c73b5decf8a70d2a33d14da0c4c369574dec946984aa351` -> `84bab14d5c584aa8853b8e1025b562541ac6657e458d120ec803f2bc149c3eb8`. + +- `evidence/ROLE770-BUILD.json`: `c4ee72317678791d4b801479df0af052f3a50662c11ce3f3393b2151368fc92d` -> `1c400f16efbc427c40c811a57dc656fe97c2c84f94c71529e2c5c0598b146369`. + +- `evidence/PRICE-SUMMARY.json`: `c2777382c677634f7017b68c55dbd831a40945b77057f26b738f857c17ee8759` -> `d13741fe3217a01edd0b79b40dad037e644e441fbbc300838df99c0b050a5f42`. diff --git a/research/helper-quotient-basis-audit/credits/PR7674-NOTICE b/research/helper-quotient-basis-audit/credits/PR7674-NOTICE new file mode 100644 index 0000000000..951f081717 --- /dev/null +++ b/research/helper-quotient-basis-audit/credits/PR7674-NOTICE @@ -0,0 +1,7 @@ +Apache License 2.0. Research prepared for Ali Romman with substantial OpenAI Codex assistance. + +New work includes the fifteen certified sender/receiver pivots, the forward and transposed communication construction, the complete native row checker, and the finite stock and precision application for this 16-call program. + +SYLforge supplied the composition, native word reconstruction, published invoice and exact 16-stage caller bytes from PR #7669. Their original PROVENANCE.md is preserved in source/7669-CREDITS.md. It credits the H5B work of SYLforge, DreamingOfClouds' joint native reconstructions, Clear1nsight's coefficient splitting, role-379 and helper work, Rohan Arun's signed caller lineage, and prior contributions from CubeJerry, Douglas Colkitt and others. The source/ directory holds the exact file bytes identified in SOURCE-PINS.json. + +The group-ring caller checker, independent operator checks, bit service, finite-cost method and field guide adapt the corresponding code and arguments of Ali Romman's PR #7663. That package in turn builds on the contributors named in its preserved source/7663-NOTICE. The unchanged directed log/exp gate retains its listed sources in source/gate-NOTICE. Earlier paid-transfer and bank-support constructions include PRs #7434 and #7576. Jerry Chen (CubeJerry) supplied the selected PRs #7000 and #7001 and the typed initializer in PR #7586. The per-call odd-grid induction and the selected application review provide the complete-root realization and finite-cost substitution. Douglas Colkitt and the credited repository authors supplied the pinned operator engines, price evaluator and research workflow. The license accompanies this package. diff --git a/research/helper-quotient-basis-audit/credits/PR7682-NOTICE b/research/helper-quotient-basis-audit/credits/PR7682-NOTICE new file mode 100644 index 0000000000..4654631de0 --- /dev/null +++ b/research/helper-quotient-basis-audit/credits/PR7682-NOTICE @@ -0,0 +1,9 @@ +Apache License 2.0. Research prepared for Clear1nsight with substantial OpenAI Codex assistance. + +Ali Romman supplied the fifteen exact banked pivots and the frozen #7674 baseline, along with the complete signed 16-call graph and application method. The original notices remain at peer/NOTICE, peer/source/7663-NOTICE and peer/source/gate-NOTICE. Read peer/SOURCE-PINS.json for each ancestry binding and ASSETS.json for the exact vendored bytes at scientific commit 26b6c469aa6c4aa04322ce25a22150f90e5fb14e and refreshed head 28b2af322a1fab01b3734365988930920f9dda48. + +SYLforge supplied the #7669 composition, native source pins and literal caller. Its preserved parent provenance is peer/source/7669-CREDITS.md. Retain DreamingOfClouds' #7641/#7658 lineage, Clear1nsight's integer scalar/contact work including #7612, ToikY's #7643 contact-rechart precedent, Rohan Arun's #7113 signed-caller lineage, 5080's helper work, and all other contributors named in the original records. Ali Romman's #7663 exact-grid and extent proof and #7666/#7670 selection and guide work supply relevant implementation precedents. Jerry Chen (CubeJerry) supplied the selected #7000/#7001 applications and #7586 typed initialization. Douglas Colkitt and the authors in the original notices supplied the frozen native compiler, independent checker, price evaluator and package infrastructure. + +The release base reuses ToikY's exact shared CI and historical replay sync 0eabc624a9bc9ed2847719efd63390db4d297df4 above canonical e54523517d0f03e58352e647c403a5af3e525a57. This workflow provenance is separate from the banked construction and its mathematical comparison. + +This package credits the original role-230 splice and its same-contract transfer to the unchanged fifteen-pivot graph, the independent exact wire and price replays, matched complete resource accounting and source-bound native and caller verification. The original works retain their authorships and licenses. diff --git a/research/helper-quotient-basis-audit/credits/PR7704-NOTICE b/research/helper-quotient-basis-audit/credits/PR7704-NOTICE new file mode 100644 index 0000000000..7d2dfec60a --- /dev/null +++ b/research/helper-quotient-basis-audit/credits/PR7704-NOTICE @@ -0,0 +1,5 @@ +Apache License 2.0. Prepared for Clear1nsight with substantial OpenAI Codex and ChatGPT Pro assistance. + +SYLforge supplied the cf6a nine-swap word and its normalized verification in #7700. DreamingOfClouds contributed the #7641 and #7658 swap searches. Ali Romman supplied the changed helper contract in #7663 and the charged bank construction in #7674. Rohan Arun and the #7113 lineage supplied the signed caller. The bank, native, physical and directed price methods reuse work by Ali Romman, SYLforge, Clear1nsight and the contributors credited in #7669, #7682 and #7697. Jerry Chen (CubeJerry) supplied the selected #7000 and #7001 application. Douglas Colkitt and the recorded authors supplied the selected framework, compiler, checker and package infrastructure. + +This contribution identifies and contracts the two paid transfers on helper 1256, reconstructs the banked graph from the supplied source, and checks the resulting physical application and complete signed price. The separate investigation and technical review were performed with Codex agents. Preserve the original notices and citations in credits/ when redistributing the source data or derived engines. See SOURCES.json for pinned upstream inputs and ASSETS.json for file-level custody. diff --git a/research/helper-quotient-basis-audit/credits/PR7705-NOTICE b/research/helper-quotient-basis-audit/credits/PR7705-NOTICE new file mode 100644 index 0000000000..2a92a9df69 --- /dev/null +++ b/research/helper-quotient-basis-audit/credits/PR7705-NOTICE @@ -0,0 +1,7 @@ +Apache License 2.0. Research prepared by DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. + +The contribution is the hub-reroute construction: its search, the exact builder, the 21 reroutes and the checks in this package. All code here is newly written, and predecessor packages were read as data only. + +Clear1nsight supplied the chart-595 helper split (PR #7697) and the role-230 rechart (PR #7682), which is the first hub reroute. Ali Romman supplied the banked-transfer circuit and its fifteen pivots (PR #7674). SYLforge supplied the #7669 word and the signed sixteen-call caller. DreamingOfClouds, Rohan Arun, Jerry Chen (CubeJerry), Douglas Colkitt and the authors credited in the inherited notices supplied predecessor constructions, the selected framework and the repository infrastructure. + +The exact predecessor notices are in `credits/`. `source/` holds the K372-2 word, the twelve #7669 edits and the 16-call caller as published with #7669. `ASSETS.json` binds every package file. diff --git a/research/helper-quotient-basis-audit/credits/PR7708-NOTICE b/research/helper-quotient-basis-audit/credits/PR7708-NOTICE new file mode 100644 index 0000000000..4a24e9bcb7 --- /dev/null +++ b/research/helper-quotient-basis-audit/credits/PR7708-NOTICE @@ -0,0 +1,7 @@ +Apache License 2.0. Prepared for Ali Romman with substantial OpenAI Codex assistance in research, implementation, verification and writing. + +This contribution supplies the ordered 46-cut certificate on the exact #7704 graph, the source and receiver recoding with scalar feedback, its 3 witnesses, the composition checks and the signed application. + +SYLforge supplied the nine-swap source word in #7700. DreamingOfClouds and SYLforge supplied the preceding native searches. Clear1nsight supplied the #7704 role-1256 contraction and the open pivot-combination question, the #7682 role-230 reroute and the #7697 chart-595 split. DreamingOfClouds supplied the grouped hub mechanism in #7705 on a different graph. Ali Romman supplied the banked transfer pivots and catalogue method in #7674 and the predecessor common-grid construction in #7663. Rohan Arun supplied the signed caller lineage. Jerry Chen (CubeJerry) supplied the selected complex application and BIT input. Douglas Colkitt and the credited repository contributors supplied the source framework, compiler, operator engines, comparison tools and research infrastructure. + +The files under vendor/ and data/ retain their published bytes. SOURCE-PINS.json identifies each original file and commit. The catalogue checker adapts the #7674 checker to the new graph and adds signed contact checks. The independent operator producer and checker and the directed invoice tools come from the canonical source files in SOURCES.json. The original supplier notices, including those for the outer gate, are under credits/. Preserve these notices with the reused material. diff --git a/research/helper-quotient-basis-audit/credits/PR7713-NOTICE b/research/helper-quotient-basis-audit/credits/PR7713-NOTICE new file mode 100644 index 0000000000..8fa17b3fd6 --- /dev/null +++ b/research/helper-quotient-basis-audit/credits/PR7713-NOTICE @@ -0,0 +1,7 @@ +Apache License 2.0. Ali Romman prepared this work with substantial OpenAI Codex assistance in research, implementation, verification and writing. + +New work includes the coupled helper and paid-bank restriction, its 33 witnesses, the compact interface, the independent checks of 67 receiver identities and the signed application on 1,468 public fields. + +The exact application starts from Ali Romman's 46-cut graph in PR #7708. SYLforge supplied the nine-swap word in #7700. Clear1nsight supplied the role-1256 relay and banked physical schedule in #7704. DreamingOfClouds supplied the related grouped-hub method on the separate chart-595 graph in #7705. Ali Romman supplied the preceding pivot, common-grid and signed-bill checks. Rohan Arun supplied the signed caller lineage. Jerry Chen (CubeJerry) supplied the selected complex application and BIT input. Douglas Colkitt and the credited repository contributors supplied the research framework, compiler, exact operator engines and comparison tools. The concave comparison retains mightyOil's method credit. + +The files under vendor/ and data/ retain their source bytes. SOURCE-PINS.json gives original commits, paths, Git blobs and SHA-256 values. SOURCES.json pins the canonical repository inputs. The catalogue and reverse sweep adapt the corresponding #7708 checks to the compact graph. The supplier notices are under credits/. Preserve them with the reused work. diff --git a/research/helper-quotient-basis-audit/interface.json b/research/helper-quotient-basis-audit/interface.json new file mode 100644 index 0000000000..85b80d5ff5 --- /dev/null +++ b/research/helper-quotient-basis-audit/interface.json @@ -0,0 +1,812 @@ +{ + "hosted": { + "Dports": [ + 0, + 1, + 2, + 3, + 4, + 5, + 6, + 7, + 8, + 9, + 10, + 11, + 12, + 13, + 14, + 16, + 18, + 19, + 20, + 21, + 22, + 23, + 24, + 25, + 26, + 28, + 29, + 30, + 31, + 32, + 33, + 36, + 37, + 38, + 39, + 40, + 41, + 43, + 44, + 45, + 46, + 48, + 49, + 50, + 51, + 52, + 53, + 54, + 56, + 57, + 58, + 59, + 60, + 61, + 62, + 63, + 64, + 65, + 66, + 67, + 68, + 69, + 70, + 71, + 72, + 73, + 74, + 75, + 76, + 77, + 78, + 79, + 80, + 81, + 82, + 83, + 84, + 85, + 86, + 87, + 88, + 89, + 90, + 91, + 92, + 93, + 94, + 95, + 96, + 97, + 98, + 99, + 100, + 101, + 102, + 103 + ], + "X2": [ + 772, + 773, + 774, + 776, + 777, + 778, + 779, + 780, + 781, + 782, + 783, + 784, + 785, + 787, + 788, + 790, + 792, + 794, + 795, + 796, + 797, + 798, + 799, + 800, + 801, + 803, + 804, + 805, + 807, + 808, + 809, + 813, + 814, + 815, + 816, + 817, + 818, + 819, + 820, + 821, + 822, + 823, + 824, + 825, + 826, + 827, + 828, + 829, + 832, + 833, + 834, + 835, + 836, + 837, + 838, + 839, + 840, + 841, + 842, + 843, + 844, + 845, + 847, + 848, + 849, + 850, + 851, + 852, + 853, + 854, + 855, + 856, + 857, + 858, + 859, + 860, + 861, + 862, + 864, + 865, + 866, + 867, + 868, + 869, + 870, + 871, + 872, + 873, + 874, + 875, + 876, + 877, + 878, + 879, + 880, + 881 + ], + "Y2": [ + 882, + 883, + 884, + 886, + 887, + 888, + 889, + 890, + 891, + 892, + 893, + 894, + 895, + 897, + 898, + 899, + 900, + 902, + 903, + 904, + 905, + 906, + 907, + 908, + 909, + 910, + 911, + 912, + 914, + 915, + 916, + 918, + 919, + 920, + 921, + 922, + 923, + 925, + 926, + 927, + 928, + 930, + 931, + 932, + 933, + 934, + 935, + 936, + 938, + 939, + 940, + 941, + 942, + 943, + 944, + 945, + 946, + 947, + 948, + 949, + 950, + 951, + 953, + 954, + 955, + 956, + 957, + 958, + 959, + 960, + 961, + 962, + 963, + 964, + 965, + 966, + 967, + 968, + 970, + 971, + 972, + 973, + 974, + 975, + 976, + 977, + 978, + 979, + 980, + 981, + 982, + 983, + 984, + 985, + 986, + 987 + ], + "alpha": "-1", + "alpha2": "-1", + "beta": "1/2", + "beta2": "0", + "mode": "mix-t0" + }, + "live": [ + 0, + 1, + 2, + 4, + 5, + 6, + 7, + 8, + 9, + 10, + 11, + 12, + 13, + 15, + 16, + 17, + 18, + 19, + 20, + 22, + 23, + 24, + 25, + 26, + 27, + 28, + 29, + 30, + 31, + 32, + 33, + 35, + 36, + 37, + 38, + 40, + 41, + 42, + 43, + 44, + 45, + 46, + 47, + 48, + 49, + 50, + 51, + 52, + 53, + 54, + 55, + 56, + 57, + 58, + 59, + 60, + 62, + 63, + 64, + 65, + 66, + 67, + 68, + 69, + 70, + 71, + 72, + 73, + 74, + 75, + 77, + 78, + 79, + 80, + 81, + 82, + 83, + 84, + 85, + 86, + 87, + 88, + 89, + 90, + 91, + 92, + 94, + 95, + 96, + 97, + 98, + 99, + 100, + 101, + 102, + 103, + 104, + 105, + 106, + 107, + 108, + 109, + 110, + 111 + ], + "main_roles": [ + 0, + 1, + 2, + 4, + 5, + 6, + 7, + 8, + 9, + 10, + 11, + 12, + 13, + 15, + 16, + 17, + 18, + 19, + 20, + 22, + 23, + 24, + 25, + 26, + 27, + 28, + 29, + 30, + 31, + 32, + 33, + 35, + 36, + 37, + 38, + 40, + 41, + 42, + 43, + 44, + 45, + 46, + 47, + 48, + 49, + 50, + 51, + 52, + 53, + 54, + 55, + 56, + 57, + 58, + 59, + 60, + 62, + 63, + 64, + 65, + 66, + 67, + 68, + 69, + 70, + 71, + 72, + 73, + 74, + 75, + 77, + 78, + 79, + 80, + 81, + 82, + 83, + 84, + 85, + 86, + 87, + 88, + 89, + 90, + 91, + 92, + 94, + 95, + 96, + 97, + 98, + 99, + 100, + 101, + 102, + 103, + 104, + 105, + 106, + 107, + 108, + 109, + 110, + 111, + 112, + 113, + 114, + 116, + 117, + 118, + 119, + 120, + 121, + 122, + 123, + 124, + 125, + 127, + 128, + 129, + 130, + 131, + 132, + 134, + 135, + 136, + 137, + 138, + 139, + 140, + 141, + 142, + 143, + 144, + 145, + 147, + 148, + 149, + 150, + 152, + 153, + 154, + 155, + 156, + 157, + 158, + 159, + 160, + 161, + 162, + 163, + 164, + 165, + 166, + 167, + 168, + 169, + 170, + 171, + 172, + 174, + 175, + 176, + 177, + 178, + 179, + 180, + 181, + 182, + 183, + 184, + 185, + 186, + 187, + 189, + 190, + 191, + 192, + 193, + 194, + 195, + 196, + 197, + 198, + 199, + 200, + 201, + 202, + 203, + 204, + 206, + 207, + 208, + 209, + 210, + 211, + 212, + 213, + 214, + 215, + 216, + 217, + 218, + 219, + 220, + 221, + 222, + 223, + 772, + 773, + 774, + 776, + 777, + 778, + 779, + 780, + 781, + 782, + 783, + 784, + 785, + 787, + 788, + 790, + 792, + 794, + 795, + 796, + 797, + 798, + 799, + 800, + 801, + 803, + 804, + 805, + 807, + 808, + 809, + 813, + 814, + 815, + 816, + 817, + 818, + 819, + 820, + 821, + 822, + 823, + 824, + 825, + 826, + 827, + 828, + 829, + 832, + 833, + 834, + 835, + 836, + 837, + 838, + 839, + 840, + 841, + 842, + 843, + 844, + 845, + 847, + 848, + 849, + 850, + 851, + 852, + 853, + 854, + 855, + 856, + 857, + 858, + 859, + 860, + 861, + 862, + 864, + 865, + 866, + 867, + 868, + 869, + 870, + 871, + 872, + 873, + 874, + 875, + 876, + 877, + 878, + 879, + 880, + 881, + 882, + 883, + 884, + 886, + 887, + 888, + 889, + 890, + 891, + 892, + 893, + 894, + 895, + 897, + 898, + 899, + 900, + 902, + 903, + 904, + 905, + 906, + 907, + 908, + 909, + 910, + 911, + 912, + 914, + 915, + 916, + 918, + 919, + 920, + 921, + 922, + 923, + 925, + 926, + 927, + 928, + 930, + 931, + 932, + 933, + 934, + 935, + 936, + 938, + 939, + 940, + 941, + 942, + 943, + 944, + 945, + 946, + 947, + 948, + 949, + 950, + 951, + 953, + 954, + 955, + 956, + 957, + 958, + 959, + 960, + 961, + 962, + 963, + 964, + 965, + 966, + 967, + 968, + 970, + 971, + 972, + 973, + 974, + 975, + 976, + 977, + 978, + 979, + 980, + 981, + 982, + 983, + 984, + 985, + 986, + 987 + ], + "public": 1501 +} diff --git a/research/helper-quotient-basis-audit/parent-application.json b/research/helper-quotient-basis-audit/parent-application.json new file mode 100644 index 0000000000..beec452311 --- /dev/null +++ b/research/helper-quotient-basis-audit/parent-application.json @@ -0,0 +1,695 @@ +{ + "bracket": [ + "0.00374039009047", + "0.00374039009048" + ], + "caller": { + "calls": 16, + "dyadic_height": 9, + "exact_preproduct_divisions": 153295, + "fixed_caller_paid": { + "1": 384, + "8": 640, + "9": 32, + "16": 416, + "24": 416, + "32": 416, + "40": 416, + "48": 416, + "56": 416 + }, + "fixed_root_targets": { + "9": 416, + "17": 416, + "25": 416, + "33": 416, + "41": 416, + "49": 416, + "57": 416, + "65": 416, + "129": 208 + }, + "odd_scale": 2025, + "peak_scaled_mass": "495734175/2", + "peak_witness": [ + 1196, + "stored sum" + ], + "roles": 68, + "root_owners": 3536, + "uses": { + "ADD": 92400, + "IDLE_ODD": 32, + "IDLE_ONE": 3136, + "LAMBDA": 10672, + "QUERY": 384, + "SCALE": 11728, + "SWAP": 240 + } + }, + "claim": "0.00374039009039", + "compiler": { + "BIT_margin": "1314995477/50000000000000", + "BIT_pin": "376669/100000000", + "H": "14617400000000000000", + "alpha": [ + 0.9999999999999847, + 0.9999999999999847 + ], + "claim": "374039009039/100000000000000", + "compiler_gap": "1/100000000000000", + "delta": [ + 0.9324656693530149, + 0.9324656693530149 + ], + "derivative_upper": -347252.8794022977, + "gamma": [ + 0.9340309057512434, + 0.9340309057512434 + ], + "input_lift": { + "derivative_upper_on_required_interval": "-2299831290525933154178526076272396899996972093654613095735772838275432653960006518819/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + "interval_kappa_cap": "376669/100000000", + "margins": { + "187019504523/50000000000000": [ + "31867947428528767731842151578548916126682050789814024673601432161619218289483/25000000000000000000000000000000000000000000000000000000000000000000000000000000", + "25494357942823014185473721262839132901345640631851219738881145729295374631979/20000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "374039009039/100000000000000": [ + "127471789711834022913135653400183783077800272130383902178040696620298703349843/100000000000000000000000000000000000000000000000000000000000000000000000000000000", + "127471789711834022913135653400183783077800272130383902178040696620298703351763/100000000000000000000000000000000000000000000000000000000000000000000000000000000" + ] + }, + "source_BIT_wide_crude_bound_would_be": "-2299831290525933154178526076272396899996972093654613095735772838275432653960006518819/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000" + }, + "minimum_log_power": 2295, + "moment_margin_float": { + "187019504523/50000000000000": [ + 4.136998743571411e-09, + 4.136998743571411e-09 + ], + "374039009047/100000000000000": [ + 6.137146742010277e-10, + 6.137146742010277e-10 + ], + "46754876131/12500000000000": [ + -2.9095693951692108e-09, + -2.9095693951692108e-09 + ] + }, + "moment_margins": { + "187019504523/50000000000000": [ + "25856242147321316140206447966775372880221117214093807126278323532281653/6250000000000000000000000000000000000000000000000000000000000000000000000000000", + "25856242147321316140206447966775372880221117214093807126278323534518023/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "374039009047/100000000000000": [ + "3835716713756422793035549018256668483836802086113875291596852829527159/6250000000000000000000000000000000000000000000000000000000000000000000000000000", + "3835716713756422793035549018256668483836802086113875291596852831758451/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "46754876131/12500000000000": [ + "-4546202179951891988309597805342739816873328101587478432603643114003927/1562500000000000000000000000000000000000000000000000000000000000000000000000000", + "-181848087198075679532383912213709592674933124063499137304145724537851/62500000000000000000000000000000000000000000000000000000000000000000000000000" + ] + }, + "outer": { + "BIT_just_below_effective_rejected": true, + "functional_count": 4, + "minimum_margin": "1/1000000000000000", + "strict_count": 54 + }, + "raw_bracket": [ + "374039009047/100000000000000", + "46754876131/12500000000000" + ], + "tested": "187019504523/50000000000000", + "written_log_power": 2296 + }, + "conditional_interfaces": [ + "native_all_columns", + "owned_erasure", + "compiler", + "precision_tape", + "analytic_recovery" + ], + "cut_counts": { + "feedback": 3, + "group": 21, + "pivot": 22 + }, + "graph_sha256": "db10e4ca7154b454f86bf404bc34b3a16d02de6cc008d5227e4eef2654cb0778", + "invoice": { + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "paid": { + "1": 63440, + "16": 416, + "2": 13952, + "24": 416, + "3": 9152, + "32": 416, + "4": 3936, + "40": 416, + "48": 416, + "5": 5904, + "56": 416, + "6": 1568, + "7": 176, + "8": 768, + "9": 96 + }, + "schema": "integer-mult-recursive-invoice/v1", + "targets": { + "1": 288, + "129": 208, + "17": 416, + "2": 336, + "25": 416, + "3": 752, + "33": 416, + "4": 3664, + "41": 416, + "49": 416, + "5": 1216, + "57": 416, + "6": 736, + "65": 416, + "7": 272, + "8": 512, + "9": 10256 + } + }, + "paid": 101488, + "paid_delta": { + "1": -288, + "2": 48, + "3": -368, + "4": 96, + "5": 80, + "6": 48, + "7": 32 + }, + "parent_bracket": [ + "0.00373004177032", + "0.00373004177033" + ], + "physical": { + "caller_envelope": { + "binary_height_at_all_completed_cuts_and_products": 325, + "binary_height_at_native_entrances": 318, + "normalized_bound_uses_no_cancellation_or_commutation": true, + "records": 4192, + "scaled_mass_at_all_cuts_and_products": "422697641667541055184649383436611894902745135854144098178147008285122975926924780864462653005878076090749928607858304935653611344748944586891405006118422035825340979484130265226717/787320000000000", + "scaled_mass_at_native_entrances": "841540548201148271304709423731170105326708333407364819898222426096105903810343041288214438457604474421941928920227707368470121101079538458948446020268383922323667853993448395617/100776960000000", + "stages": 16, + "uses": { + "ADD": 92400, + "IDLE_ODD": 32, + "IDLE_ONE": 3136, + "LAMBDA": 10672, + "QUERY": 384, + "SCALE": 11728, + "SWAP": 240 + } + }, + "common_root": { + "H_guard": "bit_length(context_c*1920*153**1920*(H+1)**2) < H for each actual compiler bound H", + "caller_odd": 2025, + "context_binary_bits": 338, + "context_c": 1156, + "context_mass_bits": 578, + "context_mass_bound": "2020364950059785188546063090429257730751564686833621008809099431232135296822118588416990031081746106492475216760882735797197446204639442296081953665424606378202137443179442954993607660812897/3439853568000000", + "exact_grid": "2^(-p-D)", + "native_binary": { + "candidate": 20 + }, + "native_odd": { + "candidate": 2025 + }, + "signed_width": "W=p+h+2D+3", + "temporary_width": "W+26" + }, + "depth_guard": { + "argument_bit_length": 14083, + "compiler_H": 14617400000000000000, + "strict_guard_passed": true + }, + "native": { + "additional_independent_guarded_streams": 4, + "all_public_inputs_preserved_until_final_installs": true, + "checked_nontrivial_divisions": 4863931, + "checked_nontrivial_divisions_by_denominator": { + "2": 2408833, + "3": 68834, + "4": 1669843, + "5": 48656, + "6": 24216, + "8": 417439, + "9": 13, + "10": 6501, + "12": 3606, + "16": 133629, + "20": 14974, + "24": 6633, + "32": 40402, + "40": 620, + "48": 429, + "64": 18896, + "96": 172, + "128": 165, + "192": 60, + "256": 4, + "384": 6 + }, + "coefficient_products": 9280471, + "declared_senders": 1, + "deferred_terminal_banks": 1501, + "exact_all_public_rows": 1501, + "exact_odd_unscale_outputs": 1501, + "fixture_addressed_cells_overwritten": { + "clear_full_sender_after_return": 24484, + "initialize_complete_dirty_home": 36512, + "initialize_empty_sender_before_departure": 24484, + "retire_complete_home": 36512 + }, + "fixture_addressed_cells_per_home": 4, + "guarded_dummy_slots": 1, + "immutable_entry_banks": 1501, + "immutable_paid_return_banks": 6121, + "live_sender_alias_control_rejected": true, + "max_outstanding_native_senders": 1, + "maximum_exact_row_prefix_mass_scaled": "27984388275/16", + "minimum_product_grid": 921600, + "minimum_snapshot_grid": 23040, + "missing_odd_factor_controls": { + "3": { + "coefficient": "-2/3", + "denominator": 3, + "donor": -1474, + "entrance_column": 1473, + "numerator_without_factor": -52428800, + "positive_remainder": 1, + "removed_factor": 81, + "row": 88440 + }, + "5": { + "coefficient": "1/10", + "denominator": 10, + "donor": -1320, + "entrance_column": 1319, + "numerator_without_factor": 84934656, + "positive_remainder": 6, + "removed_factor": 25, + "row": 88808 + } + }, + "native_scalar_scratch_homes": 4, + "numerical_homes": 9128, + "paid_native_ranks": { + "1": 3941, + "2": 872, + "3": 572, + "4": 246, + "5": 369, + "6": 98, + "7": 11, + "8": 8, + "9": 4 + }, + "path_grid": 2123366400, + "path_grid_height": 20, + "path_grid_odd": 2025, + "positive_helper_ranks": { + "1": 18, + "2": 21, + "3": 47, + "4": 229, + "5": 76, + "6": 46, + "7": 17, + "8": 32, + "9": 615 + }, + "positive_path_mass_bound_unscaled": "2400793347841/69120", + "positive_path_mass_peak_node": 156140, + "public": 1501, + "retired_and_guards_restored": true, + "same_owner_complete_fixture_outputs": 1501, + "selected_logical_operations": { + "clear_full_sender_after_return": 6121, + "initialize_complete_dirty_home": 9128, + "initialize_empty_sender_before_departure": 6121, + "read_immutable_donor": 177531, + "read_parked_sender": 6121, + "read_terminal_for_same_owner_install": 1501, + "retire_complete_home": 9128, + "stage_full_sender": 6121, + "write_complete_return": 6121, + "write_entrance": 1501, + "write_terminal": 1501 + }, + "separate_guide_tracks": 1, + "slots": 6121, + "terms": 177531, + "trace_sha256": "0d2dfdb751c6f0ca29a3ef52bc463ee57656be06e264a9d74ef8084f12e2eb0e", + "tracked_stream_reset_visits": 540215 + }, + "ordinary": { + "additional_full_overwrite_steps_per_reset_L_and_constant": [ + 2, + 3 + ], + "compiled_ordinary_work": "Full-view resets, selects, copies, guide and layout setup and return, exact scalar and odd conversions, matchers, fixed descriptors, root normalization, and all native, caller and child adapters.", + "compiled_stock": "Disjoint occurrence-tagged bank tuples, dummy origins, guides and four guarded streams per stage; complete public owners, matching child views, compiler and BIT workspace, and every parked ancestor.", + "layout": { + "aggregate_owned_tuple_M": "sum_stage[(homes+6)(L'+2)+ell(N_c)+ell(W+26)+max(ell(N_c),ell(W+26),ell(homes))+max(N_c,homes)+max(W+26,ell(homes))+10]", + "complete_view_step_bound": "34*(256(M+352)+128) plus fixed-degree descriptor work", + "guide_setup_and_retirement": "q(N_c)+q(W')+22N_cW'+36N_c+7W'+36+7L'+10; q(x)=24x-7popcount(x)+15ell(x)+12; W'=W+26", + "padded_payload": "L'=N_c(2(W+26)+3)", + "per_stage_selector_and_stream_tracks": 11, + "shadow_cells_upper": "M+352" + }, + "native_numeric_homes": 9128, + "native_numeric_homes_plus_dummy": 9129, + "native_paid_wrappers": 97936, + "native_productive_wrappers": 17616, + "odd_conversions": 55104, + "ordinary_elementary_record_upper": 26543706112, + "ordinary_main_pair_slots": 6400, + "ordinary_map_slots": 279808, + "raw_numeric_homes": 146048, + "raw_numeric_homes_plus_dummy": 146064, + "raw_paid_positions": 101488, + "raw_productive_targets": 21152, + "raw_scalar_incidence_allowance_before_factor_32": { + "complete_array_odd_conversions": 55104, + "literal_native_products_and_accumulations": 2840496, + "private_home_flags_and_cleanup": 146048, + "public_boundary_installations_and_scale_preparations": 48032, + "serial_sender_initialization_and_retirement": 195872, + "weighted_signed_caller_operation_slots": 118592, + "width_padded_native_row_lifecycles": 487808 + }, + "reset_services_all_native_stages": 24283616, + "reset_services_by_kind_per_native": { + "dirty_home_initializations_and_retirements": 18256, + "owner_scale_unscale_stream_initializations_and_retirements": 6004, + "sender_reinitializations_and_retirements": 12242, + "term_and_row_stream_initializations_and_retirements": 1481224 + }, + "reset_services_per_native": 1517726, + "root_negative_q_translations": 3536, + "scalar_services": 124542464, + "scalar_step_rate": 2097152, + "selected_total_steps_per_native_L_and_constant": [ + 246809218422, + 1111211094456 + ], + "selected_total_steps_raw_L_and_constant": [ + 3948947494752, + 17779377511296 + ], + "selector_steps_per_selected_service_L_and_constant": [ + 127801, + 575459 + ], + "separate_guarded_guide_tracks_per_native": 1, + "separate_guarded_guide_tracks_raw": 16, + "separate_guarded_streams_per_native": 4, + "separate_guarded_streams_raw": 64, + "typed_selected_transfer_legs_all_native_stages": 6608576, + "typed_selected_transfers_per_native": 413036, + "typed_transfer_legs_by_kind_per_native": { + "complete_scalar_donor_staging_legs": 355062, + "complete_sender_and_terminal_staging_legs": 15244, + "immutable_entrance_and_public_terminal_install_legs": 6004, + "paid_parked_sender_return_and_adapter_legs": 36726 + } + }, + "partial_clear_control": { + "dirty_unaddressed_last_cell_rejected": true, + "neighbor_unchanged": true + }, + "scalars": { + "coefficient_bits": 13, + "component_padding": 26, + "distinct_scalar_and_conversion_factors": 684, + "rejected_one_tick_denominators": [ + 2, + 3, + 5, + 7 + ], + "retained_max_bits": 24, + "signed_bit_transducer_cases": 4104 + } + }, + "powers": [ + [ + "parent", + "0.00373004177032", + "lower", + { + "lower": "-1496508466540981329594386786348762314112419719428895920648738139559/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "-1496508466540981329594386786348762314112419719428895920648734624417/3618502788666131106986593281521497120414687020801267626233049500247285301248" + } + ], + [ + "parent", + "0.00373004177033", + "higher", + { + "lower": "22576528637372510171943954836057324278158033490699559504377165067791/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "22576528637372510171943954836057324278158033490699559504377171722649/7237005577332262213973186563042994240829374041602535252466099000494570602496" + } + ], + [ + "parent", + "0.00374039009039", + "higher", + { + "lower": "13229811831965427000328743591257049300044622162971635460725558491622036808281/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "13229811831965427000328743591257049300044622162971635460725558491622040243595/3618502788666131106986593281521497120414687020801267626233049500247285301248" + } + ], + [ + "candidate", + "0.00374039009039", + "lower", + { + "lower": "-26053208525573464502058539321570242725047950269508182440027912001885/904625697166532776746648320380374280103671755200316906558262375061821325312", + "upper": "-208425668204587716016468314572561941800383602156065459520223289148107/7237005577332262213973186563042994240829374041602535252466099000494570602496" + } + ], + [ + "candidate", + "0.00374039009046", + "lower", + { + "lower": "-1871217686290178727785499778182903377316733974195001051914050296055/452312848583266388373324160190187140051835877600158453279131187530910662656", + "upper": "-7484870745160714911141999112731613509266935896780004207656199520219/1809251394333065553493296640760748560207343510400633813116524750123642650624" + } + ], + [ + "candidate", + "0.00374039009047", + "lower", + { + "lower": "-2220728260041744648020387964002015902777330738386348136884677732813/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "-1110364130020872324010193982001007951388665369193174068442337068989/1809251394333065553493296640760748560207343510400633813116524750123642650624" + } + ], + [ + "candidate", + "0.00374039009048", + "higher", + { + "lower": "21056569940474835912050381350317462609887671491455495468646402762269/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "21056569940474835912050381350317462609887671491455495468646409735773/7237005577332262213973186563042994240829374041602535252466099000494570602496" + } + ] + ], + "preflight": { + "assurance": { + "contract": "Exact matching user declarations; mathematical applicability is not verified.", + "inconclusive": "Mixed hinge signs do not establish a power-moment crossing or failure.", + "input_binding": "SHA-256 identifies the exact input bytes read, when loaded by this CLI.", + "scope": "Histogram arithmetic only. Histogram correctness, circuit legality, ownership, phases, precision, supplier admission and compiler endpoints are not validated." + }, + "classification": "uniformly_better", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "delta_paid": { + "1": -288, + "2": 48, + "3": -368, + "4": 96, + "5": 80, + "6": 48, + "7": 32 + }, + "delta_targets": {}, + "hinges": [ + { + "rank": 0, + "value": 0 + }, + { + "rank": 1, + "value": -352 + }, + { + "rank": 2, + "value": -416 + }, + { + "rank": 3, + "value": -528 + }, + { + "rank": 4, + "value": -272 + }, + { + "rank": 5, + "value": -112 + }, + { + "rank": 6, + "value": -32 + }, + { + "rank": 7, + "value": 0 + } + ], + "method_credit": "Classical concave order/majorization; mightyOil's t16-moment-order-audit and its retained predecessors. No new theorem claim.", + "power_moment": { + "exponent": "0 < t < 1", + "new_minus_old_sign": "strictly_negative", + "tariff": "r^t" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "rank_mass": { + "delta": { + "paid": 0, + "paid_minus_targets": 0, + "targets": 0 + }, + "new": { + "paid": 271568, + "paid_minus_targets": -1328, + "targets": 272896 + }, + "old": { + "paid": 271568, + "paid_minus_targets": -1328, + "targets": 272896 + } + }, + "schema": "integer-mult-recursive-invoice-comparison/v1", + "signed_net_delta": { + "1": -288, + "2": 48, + "3": -368, + "4": 96, + "5": 80, + "6": 48, + "7": 32 + }, + "tariff_class": "increasing concave f on nonnegative ranks, with f(0)=0", + "uniform_order": "weak; some concave tariffs can give equality" + }, + "probe": "0.00374039009046", + "productive": 21152, + "signed_rank_surplus": 1328, + "stages": [ + [ + 1, + 400, + 1101 + ], + [ + 2, + 400, + 1101 + ], + [ + 3, + 400, + 1101 + ], + [ + 4, + 400, + 1101 + ], + [ + 5, + 400, + 1101 + ], + [ + 6, + 400, + 1101 + ], + [ + 7, + 400, + 1101 + ], + [ + 8, + 400, + 1101 + ], + [ + 9, + 400, + 1101 + ], + [ + 10, + 400, + 1101 + ], + [ + 11, + 400, + 1101 + ], + [ + 12, + 400, + 1101 + ], + [ + 13, + 400, + 1101 + ], + [ + 14, + 400, + 1101 + ], + [ + 15, + 400, + 1101 + ], + [ + 16, + 400, + 1101 + ] + ] +} diff --git a/research/helper-quotient-basis-audit/parent.json.gz b/research/helper-quotient-basis-audit/parent.json.gz new file mode 100644 index 0000000000..0c144e4491 Binary files /dev/null and b/research/helper-quotient-basis-audit/parent.json.gz differ diff --git a/research/helper-quotient-basis-audit/verify.py b/research/helper-quotient-basis-audit/verify.py new file mode 100644 index 0000000000..efd48ea86d --- /dev/null +++ b/research/helper-quotient-basis-audit/verify.py @@ -0,0 +1,359 @@ +"""Check the fixed helper restrictions with exact forward basis vectors.""" +from collections import Counter +from fractions import Fraction +from functools import reduce +from graphlib import TopologicalSorter +from hashlib import sha256 +from math import gcd, lcm +from pathlib import Path +import gzip +import json + +HERE = Path(__file__).resolve().parent +PARENT = "db10e4ca7154b454f86bf404bc34b3a16d02de6cc008d5227e4eef2654cb0778" +CHILD = "16e99893a2c669467ce74f214e8eb5150402f0267aaa8d67aad5d870aa4d5c18" + + +def require(ok, text): + if not ok: + raise ValueError(text) + + +def encoded(value): + return json.dumps(value, sort_keys=True, separators=(",", ":")).encode() + + +def sparse(entries): + row = {k: Fraction(v) for k, v in entries} + require(entries == [[k, str(row[k])] for k in sorted(row)] and all(row.values()), + "noncanonical sparse row") + return row + + +class Graph: + def __init__(self, initial, final, moves, forms, first): + self.initial, self.final = list(initial), list(final) + self.moves, self.forms, self.first = moves, forms, first + + def order(self): + n = len(self.initial) + require(len(self.final) == n, "public dimensions") + require(set(self.forms) == set(self.moves) | set(range(self.first, self.first + n)), + "node inventory") + successors = {k: [] for k in self.forms} + degree = {} + for key in sorted(self.forms): + chart = self.moves[key][0] if key in self.moves else self.final[key - self.first] + degree[key] = 0 + for donor in sorted(self.forms[key]): + require(self.forms[key][donor] != 0, "zero edge") + if donor < 0: + require(0 <= ~donor < n, "input range") + location = self.initial[~donor] + else: + require(donor in self.moves, "missing paid donor") + location = self.moves[donor][1] + degree[key] += 1 + successors[donor].append(key) + require(chart == location, "nonlocal edge") + ready = sorted(k for k, d in degree.items() if d == 0) + result = [] + while ready: + result.extend(ready) + following = [] + for key in ready: + for user in successors[key]: + degree[user] -= 1 + if degree[user] == 0: + following.append(user) + ready = following + require(len(result) == len(self.forms), "dependency cycle") + return result + + def transpose(self): + def opposite(k): + if k < 0: + return self.first + ~k + return ~(k - self.first) if k >= self.first else k + forms = {k: {} for k in self.forms} + for row, donors in self.forms.items(): + for donor, value in donors.items(): + forms[opposite(donor)][opposite(row)] = value + return Graph(self.final, self.initial, {k: (b, a) for k, (a, b) in self.moves.items()}, + forms, self.first) + + +def vector_sum(terms): + """Keep one integer denominator per vector; no float enters the calculation.""" + terms = list(terms) + denominator = lcm(*(d * q.denominator for q, (d, row) in terms)) + result = {} + for q, (d, row) in terms: + factor = q.numerator * (denominator // (d * q.denominator)) + for i, v in row.items(): + result[i] = result.get(i, 0) + factor * v + result = {i: v for i, v in result.items() if v} + common = reduce(gcd, result.values(), denominator) + return denominator // common, {i: v // common for i, v in result.items()} + + +def basis(graph, wanted): + order = graph.order() + closure, pending = set(), list(wanted) + while pending: + key = pending.pop() + if key < 0 or key in closure: + continue + require(key in graph.forms, "basis target") + closure.add(key) + pending.extend(graph.forms[key]) + values = {~i: (1, {i: 1}) for i in range(len(graph.initial))} + products = 0 + for key in order: + if key in closure: + terms = [(q, values[d]) for d, q in graph.forms[key].items()] + products += sum(len(v[1]) for q, v in terms) + values[key] = vector_sum(terms) + return {k: values[k] for k in wanted}, products, len(closure) + + +def replace(forms, pivot, relation): + require(relation.get(pivot), "zero pivot") + replacement = {k: -v / relation[pivot] for k, v in relation.items() if k != pivot} + result = {} + for key, row in forms.items(): + if key == pivot: + continue + new = {k: v for k, v in row.items() if k != pivot} + if pivot in row: + for donor, weight in replacement.items(): + new[donor] = new.get(donor, 0) + row[pivot] * weight + result[key] = {k: v for k, v in new.items() if v} + return result + + +def rank(frames, a, b): + return abs(len(frames[a]) - len(frames[b])) + + +def reject(function, label): + try: + function() + except ValueError: + return label + raise ValueError("control accepted: " + label) + + +def debit(saved, lost): + require(lost > 0 and len(saved) >= 2 and all(d > 0 for d in saved) and sum(saved) == lost, + "complete rank debit") + + +def validate_edit(graph, edit, mains, retired): + r = edit["role"] + require(0 <= r < len(graph.initial) and r not in mains | retired, "helper pivot") + require(graph.initial[r] != graph.final[r], "zero target") + entrance = {~k: v for k, v in sparse(edit["entrance"]).items()} + require(entrance.get(~r), "missing entrance pivot") + require(all(0 <= ~k < len(graph.initial) and ~k not in retired and + graph.initial[~k] == graph.initial[r] for k in entrance), "entrance chart") + banks = [] + for bank in edit["banks"]: + pivot, chart = bank["remove"], bank["chart"] + relation = sparse(bank["relation"]) + require(pivot in graph.moves and graph.moves[pivot][1] == chart and relation.get(pivot), + "receiver pivot") + for k in relation: + require((k < 0 and 0 <= ~k < len(graph.initial)) or k in graph.moves, + "receiver donor") + location = graph.initial[~k] if k < 0 else graph.moves[k][1] + require(location == chart, "receiver chart") + banks.append((pivot, chart, relation)) + require(len(banks) >= 2 and len({c for k, c, r in banks}) == len(banks), "receiver charts") + return entrance, banks + + +def layouts(graph, frames): + # The source hash uses this standard-library order. Basis evaluation uses Graph.order. + canonical_order = list(TopologicalSorter({k: sorted(d for d in graph.forms[k] if d >= 0) + for k in sorted(graph.forms)}).static_order()) + return dict(initial=graph.initial, final=graph.final, first_output=graph.first, + frames=frames, moves=[[k, *graph.moves[k]] for k in sorted(graph.moves)], + forms=[[k, [[d, str(q)] for d, q in sorted(graph.forms[k].items())]] + for k in sorted(graph.forms)], schedule=canonical_order) + + +def histogram(graph, frames, mains): + spans = [] + for frame in frames: + span = {0} + for v in frame: + require(0 < v < 512 and v not in span, "frame basis") + span |= {v ^ w for w in span} + spans.append(span) + paid, targets = Counter(), Counter() + for a, b in graph.moves.values(): + require(spans[a] < spans[b] or spans[b] < spans[a], "nested transfer") + paid[rank(frames, a, b)] += 1 + for r, (a, b) in enumerate(zip(graph.initial, graph.final)): + if r not in mains: + require(spans[a] < spans[b], "positive helper") + targets[rank(frames, a, b)] += 1 + return paid, targets + + +def run(): + for pin in json.loads((HERE / "SOURCE-PINS.json").read_text())["files"]: + require(sha256((HERE / pin["path"]).read_bytes()).hexdigest() == pin["sha256"], + "input identity: " + pin["path"]) + raw = gzip.decompress((HERE / "parent.json.gz").read_bytes()) + require(sha256(raw).hexdigest() == PARENT, "parent graph identity") + source = json.loads(raw) + interface = json.loads((HERE / "interface.json").read_text()) + edits = json.loads((HERE / "QUOTIENTS.json").read_text()) + frames = source["frames"] + net = Graph(source["initial"], source["final"], {k: (a, b) for k, a, b in source["moves"]}, + {k: sparse(row) for k, row in source["forms"]}, source["first_output"]) + net.order() + positions = {k: i for i, k in enumerate(source["schedule"])} + require(len(positions) == len(source["schedule"]) == len(net.forms) and + positions.keys() == net.forms.keys() and + all(d < 0 or positions[d] < positions[k] for k, row in net.forms.items() for d in row), + "source schedule") + mains = set(interface["main_roles"]) + require(len(mains) == 400 and interface["public"] == len(net.initial) == 1501, "main interface") + require(mains == set(interface["live"]) | {x + 112 for x in interface["live"]} | + set(interface["hosted"]["X2"]) | set(interface["hosted"]["Y2"]), "main labels") + before_hist = histogram(net, frames, mains) + outputs = list(range(net.first, net.first + len(net.initial))) + endpoint, parent_products, _ = basis(net, outputs) + for r in range(len(net.initial)): + row = endpoint[net.first + r] + require(row[1].keys() <= mains if r in mains else row == (1, {r: 1}), "parent endpoint split") + records, controls, retired = [], [], set() + relation_products = 0 + paid_debit, target_debit = Counter(), Counter() + for step, edit in enumerate(edits, 1): + direction = edit["direction"] + require(direction in ("forward", "transpose"), "direction") + work = net.transpose() if direction == "transpose" else net + entrance, banks = validate_edit(work, edit, mains, retired) + wanted = {k for pivot, chart, row in banks for k in row} + values, products, nodes = basis(work, wanted) + relation_products += products + target = vector_sum((q, (1, {~k: 1})) for k, q in entrance.items()) + for pivot, chart, row in banks: + actual = vector_sum((q, values[k]) for k, q in row.items()) + require(actual == target, f"receiver relation at step {step}, key {pivot}") + donor = next(k for k in row if values[k][1]) + altered = dict(row) + altered[donor] += 1 + require(vector_sum((q, values[k]) for k, q in altered.items()) != target, + "altered receiver coefficient accepted") + controls.append([step, pivot, "receiver coefficient +1 rejected", donor]) + altered_entrance = dict(entrance) + altered_entrance[~edit["role"]] += 1 + require(vector_sum((q, (1, {~k: 1})) for k, q in altered_entrance.items()) != target, + "altered entrance coefficient accepted") + if step == 13: + controls.append(reject(lambda: validate_edit(net, edit, mains, retired), + "role 559 in forward orientation rejected")) + saved = [rank(frames, *work.moves[pivot]) for pivot, chart, row in banks] + lost = rank(frames, work.initial[edit["role"]], work.final[edit["role"]]) + debit(saved, lost) + reject(lambda: debit(saved, 0), "omitted productive debit") + paid_debit.update(saved) + target_debit[lost] += 1 + forms = replace(work.forms, ~edit["role"], entrance) + moves = dict(work.moves) + for pivot, chart, row in banks: + forms = replace(forms, pivot, row) + del moves[pivot] + final = list(work.final) + final[edit["role"]] = work.initial[edit["role"]] + forms[work.first + edit["role"]] = {~edit["role"]: Fraction(1)} + work = Graph(work.initial, final, moves, forms, work.first) + work.order() + net = work.transpose() if direction == "transpose" else work + net.order() + retired.add(edit["role"]) + records.append(dict(step=step, role=edit["role"], direction=direction, saved=saved, + lost=lost, entrance_terms=len(entrance), ancestor_nodes=nodes, + coefficient_products=products)) + keep = [r for r in range(len(net.initial)) if r not in retired] + remap = {r: i for i, r in enumerate(keep)} + require(mains <= remap.keys() and all(remap[x + 112] == remap[x] + 112 for x in interface["live"]), + "main compact interface") + for r in retired: + require(net.initial[r] == net.final[r] and net.forms[net.first + r] == {~r: 1}, + "retired identity") + forms = {} + for k, row in net.forms.items(): + if k >= net.first and k - net.first in retired: + continue + require(all(d >= 0 or ~d in remap for d in row), "retired entrance reader") + key = net.first + remap[k - net.first] if k >= net.first else k + forms[key] = {d if d >= 0 else ~remap[~d]: q for d, q in row.items()} + net = Graph([net.initial[r] for r in keep], [net.final[r] for r in keep], + net.moves, forms, net.first) + digest = sha256(encoded(layouts(net, frames))).hexdigest() + require(digest == CHILD, "compact graph identity") + desired = {net.first + remap[r]: (d, {remap[i]: v for i, v in row.items()}) + for r in keep for d, row in [endpoint[net.first + r]]} + actual, forward_products, _ = basis(net, desired) + require(actual == desired, "compact forward endpoint") + transposed = {net.first + i: {} for i in range(len(keep))} + for k, (d, row) in desired.items(): + for i, v in row.items(): + transposed[net.first + i][k - net.first] = Fraction(v, d) + desired_reverse = {k: vector_sum((q, (1, {i: 1})) for i, q in row.items()) + for k, row in transposed.items()} + actual_reverse, reverse_products, _ = basis(net.transpose(), desired_reverse) + require(actual_reverse == desired_reverse, "compact transpose endpoint") + after_hist = histogram(net, frames, {remap[r] for r in mains}) + require(before_hist[0] == after_hist[0] + paid_debit and + before_hist[1] == after_hist[1] + target_debit, "aggregate rank debits") + for label, histogram_value in (("paid", paid_debit), ("targets", target_debit)): + require(sum(k * v for k, v in histogram_value.items()) == 200, label + " rank mass") + invoices = [] + fixed = None + for name, hist in (("parent-application.json", before_hist), ("application.json", after_hist)): + published = json.loads((HERE / name).read_text()) + caller = published["caller"] + require(caller["calls"] == 16, "caller multiplicity") + now = [caller["fixed_caller_paid"], caller["fixed_root_targets"]] + require(fixed is None or fixed == now, "fixed caller changed") + fixed = now + invoice = {} + for label, native, base in zip(("paid", "targets"), hist, fixed): + total = Counter({int(k): v for k, v in base.items()}) + total.update({k: 16 * v for k, v in native.items()}) + require({str(k): v for k, v in total.items()} == published["invoice"][label], + "published invoice " + label) + invoice[label] = dict(jobs=sum(total.values()), mass=sum(k*v for k,v in total.items())) + invoices.append(invoice) + return dict(status="PASS_HELPER_QUOTIENT_BASIS_AUDIT", parent_sha256=PARENT, + compact_sha256=digest, steps=records, relations=sum(len(r["saved"]) for r in records), + directions=dict(Counter(r["direction"] for r in records)), + public=[1501, len(keep)], main=len(mains), helpers=[1101, len(keep) - len(mains)], + paid=[sum(before_hist[0].values()), sum(after_hist[0].values())], + native_histograms={"parent":before_hist, "candidate":after_hist}, + full_invoices=invoices, + native_debits={"paid":paid_debit, "targets":target_debit}, + sixteen_call_debits={"paid":{k:16*v for k,v in paid_debit.items()}, + "targets":{k:16*v for k,v in target_debit.items()}, + "paid_rank_mass":3200, "target_rank_mass":3200}, + basis_coefficient_products={"parent":parent_products, "relations":relation_products, + "candidate_forward":forward_products, "candidate_transpose":reverse_products}, + controls=controls, altered_entrance_controls=len(records), omitted_debit_controls=len(records), + retained_labels_sha256=sha256(encoded(keep)).hexdigest()) + + +if __name__ == "__main__": + result = json.loads(json.dumps(run())) + expected = HERE / "RESULT.json" + if expected.exists(): + require(result == json.loads(expected.read_text()), "receipt mismatch") + print(result["status"], result["relations"], len(result["steps"]), result["public"][1]) + else: + print(json.dumps(result, indent=2, sort_keys=True))