diff --git a/research/quotient-split-minimal-odd-scale/.gitattributes b/research/quotient-split-minimal-odd-scale/.gitattributes new file mode 100644 index 0000000000..c88f1a697c --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/.gitattributes @@ -0,0 +1 @@ +credits/** -text whitespace=cr-at-eol diff --git a/research/quotient-split-minimal-odd-scale/CREDITS.md b/research/quotient-split-minimal-odd-scale/CREDITS.md new file mode 100644 index 0000000000..43bf8228ac --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/CREDITS.md @@ -0,0 +1,43 @@ +# Credit and retained sources + +Ali Romman prepared this physical scale substitution with substantial +OpenAI Codex assistance in research, implementation, verification and +writing. New work is Apache-2.0. This is author checking with reused +engines, not blind, independent human or formal-kernel review. + +The source is [PR #7717](https://github.com/CrocSwap/integer-mult-bounds/pull/7717), +head `586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8`. +Its [complete application](https://github.com/aliromman/integer-mult-bounds/blob/586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8/research/quotient-split-physical-application/PROOF.md) +and [receipt](https://github.com/aliromman/integer-mult-bounds/blob/586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8/research/quotient-split-physical-application/results/application.json) +supply the fixed graph, interface, original scale and full bill. +The interface reader, physical and signed caller engines are retained +without changes. Their source notices are copied byte for byte. + +Gareth Davidson / bitplane supplied the coefficient-grid criterion and +basis-witness method in [PR #866](https://github.com/CrocSwap/integer-mult-bounds/pull/866), +[pinned precision proof](https://github.com/bitplane/integer-mult-bounds/blob/5ae580bf68516f1cbe3b2dd3cb646be55170288f/research/dyadic-fractional-grid/README.md). +Ali Romman's [PR #7680](https://github.com/CrocSwap/integer-mult-bounds/pull/7680), +[pinned grid proof](https://github.com/aliromman/integer-mult-bounds/blob/533cdca9225d1c0af1ae8d3b79cb527f59afaf0f/research/banked-native-minimum-grid/PROOF.md) +and [checker](https://github.com/aliromman/integer-mult-bounds/blob/533cdca9225d1c0af1ae8d3b79cb527f59afaf0f/research/banked-native-minimum-grid/verify.py) +supply the integer-gcd and separate Fraction audit structure adapted here. +The criterion and normalized minimum are prior work. + +The [common-root proof](https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/research/odd-native-common-grid/PROOF.md) +and [notice](https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/research/odd-native-common-grid/NOTICE.md) +supply the per-call odd clearing and nested precision argument. Preserve +icekylinx's odd-clearing credit, the fixed-root work of Ross Richardson, +zxv and Jacob Alan Sussman, and the credited source authors. The note was +prepared for CubeJerry with OpenAI assistance; it is not human acceptance. + +DreamingOfClouds supplied the literal split witnesses with Claude Opus 5.5 +assistance. Clear1nsight supplied the banked physical realization and split +method. Ali Romman supplied the restrictions and composition. SYLforge +supplied the word and signed caller. Rohan Arun, Jerry Chen / CubeJerry, +Douglas Colkitt, mightyOil and the retained contributors supplied the +framework and predecessor methods. The shared-wire notice retains the +operator-engine lineage and unpaidmoon's phase-convention credit. + +SOURCE-PINS.json records exact source commits, paths, Git blobs and hashes. +All copies are under source/ or credits/ except the root license. The one +external interpreter is pinned to current main in SOURCES.json. No pending +source history is required for replay, and no source checker is patched. diff --git a/research/quotient-split-minimal-odd-scale/LICENSE b/research/quotient-split-minimal-odd-scale/LICENSE new file mode 100644 index 0000000000..261eeb9e9f --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/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/quotient-split-minimal-odd-scale/PROOF.md b/research/quotient-split-minimal-odd-scale/PROOF.md new file mode 100644 index 0000000000..ffc4762ace --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/PROOF.md @@ -0,0 +1,159 @@ +# Physical substitution of the minimal odd scale + +For the fixed graph in [PR #7717](https://github.com/CrocSwap/integer-mult-bounds/pull/7717), +replace native odd scale 2083725 with 11025 in each invocation. Keep +binary height 20, caller scale 2025, all paid/productive jobs, storage and +root formats unchanged. Under the same five framework interfaces, this +preserves the complete conditional application and lowers its conservative +scalar-service rate from `2^29` to `2^22`. It does not improve kappa. + +The graph hash is +`5183479ecac34a1cb5c046f202e19d7161679265fe121b4a0af922fe344d8fc1`. +Its 1470 arbitrary public owners, 1070 helpers and 6054 paid routes are +unchanged. The minimum normalized product grid 90316800 was already +reported by the source. The new result is its physical odd-scale +substitution, sharp physical necessity and complete finite cost consequence. +The minimum-grid criterion and per-call clearing method are prior work; +[CREDITS.md](CREDITS.md) gives their sources. + +## Coefficient lattice and physical charts + +Let `R=Z[i,1/2]`, the ring of Gaussian numbers with binary denominators. +At a literal scalar-product site, let c_j be the normalized rational +coefficient of independent public owner j, including that product's +scalar factor. Let A be the current chart and B_j the entrance chart. +Under the retained native interface, the physical block on owner j is +`c_j A B_j^(-1)`. All these ordered chart maps and inverses have entries +in R on the same complete root factor, including spectators and absolute +phase. No active-coordinate projection occurs. + +For a positive odd scale S, the product is in R for every independent +R-valued physical input exactly when every `S*c_j` is in R. For sufficiency, +each matrix block has entries in R. Thus each product and each partial +sum does too. Induction follows the actual operation order. For necessity, +independence isolates one owner block. If all its entries are in R, +multiplication by its inverse chart gives `S*c_j I` with entries in R. +Thus the odd part of the denominator of each reduced c_j must divide S. +The least common multiple of those odd parts is the exact minimum S. + +This is an odd-divisibility criterion. A finite binary guard must still +bound powers of two, and a magnitude bound must still prevent overflow. +The criterion is valid for arbitrary R-valued inputs, including correlated +values at a particular call; independence is needed for the universal +minimum over the native contract. It does not assert that a restricted +correlated consumer cannot use a smaller scale. + +The hypotheses are material. Multiplication by three is not invertible +over R and can conceal coefficient 1/3. Correlated inputs x=y can cancel +`x/3-y/3`. The unitary global phase `(3+4i)/5` introduces an odd denominator +although its modulus is one. The checker verifies these counterexamples. +They show why nonunit charts, input restrictions and arbitrary global +phases are outside the theorem. They are not reported as failures of the +selected Gaussian-dyadic contract. + +## Exact certificate and sharp physical witnesses + +A separate coefficient pass begins at the source's sufficient integer +grid. It computes every literal product in the published donor order. +If the resulting integer coefficient values are v_i and the starting +grid is Q, their exact denominator lcm is `Q/gcd(Q,v_1,v_2,...)`. +This is the credited grid criterion. It gives 90316800, with odd part +`11025=3^2*5^2*7^2` and binary height 13. All 9966426 products are covered. +We retain height 20 instead of using 13 in the physical substitution. + +Three rational column replays check sharp coefficients without the +integer-grid evaluator. All named entrance charts are the empty chart, +so a literal physical unit basis vector at address zero is an admissible +input. Put all other public inputs at zero. The exact chart interpreter +then gives the following actual pre-product component under scale S/p. + +| Omitted prime p | Input owner | Product node / donor | Normalized coefficient | Physical chart amplitude | Under-scaled physical value | +| --- | ---: | --- | --- | --- | --- | +| 3 | 1277 | 100783 / 93721 | 1927/576 | -1/8 at chart 118 | -2360575/1536 | +| 5 | 1207 | 98406 / 91748 | -1/25 | -1/4 at chart 324 | 441/20 | +| 7 | 278 | 97179 / 88440 | -20/147 | 1/2 at chart 595 | -750/7 | + +Each value retains its omitted odd prime in the denominator. No number +of extra binary fractional bits can represent it. At scale 11025 the +same components are dyadic. Thus every admissible odd S is divisible by +11025. These witnesses use the fixed graph; they do not alter the paid +meeting at chart 118 or take any related construction search. + +The integer single-column controls stop at their first inexact product. +For p=3, the numerator 38675660800 divided by three has remainder one. +For p=5, -462422016 divided by five has remainder four. For p=7, +-1572864000 divided by seven has remainder six. The receipt binds each +failure to its owner, donor and actual grid. + +## Per-call substitution and nested precision + +The implemented grid is `11025*2^20=11560550400`. A full replay checks all +1470 endpoints, every separate product and all addressed installations. +The independent helper returns are identities, and the source main map +is retained. Its completed endpoints are dyadic before scaling, so +unscaling by 11025 is exact. The caller retains its separate 2025 scale +and binary height nine; all 4192 events and 16 native occurrences match +the source receipt. + +Use the existing [common-root induction](https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/research/odd-native-common-grid/PROOF.md). +Each native invocation scales its own actual entrance, runs its exact +word and unscales its completed endpoint. An unfinished invocation adds +its exterior scalar debt. A completed endpoint removes only the extra +debt relative to its entrance; it does not reset inherited debt or the +physical root grid. The finite ideal recursion is defined before its +exact simulation. No exact rounded-child oracle is assumed. + +The new odd scale is 189 times smaller. Its dyadic allowance is unchanged. +Consequently every positive path-mass and binary-height bound used in the +source application still dominates the new implementation, at each +unfinished context. Keep the source's conservative 338 binary bits, +588 mass bits and context constant 1176. Keep its signed width +`W=p+h+2D+3`, fractional grid `2^(-p-D)` and temporary width `W+26`. +The retained `H=14708600000000000000` still gives depth-guard argument +bit length 14083. The checker repeats that guard. All caller, native +spectator and compiler schedules stay unchanged. + +This argument binds the smaller scale to the existing root proof. +It does not discharge the entire precision_tape assumption, prescribe +new external preprocessing, admit arbitrary early rounding, or change +the exact native and compiler interfaces. + +## Complete finite cost consequence + +The physical engine checks the new scale on the same owned-bank schedule. +There are 8999 numerical homes per native call, with the same dummy, +guide and four separately guarded streams. Every input snapshot survives +until final installation. Full retirement and guard restoration pass. +A live-sender overwrite and partial payload clear are rejected. +The four-address fixture checks storage operations; the inherited laws +supply arbitrary-width whole-extent behavior. + +All ordinary counts and layout formulas are compared exactly with the +source receipt. They are unchanged. The complete 16-call caller retains 124816384 scalar +services and 54112 odd conversions. Each native invocation retains +1526938 resets and 414942 selected transfer legs. +There are still 100416 paid jobs and 20656 productive jobs. + +The 796 distinct scalar/conversion factors now need at most 14 bits. +All 4776 signed bit-service cases pass. Under the retained service formula +`2^max(20,bits+8)`, the conservative rate falls from `2^29` to `2^22`. +Only that rate changes in the complete ordinary bill. Full-view movement, +guide setup/retirement, scalar conversions, held stock and padding remain +charged. This reduces one upper-bound coefficient by a factor of 128. +It is not a measured runtime, memory, total-cost or cutoff reduction. + +The source's complete signed invoice and conditional kappa are unchanged. +No price or compiler search is repeated. The source phase catalogue, +all-column lift, owned erasure, compiler, fixed-tape law and analytic +recovery retain their stated evidence and limitations. No selected +frontier change, independent human acceptance, formal-kernel proof or +materialized all-size rounded multiplier is claimed. + +## Verification boundary + +Normal and optimized replay use unchanged source engines plus the new +coefficient/physical witness checks. The normalized minimum is not +counted again as a result. The source constructor is not imported. +Retained bytes and the graph hash bind the exact interface. Full native +catalogue and predecessor suites, selected cold replay, Lean and Docker +were not run. See RESULT.json for exact positive and failure evidence. diff --git a/research/quotient-split-minimal-odd-scale/README.md b/research/quotient-split-minimal-odd-scale/README.md new file mode 100644 index 0000000000..c9c1d868d0 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/README.md @@ -0,0 +1,44 @@ +# Minimal odd scale for the composed physical supplier + +The fixed graph from [PR #7717](https://github.com/CrocSwap/integer-mult-bounds/pull/7717) +can use odd scale 11025 in each native call. The source uses 2083725. +Keep the binary coefficient allowance at 20 and all root formats unchanged. +The [proof](PROOF.md) connects the exact coefficient lattice to the physical +Gaussian-dyadic charts and inherited nested-call precision argument. +The [receipt](RESULT.json) contains the sharp physical witnesses and full cost comparison. + +The conservative scalar-service rate falls from `2^29` to `2^22` steps per +padded cell. All 124816384 scalar services, storage, resets, copies, guides, +phases and recursive jobs are retained. This is a factor of 128 in one +charged upper-bound coefficient, not a measured runtime improvement. +There is no new kappa, smaller selected format or discharge of all five assumptions. + +Use CPython 3.12 and the standard library from the repository root: + +```sh +python3.12 -B scripts/research_package.py --package research/quotient-split-minimal-odd-scale +``` + +Both registered commands print: + +```text +PASS_MINIMAL_ODD_PHYSICAL_SUBSTITUTION 11025 128 +``` + +The [source pins](SOURCE-PINS.json) authenticate unchanged supplier copies. +The exact operator interpreter is the single declared repository input. +The [credit](CREDITS.md) separates the existing minimum-grid criterion, +common-root method and graph from this physical substitution. +The source's complete phase catalogue and compiler are inherited; they +are not rerun here. Selected cold replay, Lean and Docker were not run. +This is author checking with reused engines, not independent human or +formal-kernel review. + +## Open next questions + +Can an independently proved physical scalar implementation improve the +retained rate formula further? Start from its literal tape service and +full-view costs. A smaller abstract coefficient alone does not prove a +faster machine. New arithmetic lowering, a different native graph or a +smaller selected root format needs a new source-bound proof. No follow-up +is reserved here. diff --git a/research/quotient-split-minimal-odd-scale/RESULT.json b/research/quotient-split-minimal-odd-scale/RESULT.json new file mode 100644 index 0000000000..824d23936d --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/RESULT.json @@ -0,0 +1,374 @@ +{ + "status": "PASS_MINIMAL_ODD_PHYSICAL_SUBSTITUTION", + "graph_sha256": "5183479ecac34a1cb5c046f202e19d7161679265fe121b4a0af922fe344d8fc1", + "source_pins": 37, + "coefficient_certificate": { + "odd": 11025, + "binary_height": 13, + "products": 9966426, + "witnesses": { + "3": { + "node": 100783, + "donor": 93721, + "input": 1277, + "factor": "94/3", + "coefficient": "1927/576", + "odd_denominator": 9, + "chart": 118, + "first_under_scaled_fault": { + "node": 100783, + "donor": 93721, + "input": 1277, + "grid": 3853516800, + "numerator": 38675660800, + "divisor": 3, + "remainder": 1 + } + }, + "7": { + "node": 97179, + "donor": 88440, + "input": 278, + "factor": "1/7", + "coefficient": "-20/147", + "odd_denominator": 147, + "chart": 595, + "first_under_scaled_fault": { + "node": 97179, + "donor": 88440, + "input": 278, + "grid": 1651507200, + "numerator": -1572864000, + "divisor": 7, + "remainder": 6 + } + }, + "5": { + "node": 98406, + "donor": 91748, + "input": 1207, + "factor": "-1/5", + "coefficient": "-1/25", + "odd_denominator": 25, + "chart": 324, + "first_under_scaled_fault": { + "node": 98406, + "donor": 91748, + "input": 1207, + "grid": 2312110080, + "numerator": -462422016, + "divisor": 5, + "remainder": 4 + } + } + } + }, + "physical_columns": [ + { + "prime": 3, + "input_role": 1277, + "input_chart": 3, + "input_basis": 0, + "input_dyadic_bits": 0, + "input_column_sha256": "51b6179bb719fc51a7954e35324ee751aaa59170d596a9055ddf0ec61f1691dc", + "product_chart": 118, + "address": 0, + "component": "real", + "chart_amplitude": "-1/8", + "normalized_product": "1927/576", + "scaled_product": "-2360575/512", + "under_scaled_product": "-2360575/1536" + }, + { + "prime": 7, + "input_role": 278, + "input_chart": 3, + "input_basis": 0, + "input_dyadic_bits": 0, + "input_column_sha256": "51b6179bb719fc51a7954e35324ee751aaa59170d596a9055ddf0ec61f1691dc", + "product_chart": 595, + "address": 0, + "component": "real", + "chart_amplitude": "1/2", + "normalized_product": "-20/147", + "scaled_product": "-750", + "under_scaled_product": "-750/7" + }, + { + "prime": 5, + "input_role": 1207, + "input_chart": 3, + "input_basis": 0, + "input_dyadic_bits": 0, + "input_column_sha256": "51b6179bb719fc51a7954e35324ee751aaa59170d596a9055ddf0ec61f1691dc", + "product_chart": 324, + "address": 0, + "component": "real", + "chart_amplitude": "-1/4", + "normalized_product": "-1/25", + "scaled_product": "441/4", + "under_scaled_product": "441/20" + } + ], + "implementation_odd": 11025, + "implementation_binary_height": 20, + "implementation_grid": 11560550400, + "exact": { + "coefficient_products": 9966426, + "checked_nontrivial_divisions": 5312755, + "checked_nontrivial_divisions_by_denominator": { + "3": 71276, + "4": 1775911, + "12": 4443, + "2": 2530408, + "8": 439428, + "21": 15307, + "256": 22, + "16": 144485, + "32": 45118, + "64": 20651, + "128": 732, + "10": 6742, + "5": 50696, + "20": 15512, + "7": 102347, + "96": 172, + "48": 439, + "24": 6804, + "384": 6, + "6": 25853, + "192": 58, + "14": 29488, + "9": 17, + "40": 660, + "28": 14857, + "56": 6793, + "63": 394, + "42": 1203, + "112": 2124, + "224": 809 + }, + "exact_all_public_rows": 1470, + "minimum_product_grid": 90316800, + "minimum_snapshot_grid": 322560, + "maximum_exact_row_prefix_mass_scaled": "2461146614325/256", + "missing_odd_factor_controls": { + "3": { + "row": 88440, + "donor": -1325, + "entrance_column": 1324, + "coefficient": "2/3", + "removed_factor": 9, + "numerator_without_factor": 2569011200, + "denominator": 3, + "positive_remainder": 2 + }, + "5": { + "row": 88808, + "donor": -1301, + "entrance_column": 1300, + "coefficient": "1/10", + "removed_factor": 25, + "numerator_without_factor": 462422016, + "denominator": 10, + "positive_remainder": 6 + } + } + }, + "addressed": { + "numerical_homes": 8999, + "guarded_dummy_slots": 1, + "separate_guide_tracks": 1, + "max_outstanding_native_senders": 1, + "declared_senders": 1, + "immutable_entry_banks": 1470, + "immutable_paid_return_banks": 6054, + "deferred_terminal_banks": 1470, + "native_scalar_scratch_homes": 4, + "additional_independent_guarded_streams": 4, + "trace_sha256": "7c0449f16fe3dfcfd78b14f3e7a58c43ea119241d522acc4f9b7e3cfc164b38e", + "selected_logical_operations": { + "initialize_complete_dirty_home": 8999, + "write_entrance": 1470, + "read_immutable_donor": 178845, + "initialize_empty_sender_before_departure": 6054, + "stage_full_sender": 6054, + "read_parked_sender": 6054, + "write_complete_return": 6054, + "clear_full_sender_after_return": 6054, + "write_terminal": 1470, + "read_terminal_for_same_owner_install": 1470, + "retire_complete_home": 8999 + }, + "fixture_addressed_cells_per_home": 4, + "fixture_addressed_cells_overwritten": { + "initialize_complete_dirty_home": 35996, + "initialize_empty_sender_before_departure": 24216, + "clear_full_sender_after_return": 24216, + "retire_complete_home": 35996 + }, + "tracked_stream_reset_visits": 544059, + "same_owner_complete_fixture_outputs": 1470, + "exact_odd_unscale_outputs": 1470, + "retired_and_guards_restored": true, + "live_sender_alias_control_rejected": true, + "all_public_inputs_preserved_until_final_installs": true + }, + "scalars": { + "distinct_scalar_and_conversion_factors": 796, + "signed_bit_transducer_cases": 4776, + "coefficient_bits": 14, + "rejected_one_tick_denominators": [ + 2, + 3, + 5, + 7 + ], + "retained_max_bits": 24, + "component_padding": 26 + }, + "ordinary": { + "native_numeric_homes": 8999, + "native_numeric_homes_plus_dummy": 9000, + "raw_numeric_homes": 143984, + "raw_numeric_homes_plus_dummy": 144000, + "separate_guarded_guide_tracks_per_native": 1, + "separate_guarded_guide_tracks_raw": 16, + "separate_guarded_streams_per_native": 4, + "separate_guarded_streams_raw": 64, + "odd_conversions": 54112, + "reset_services_per_native": 1526938, + "typed_selected_transfers_per_native": 414942, + "reset_services_by_kind_per_native": { + "dirty_home_initializations_and_retirements": 17998, + "term_and_row_stream_initializations_and_retirements": 1490952, + "owner_scale_unscale_stream_initializations_and_retirements": 5880, + "sender_reinitializations_and_retirements": 12108 + }, + "typed_transfer_legs_by_kind_per_native": { + "complete_scalar_donor_staging_legs": 357690, + "complete_sender_and_terminal_staging_legs": 15048, + "paid_parked_sender_return_and_adapter_legs": 36324, + "immutable_entrance_and_public_terminal_install_legs": 5880 + }, + "reset_services_all_native_stages": 24431008, + "typed_selected_transfer_legs_all_native_stages": 6639072, + "selector_steps_per_selected_service_L_and_constant": [ + 125995, + 567325 + ], + "additional_full_overwrite_steps_per_reset_L_and_constant": [ + 2, + 3 + ], + "selected_total_steps_per_native_L_and_constant": [ + 244723337052, + 1101814433254 + ], + "selected_total_steps_raw_L_and_constant": [ + 3915573392832, + 17629030932064 + ], + "scalar_services": 124816384, + "scalar_step_rate": 4194304, + "raw_scalar_incidence_allowance_before_factor_32": { + "literal_native_products_and_accumulations": 2861520, + "width_padded_native_row_lifecycles": 481536, + "public_boundary_installations_and_scale_preparations": 47040, + "private_home_flags_and_cleanup": 143984, + "serial_sender_initialization_and_retirement": 193728, + "weighted_signed_caller_operation_slots": 118592, + "complete_array_odd_conversions": 54112 + }, + "ordinary_map_slots": 276672, + "ordinary_elementary_record_upper": 26246212608, + "raw_paid_positions": 100416, + "raw_productive_targets": 20656, + "root_negative_q_translations": 3536, + "native_paid_wrappers": 96864, + "native_productive_wrappers": 17120, + "ordinary_main_pair_slots": 6400, + "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": { + "padded_payload": "L'=N_c(2(W+26)+3)", + "per_stage_selector_and_stream_tracks": 11, + "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", + "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]", + "shadow_cells_upper": "M+352", + "complete_view_step_bound": "34*(256(M+352)+128) plus fixed-degree descriptor work" + } + }, + "conservative_source_path_bounds": { + "public": 1470, + "slots": 6054, + "terms": 178845, + "path_grid": 2184944025600, + "path_grid_odd": 2083725, + "path_grid_height": 20, + "positive_path_mass_bound_unscaled": "164863744927/4608", + "positive_path_mass_peak_node": 156119, + "paid_native_ranks": { + "1": 3934, + "2": 847, + "4": 223, + "3": 564, + "5": 369, + "6": 96, + "9": 4, + "7": 10, + "8": 7 + }, + "positive_helper_ranks": { + "9": 609, + "2": 21, + "4": 226, + "8": 33, + "7": 16, + "3": 47, + "1": 19, + "6": 25, + "5": 74 + } + }, + "retained_root_envelope": { + "caller_odd": 2025, + "native_odd": { + "candidate": 2083725 + }, + "native_binary": { + "candidate": 20 + }, + "context_mass_bound": "47587657515536117050088106519258994580293747171033193792670305801720492655022147042355197832891493877471654969938199350475235561468207852602392400007694405834999596668034956636079496165240937/76441190400000", + "context_mass_bits": 588, + "context_binary_bits": 338, + "context_c": 1176, + "H_guard": "bit_length(context_c*1920*153**1920*(H+1)**2) < H for each actual compiler bound H", + "exact_grid": "2^(-p-D)", + "signed_width": "W=p+h+2D+3", + "temporary_width": "W+26" + }, + "retained_compiler_H": "14708600000000000000", + "retained_depth_guard": { + "compiler_H": 14708600000000000000, + "argument_bit_length": 14083, + "strict_guard_passed": true + }, + "conditional_interfaces": [ + "native_all_columns", + "owned_erasure", + "compiler", + "precision_tape", + "analytic_recovery" + ], + "scalar_rate_reduction": 128, + "contract_controls": { + "nonunit_chart_counterexample_checked": true, + "correlated_input_counterexample_checked": true, + "unrestricted_global_phase_counterexample_checked": true + }, + "partial_clear_control": { + "dirty_unaddressed_last_cell_rejected": true, + "neighbor_unchanged": true + } +} diff --git a/research/quotient-split-minimal-odd-scale/SOURCE-PINS.json b/research/quotient-split-minimal-odd-scale/SOURCE-PINS.json new file mode 100644 index 0000000000..ddede03dc3 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/SOURCE-PINS.json @@ -0,0 +1,261 @@ +[ + { + "path": "credits/PR7715-CREDITS.md", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/PR7715-CREDITS.md", + "git_blob": "d70c7ea76def36b2a20c550b1dd22078b83bc13e", + "sha256": "1616276c6b9555b34571c103e7defad418672a0fe08de52b1a108c4ba672359a" + }, + { + "path": "credits/SHARED-WIRE-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/SHARED-WIRE-NOTICE", + "git_blob": "a3687d65a00794277cdaad37558d24008cbc37f5", + "sha256": "da12736e2e824167ff56f2ecb623a5f88f75a270410360890f61dffc33bab249" + }, + { + "path": "credits/PR7716-CREDITS.md", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/PR7716-CREDITS.md", + "git_blob": "baa9d2f16c76c21437a61916a06f4be4d38ad54a", + "sha256": "dad56f9bca6dd9b902cf77dfbae0da49bbc091e63857313f5e6add52021085b2" + }, + { + "path": "credits/quotients/PR7682-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/PR7682-NOTICE", + "git_blob": "4654631de087fe5034d30abc17e9d57582e5ed9c", + "sha256": "7590f71de481c424d2315e9ea4884bea1557481676fa5f930f7a0bed637a56a1" + }, + { + "path": "credits/quotients/7700-CITATION.cff", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/7700-CITATION.cff", + "git_blob": "d80f6b8660d6caaa82cb194fc22d0817d642d043", + "sha256": "50399ea15e9ce49baafbd00d6da16e662ac46c566e3c04af3993e23cf0b62ff4" + }, + { + "path": "credits/quotients/PR7663-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/PR7663-NOTICE", + "git_blob": "6ce1bc49a3612c9e906df02de81bcba84be8e803", + "sha256": "5fd4367578d2339fbdcd7dc116b6c12cb4fa72e92d2e3d67be537a36c8bd9d40" + }, + { + "path": "credits/quotients/PR7708-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/PR7708-NOTICE", + "git_blob": "4a24e9bcb74d349b7f245f2b43edb6faba716429", + "sha256": "c3762acca6fa198c621e0aacf8aa06526aa7716c20c761141c07393fdba6bc46" + }, + { + "path": "credits/quotients/PR7704-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/PR7704-NOTICE", + "git_blob": "7d2dfec60a3a8c30bbc639104905d5ce1c0926e4", + "sha256": "49657dd50c9431642a9527b0d625197cb34d1838dcf00fe4d92040f9605c8ce0" + }, + { + "path": "credits/quotients/7658-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/7658-NOTICE", + "git_blob": "2baa2a719ea3a9ec94c2e7aec72702ec8c92b346", + "sha256": "2732575164931c53cc4bc57145c31d87741489e3048afee6899e856c0ea503b5" + }, + { + "path": "credits/quotients/PR7713-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/PR7713-NOTICE", + "git_blob": "8fa17b3fd69ddd3be7caeaaff72848e0ac8d517a", + "sha256": "8852b94801cd022eb5d42dc57b7592ab22f87b441566a1ce62c8697733c82da6" + }, + { + "path": "credits/quotients/PR7674-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/PR7674-NOTICE", + "git_blob": "951f081717e0769f3bcc0f442f133965c064d2ce", + "sha256": "382537634a3d9fa0a8089d6121a506a399382f9310088b1f29586dcc93eec92d" + }, + { + "path": "credits/quotients/PR7705-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/PR7705-NOTICE", + "git_blob": "2a92a9df69de4335966a1b12f79355244a7710f4", + "sha256": "43510816b93ea09e0d716ccc6261c84ce081821c0d5dea7d6e748863d55f8f40" + }, + { + "path": "credits/quotients/7700-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/7700-NOTICE", + "git_blob": "59d8e0cf3102e15bd11db430838365531e2d7f18", + "sha256": "b49022cb4104d90b182e4c335f670faf45529025b15db77bf0291835083c28bd" + }, + { + "path": "credits/quotients/PR7669-PROVENANCE.md", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/PR7669-PROVENANCE.md", + "git_blob": "bbee2437f012c3268eb5cd920adfa37394c1de72", + "sha256": "706c6c852e87e371ddf1828244b2f0c2b00279728818023aa911c8947d69ab83" + }, + { + "path": "credits/quotients/OUTER-GATE-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/quotients/OUTER-GATE-NOTICE", + "git_blob": "1bc9b4da2b8398954cd7a49356eb9d397785d0a6", + "sha256": "cadbc642ca84311d2c7a6cf704c7828cb4cf77e3c784b66e4c6e8a5c28002fb8" + }, + { + "path": "credits/splits/PR7682-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/PR7682-NOTICE", + "git_blob": "4654631de087fe5034d30abc17e9d57582e5ed9c", + "sha256": "7590f71de481c424d2315e9ea4884bea1557481676fa5f930f7a0bed637a56a1" + }, + { + "path": "credits/splits/7700-CITATION.cff", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/7700-CITATION.cff", + "git_blob": "d80f6b8660d6caaa82cb194fc22d0817d642d043", + "sha256": "50399ea15e9ce49baafbd00d6da16e662ac46c566e3c04af3993e23cf0b62ff4" + }, + { + "path": "credits/splits/PR7663-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/PR7663-NOTICE", + "git_blob": "6ce1bc49a3612c9e906df02de81bcba84be8e803", + "sha256": "5fd4367578d2339fbdcd7dc116b6c12cb4fa72e92d2e3d67be537a36c8bd9d40" + }, + { + "path": "credits/splits/PR7708-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/PR7708-NOTICE", + "git_blob": "4a24e9bcb74d349b7f245f2b43edb6faba716429", + "sha256": "c3762acca6fa198c621e0aacf8aa06526aa7716c20c761141c07393fdba6bc46" + }, + { + "path": "credits/splits/PR7704-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/PR7704-NOTICE", + "git_blob": "7d2dfec60a3a8c30bbc639104905d5ce1c0926e4", + "sha256": "49657dd50c9431642a9527b0d625197cb34d1838dcf00fe4d92040f9605c8ce0" + }, + { + "path": "credits/splits/7658-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/7658-NOTICE", + "git_blob": "2baa2a719ea3a9ec94c2e7aec72702ec8c92b346", + "sha256": "2732575164931c53cc4bc57145c31d87741489e3048afee6899e856c0ea503b5" + }, + { + "path": "credits/splits/NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/NOTICE", + "git_blob": "6d6192b9a066b94d91f37dba1b53624f6f451bfe", + "sha256": "5645b5cc9fc560c3e5057e8e15ec1bc4e678a5724a968c13df2ac04526dbbc64" + }, + { + "path": "credits/splits/PR7674-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/PR7674-NOTICE", + "git_blob": "951f081717e0769f3bcc0f442f133965c064d2ce", + "sha256": "382537634a3d9fa0a8089d6121a506a399382f9310088b1f29586dcc93eec92d" + }, + { + "path": "credits/splits/PR7705-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/PR7705-NOTICE", + "git_blob": "2a92a9df69de4335966a1b12f79355244a7710f4", + "sha256": "43510816b93ea09e0d716ccc6261c84ce081821c0d5dea7d6e748863d55f8f40" + }, + { + "path": "credits/splits/7700-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/7700-NOTICE", + "git_blob": "59d8e0cf3102e15bd11db430838365531e2d7f18", + "sha256": "b49022cb4104d90b182e4c335f670faf45529025b15db77bf0291835083c28bd" + }, + { + "path": "credits/splits/PR7669-PROVENANCE.md", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/PR7669-PROVENANCE.md", + "git_blob": "bbee2437f012c3268eb5cd920adfa37394c1de72", + "sha256": "706c6c852e87e371ddf1828244b2f0c2b00279728818023aa911c8947d69ab83" + }, + { + "path": "credits/splits/OUTER-GATE-NOTICE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/credits/splits/OUTER-GATE-NOTICE", + "git_blob": "1bc9b4da2b8398954cd7a49356eb9d397785d0a6", + "sha256": "cadbc642ca84311d2c7a6cf704c7828cb4cf77e3c784b66e4c6e8a5c28002fb8" + }, + { + "path": "LICENSE", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/LICENSE", + "git_blob": "261eeb9e9f8b2b4b0d119366dda99c6fd7d35c64", + "sha256": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4" + }, + { + "path": "credits/PR7717-CREDITS.md", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/CREDITS.md", + "git_blob": "538263114c08217081d3f05bd2383c50a7ae74b8", + "sha256": "515a2d475a2580bbe1c213d10526ce5eef7eaa9a11924e5d72e30221676f7aa4" + }, + { + "path": "source/common.py", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/common.py", + "git_blob": "2d809bdd3cdd5c4c5abb04cb73e143696fd2ae24", + "sha256": "89f521a1490ae7c5649f9cec77a46d8a5156a5a61018e7f78d40c1d2c0714716" + }, + { + "path": "source/vendor/physical.py", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/vendor/physical.py", + "git_blob": "e7c4e5798bd37df287f431069ab0cffe73dbe3a3", + "sha256": "24c9cf906596c9ef1533c1d25f61403db3ff6389478f64359d9d12c5fef87b69" + }, + { + "path": "source/vendor/caller16.py", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/vendor/caller16.py", + "git_blob": "2865530b7878dec54286a67e82b83093911ec43c", + "sha256": "ced48867f07ca0143604aa98cfd74fa7453696b9d3221f7c230d73e9ab9ba81f" + }, + { + "path": "source/data/GRAPH.json.gz", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/data/GRAPH.json.gz", + "git_blob": "69b3f74cd04b9ce605832da556f69815583bca87", + "sha256": "991c8217b21091c2dc3d947aaa4eee5a6cc553ad062c7a6baf4a89db58c83216" + }, + { + "path": "source/data/LAYOUT.json", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/data/LAYOUT.json", + "git_blob": "93b78213d2024e4ddb634ff528960104c6a537a6", + "sha256": "94c51425c9515c58faa8605f546a6d6638b293f71556406410a104e5a0cb1e9f" + }, + { + "path": "source/data/CALLER.json.gz", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/data/CALLER.json.gz", + "git_blob": "26a75a1ae32cb4944a65281cfb08775967cb39a0", + "sha256": "d889996a337f648087208ab51c98eaf052705d4fca88b5d01b6e9257a829897a" + }, + { + "path": "source/results/application.json", + "source_commit": "586f4f81a8bd09a65a8e6d0bfff57a0fec8925e8", + "source_path": "research/quotient-split-physical-application/results/application.json", + "git_blob": "197c3a8a09ac99492bc88288aa662db4b95a49d6", + "sha256": "ed547c404492ee7672f17bbe793f049bc0484cf55170c776ee3a69ee4e3914c5" + }, + { + "path": "credits/COMMON-GRID-NOTICE.md", + "source_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "source_path": "research/odd-native-common-grid/NOTICE.md", + "git_blob": "51fa9d494c79e6c5a113bc09f2852bfacece6b52", + "sha256": "3a3d353a0fb41ce5688c8ae2bcc82306f4499ffc19f0c44eeaa85679f895a5d3" + } +] diff --git a/research/quotient-split-minimal-odd-scale/SOURCES.json b/research/quotient-split-minimal-odd-scale/SOURCES.json new file mode 100644 index 0000000000..9419ca6a1e --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/SOURCES.json @@ -0,0 +1,24 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + }, + { + "path": "research/shared-wire-split-composition/frozen/native_verify.py", + "usage": "input", + "git_blob": "2c209dfa9cfade3bc20ac5fc9d876b433a147f8c", + "sha256": "3049471905b47b385c88378a1a3be7a18b8858aadd035b8a6da2f4a03b470f38" + } + ] +} diff --git a/research/quotient-split-minimal-odd-scale/TASK.json b/research/quotient-split-minimal-odd-scale/TASK.json new file mode 100644 index 0000000000..a8be97e13f --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/TASK.json @@ -0,0 +1,83 @@ +{ + "schema_version": 1, + "task_id": "uniform-transfer-audit", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "uniform-transfer-audit", + "question": "Can one of the selected record's five inherited assumptions be proved at its actual caller?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "Identify the proposition and what would change downstream; do not equate a finite replay with a universal proof.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Choose one assumption ID (native_all_columns, owned_erasure, compiler, precision_tape, analytic_recovery), one quantified implication and exact dependency closure. Check current handoffs, including #5625 row reentry and #5707 root-prefix lowering, without treating their partial scope as the whole theorem. Prove or falsify that implication with a caller-bound argument; stop at the chosen obligation. Finite tests or root digits do not discharge an all-size statement.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "native_all_columns", + "owned_erasure", + "compiler", + "precision_tape", + "analytic_recovery" + ], + "existing_checks": [ + { + "scope": "PR #4100: proposed unconditional construction and finite checks, without independent acceptance.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Independent proof audit of one caller-bound all-size implication; all other premises remain explicit.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "refined", + "actual_scope": "Prove and check the minimal odd-scale physical substitution for the fixed PR7717 graph under its Gaussian-dyadic and nested-call precision contract.", + "scope_change_reason": "The existing minimum product grid was known; this resolves its actual per-call physical use and fully charged finite scalar cost.", + "bottleneck_link": "The conservative 21-bit conversion drives a 2^29 scalar rate. A proved 14-bit substitution reduces that finite rate while preserving all recursive jobs and root formats.", + "budget_minutes": 60, + "stop_rule": "Finish one all-input scale implication and its complete finite cost consequence, or exhibit the failed boundary; no graph or kappa search.", + "outcome": "completed", + "evidence": "PROOF.md; RESULT.json; verify.py; SOURCE-PINS.json", + "author": "Ali Romman", + "ai_assistance": "Substantial OpenAI Codex assistance in research, implementation, verification and writing.", + "open_questions": [ + { + "question": "Can the literal physical scalar service improve its retained rate formula?", + "why_it_matters": "The smaller scale reduces one conservative coefficient, not measured runtime.", + "first_step": "Prove a full-view tape-service bound for the exact factors and owned layouts.", + "blocked_by": "No new tape-service implementation or total cutoff calculation is supplied here." + } + ] +} diff --git a/research/quotient-split-minimal-odd-scale/VERIFY.json b/research/quotient-split-minimal-odd-scale/VERIFY.json new file mode 100644 index 0000000000..e9a48948e0 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/VERIFY.json @@ -0,0 +1,36 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [ + "research/shared-wire-split-composition/frozen/native_verify.py" + ], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Check exact odd-grid certificate, independent rational and physical sharpness witnesses, all scalar products/endpoints, unchanged signed caller and owned storage, full ordinary cost equality except the smaller scalar rate, and inherited depth guard." + }, + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "-O", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Check exact odd-grid certificate, independent rational and physical sharpness witnesses, all scalar products/endpoints, unchanged signed caller and owned storage, full ordinary cost equality except the smaller scalar rate, and inherited depth guard." + } + ] +} diff --git a/research/quotient-split-minimal-odd-scale/credits/COMMON-GRID-NOTICE.md b/research/quotient-split-minimal-odd-scale/credits/COMMON-GRID-NOTICE.md new file mode 100644 index 0000000000..51fa9d494c --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/COMMON-GRID-NOTICE.md @@ -0,0 +1,20 @@ +# Credit and retained source notice + +Prepared for @CubeJerry with substantial OpenAI assistance. Apache-2.0. + +The five files under `source/` are unchanged snapshots from DreamingOfClouds' +`research/p104-shared-odd-native` at +`4e13b7acdbea1c9f12aa88126435360eecea7401`. Their original LICENSE and NOTICE +are retained alongside them. The original word, caller, scale1125 certificate, +strictification parameters and candidate bound are their contributors' work. + +The proof explicitly credits #104's odd clearing and #6901's fixed-root +precision theorem, with the #4586/#5443/#6878 compiler and occurrence lineage. +Credit icekylinx, Ross Richardson, zxv, Jacob Alan Sussman and all authors +identified by those predecessor packages. No predecessor method, endpoint +identity or independent human acceptance is claimed as a new result here. + +The rational audit and fixed-grid/transfer-matrix audit were authored by +different same-session AI research agents. That separation supplies an +independent method and review; it does not imply external authorship or +formal proof verification. diff --git a/research/quotient-split-minimal-odd-scale/credits/PR7715-CREDITS.md b/research/quotient-split-minimal-odd-scale/credits/PR7715-CREDITS.md new file mode 100644 index 0000000000..d70c7ea76d --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/PR7715-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/quotient-split-minimal-odd-scale/credits/PR7716-CREDITS.md b/research/quotient-split-minimal-odd-scale/credits/PR7716-CREDITS.md new file mode 100644 index 0000000000..baa9d2f16c --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/PR7716-CREDITS.md @@ -0,0 +1,58 @@ +# Attribution and exact source pins + +Ali Romman prepared the fixed-graph composition, its constructive +checker and scoped evidence with substantial OpenAI Codex assistance. +New work is Apache-2.0. Source proofs and code were read; this is +author checking, not blind, human or formal-kernel review. + +DreamingOfClouds supplied the two literal readouts and injections in +[PR #7712](https://github.com/CrocSwap/integer-mult-bounds/pull/7712), +head `5001d95a5c1decfb2b0d64d13c130300797e722a`. +The [causal split proof](https://github.com/DreamingOfClouds/integer-mult-bounds/blob/5001d95a5c1decfb2b0d64d13c130300797e722a/research/p104-banked-cf6a-splits/PROOF.md), +[literal circuit](https://github.com/DreamingOfClouds/integer-mult-bounds/blob/5001d95a5c1decfb2b0d64d13c130300797e722a/research/p104-banked-cf6a-splits/data/CIRCUIT.json.gz) +and [source notice](https://github.com/DreamingOfClouds/integer-mult-bounds/blob/5001d95a5c1decfb2b0d64d13c130300797e722a/research/p104-banked-cf6a-splits/NOTICE) +identify the original construction and Claude Opus 5.5 assistance. +That source's charts, witnesses and split identity are prior work. +The new result transports the two surviving witnesses to the changed +quotient graph and verifies their joint compatibility. The third +source split is excluded; its known collision is not claimed as new. + +Ali Romman's separate workstream supplied all 33 restrictions in +[PR #7713](https://github.com/CrocSwap/integer-mult-bounds/pull/7713), +scientific commit `06b75fde21f4231a2bd0725542c3ba60a908d83b`, published +head `52e7eb424b9ae9f2e6002eb17e475bce6195d848`. +Its [constructor](https://github.com/aliromman/integer-mult-bounds/blob/06b75fde21f4231a2bd0725542c3ba60a908d83b/research/p104-helper-quotients/quotient.py) +exports the frozen compact input. Its +[application receipt](https://github.com/aliromman/integer-mult-bounds/blob/06b75fde21f4231a2bd0725542c3ba60a908d83b/research/p104-helper-quotients/results/application.json) +supplies the unchanged fixed caller and root rows. +The [compatibility handoff](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19711980) +asks for a separate construction before the source gains can combine. + +Ali Romman's [PR #7715](https://github.com/CrocSwap/integer-mult-bounds/pull/7715), +head `4517ad2a3e9f06ca369a2625f652de4f57be2fb9`, supplies the +[exact basis engine](https://github.com/aliromman/integer-mult-bounds/blob/4517ad2a3e9f06ca369a2625f652de4f57be2fb9/research/helper-quotient-basis-audit/verify.py), +copied unchanged as basis_engine.py. That package checked the compact +endpoint and complete restriction debits. Its result is not repeated +as a new contribution here. The earlier unsplit positive-control graph +is from [PR #7708](https://github.com/CrocSwap/integer-mult-bounds/pull/7708), +scientific commit `f0e2db5b5b46b139da17d2b32fab6633164443a9`. + +The retained notices credit Clear1nsight for the causal split method +in [PR #7697](https://github.com/CrocSwap/integer-mult-bounds/pull/7697), +role-1256 relay in [PR #7704](https://github.com/CrocSwap/integer-mult-bounds/pull/7704), +and role-230 reroute; SYLforge for the word and signed caller in +[PR #7700](https://github.com/CrocSwap/integer-mult-bounds/pull/7700); +Ali Romman for the banked circuit and recodings; Rohan Arun, Jerry +Chen / CubeJerry, Douglas Colkitt and repository contributors for +predecessor constructions and the selected framework; and mightyOil +for concave comparison. The source notices under credits/splits and +credits/quotients, and the PR #7715 credit, retain their exact bytes. + +[SOURCE-PINS.json](SOURCE-PINS.json) records all retained bytes and +original Git blobs where applicable. The parent and compact graphs +are explicit source-constructor exports. No source constructor or +source split checker is imported by the replay. Copies are committed +in this package, so no unmerged predecessor history is needed. +[SOURCES.json](SOURCES.json) pins the base catalogue and selected +record as provenance; it does not claim that pending source commits +are ancestors of this branch. diff --git a/research/quotient-split-minimal-odd-scale/credits/PR7717-CREDITS.md b/research/quotient-split-minimal-odd-scale/credits/PR7717-CREDITS.md new file mode 100644 index 0000000000..538263114c --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/PR7717-CREDITS.md @@ -0,0 +1,50 @@ +# Credit and source custody + +Ali Romman prepared this application with substantial OpenAI Codex +assistance in research, implementation, verification and writing. +New work is Apache-2.0. This is author checking with source engines. +It is not blind, independent human or formal-kernel review. + +The fixed normalized composition is prior work in +[PR #7716](https://github.com/CrocSwap/integer-mult-bounds/pull/7716), +head `1636b3c9b922d23b222b60dd52e005e60c592491`. +Its [construction proof](https://github.com/aliromman/integer-mult-bounds/blob/1636b3c9b922d23b222b60dd52e005e60c592491/research/quotient-causal-split-composition/PROOF.md) +and [constructor](https://github.com/aliromman/integer-mult-bounds/blob/1636b3c9b922d23b222b60dd52e005e60c592491/research/quotient-causal-split-composition/verify.py) +supply the graph. Its source credit is retained in credits/PR7716-CREDITS.md. + +Ali Romman's [PR #7713](https://github.com/CrocSwap/integer-mult-bounds/pull/7713), +scientific commit `06b75fde21f4231a2bd0725542c3ba60a908d83b`, supplies the +[application](https://github.com/aliromman/integer-mult-bounds/blob/06b75fde21f4231a2bd0725542c3ba60a908d83b/research/p104-helper-quotients/application.py), +[catalogue check](https://github.com/aliromman/integer-mult-bounds/blob/06b75fde21f4231a2bd0725542c3ba60a908d83b/research/p104-helper-quotients/catalogue.py) +and unchanged vendor files. The new wrappers adapt those checks to the +1470-field graph, its two fresh helper owners, new grid and complete bill. +The [source notice](https://github.com/aliromman/integer-mult-bounds/blob/06b75fde21f4231a2bd0725542c3ba60a908d83b/research/p104-helper-quotients/NOTICE) +identifies the authors and retained lineage. + +Clear1nsight supplied the banked execution and relay in +[PR #7704](https://github.com/CrocSwap/integer-mult-bounds/pull/7704), +commit `e29a5ae8591243c1178067727f12ce4abefa0b93`. +The [physical argument](https://github.com/CrocSwap/integer-mult-bounds/blob/e29a5ae8591243c1178067727f12ce4abefa0b93/research/cf6a-banked-role1256-relay/PHYSICAL.md) +and [physical engine](https://github.com/CrocSwap/integer-mult-bounds/blob/e29a5ae8591243c1178067727f12ce4abefa0b93/research/cf6a-banked-role1256-relay/physical.py) +are material dependencies. The engine is copied unchanged through PR #7713. +The original hard-coded 1501-field reader is not called. common.py checks +the actual 1470-field namespace before it calls the generic engine functions. +No frozen source check is patched or disabled. + +DreamingOfClouds supplied the literal split witnesses in +[PR #7712](https://github.com/CrocSwap/integer-mult-bounds/pull/7712), +head `5001d95a5c1decfb2b0d64d13c130300797e722a`, with Claude Opus 5.5 assistance. +Clear1nsight supplied the causal split method. SYLforge supplied the word +and caller in [PR #7700](https://github.com/CrocSwap/integer-mult-bounds/pull/7700). +Rohan Arun supplied the caller lineage. Jerry Chen / CubeJerry supplied the +selected complex and BIT application. Douglas Colkitt and the credited +contributors supplied the framework, compiler and exact comparison tools. +Retain mightyOil's concave comparison credit. + +The base [shared-wire notice](https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/research/shared-wire-split-composition/NOTICE) +credits DreamingOfClouds, Ali Romman and Jerry Chen / CubeJerry for the +retained operator engines and their extensions. It also credits unpaidmoon +for the phase convention and icekylinx for the odd-grid precedent. +All copied notices retain their source bytes. SOURCE-PINS.json gives their +Git blobs and SHA-256 values. SOURCES.json pins the four base inputs and +the selected record; it does not claim that pending dependencies are ancestors. diff --git a/research/quotient-split-minimal-odd-scale/credits/SHARED-WIRE-NOTICE b/research/quotient-split-minimal-odd-scale/credits/SHARED-WIRE-NOTICE new file mode 100644 index 0000000000..a3687d65a0 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/SHARED-WIRE-NOTICE @@ -0,0 +1,9 @@ +New shared-wire composition, seventeenth wire, and two enabling splits: developed with substantial OpenAI assistance, 2026. Apache-2.0. + +Frozen predecessor native words and odd verifier: DreamingOfClouds, with Claude Opus 5.5 (Anthropic), from #6936 and #6937. + +Retained Clifford compiler and exact native interpreter retain their original headers and lineage from #6833: native source by DreamingOfClouds; independent-helper mechanism by Ali Romman; inventory, retiming and helper-retirement extensions by Jerry Chen / @CubeJerry with OpenAI assistance. + +Helper-split lemma: Ali Romman (#5599). Shared native applications: CubeJerry (#6916). Caller blocks: CubeJerry (#6912). Owned-rise argument: CubeJerry (#6914). Width-2 phase convention: unpaidmoon (#6930). Odd-grid precedent: icekylinx (#104). + +The higher-level caller and BIT integration require their own source attribution and pins. diff --git a/research/quotient-split-minimal-odd-scale/credits/quotients/7658-NOTICE b/research/quotient-split-minimal-odd-scale/credits/quotients/7658-NOTICE new file mode 100644 index 0000000000..2baa2a719e --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/7658-NOTICE @@ -0,0 +1,21 @@ +Apache-2.0. DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. + +The base word (data/base-7641-word.json.gz, unmodified bytes, sha256 de43ed04f58133eaef8f8d12a9dae1e6e8aa7f9721044200cc839673d86fd7c1) +is the word of our #7641 (20 swap-then-delete composites on SYLforge's #7637), vendored as data only. #7641's own base is SYLforge's +#7637 candidate word, whose notices read: + + "Apache-2.0. Local H5B + E1/E4 combination experiment, prepared with OpenAI assistance. + All earlier contributors and notices in hydrogen-bounded-verification-20261117/NOTICE remain credited. In particular: Ali Romman + (#7605), SYLforge, Clear1nsight, DreamingOfClouds, and all upstream contributors listed there." + +#7637's recorded technique credits: DreamingOfClouds #7630 (E1 rebirth/canceller, E4 existing-co-presence reroute), Clear1nsight +#7631/#7633 (efficient E4 integration, E1 prefix/tail settlement), and SYLforge's H5B literal-frame-restored archive. Its lineage +also carries Clear1nsight's #7626/#7314/#7274, Rohan Arun's #7277 and signed #7113 caller, and the contributors named in the +retained sources. #7641, #7637 and their code are not run by this package; only their words are read as data. + +This package adds five edits found by a large-neighbourhood search (one SWAP-NULL relabel of two helpers with a stay deletion, one main +stop removal, three helper stay deletions with re-placed contacts) and one hub re-settle. The helper-stay deletion with re-charted +contacts (E3) is of the type introduced by Clear1nsight's #7612 and ToikY's #7643. check.py is our own code: its replay, crossing and +column-test sections come from our #7630-on-#7623, swap-composite and #7641 packages; its column tests follow the description of the +affected-pair tests in #7620's README and native runner. The CLEAR certificate check implements the acceptance rule of #7620's +verify_certificates (read, not run). No other author's code was run; their words are read as data. diff --git a/research/quotient-split-minimal-odd-scale/credits/quotients/7700-CITATION.cff b/research/quotient-split-minimal-odd-scale/credits/quotients/7700-CITATION.cff new file mode 100644 index 0000000000..d80f6b8660 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/7700-CITATION.cff @@ -0,0 +1,55 @@ +cff-version: 1.2.0 +message: >- + 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/quotient-split-minimal-odd-scale/credits/quotients/7700-NOTICE b/research/quotient-split-minimal-odd-scale/credits/quotients/7700-NOTICE new file mode 100644 index 0000000000..59d8e0cf31 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/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/quotient-split-minimal-odd-scale/credits/quotients/OUTER-GATE-NOTICE b/research/quotient-split-minimal-odd-scale/credits/quotients/OUTER-GATE-NOTICE new file mode 100644 index 0000000000..1bc9b4da2b --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/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/quotient-split-minimal-odd-scale/credits/quotients/PR7663-NOTICE b/research/quotient-split-minimal-odd-scale/credits/quotients/PR7663-NOTICE new file mode 100644 index 0000000000..6ce1bc49a3 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/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/quotient-split-minimal-odd-scale/credits/quotients/PR7669-PROVENANCE.md b/research/quotient-split-minimal-odd-scale/credits/quotients/PR7669-PROVENANCE.md new file mode 100644 index 0000000000..bbee2437f0 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/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/quotient-split-minimal-odd-scale/credits/quotients/PR7674-NOTICE b/research/quotient-split-minimal-odd-scale/credits/quotients/PR7674-NOTICE new file mode 100644 index 0000000000..951f081717 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/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/quotient-split-minimal-odd-scale/credits/quotients/PR7682-NOTICE b/research/quotient-split-minimal-odd-scale/credits/quotients/PR7682-NOTICE new file mode 100644 index 0000000000..4654631de0 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/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/quotient-split-minimal-odd-scale/credits/quotients/PR7704-NOTICE b/research/quotient-split-minimal-odd-scale/credits/quotients/PR7704-NOTICE new file mode 100644 index 0000000000..7d2dfec60a --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/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/quotient-split-minimal-odd-scale/credits/quotients/PR7705-NOTICE b/research/quotient-split-minimal-odd-scale/credits/quotients/PR7705-NOTICE new file mode 100644 index 0000000000..2a92a9df69 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/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/quotient-split-minimal-odd-scale/credits/quotients/PR7708-NOTICE b/research/quotient-split-minimal-odd-scale/credits/quotients/PR7708-NOTICE new file mode 100644 index 0000000000..4a24e9bcb7 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/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/quotient-split-minimal-odd-scale/credits/quotients/PR7713-NOTICE b/research/quotient-split-minimal-odd-scale/credits/quotients/PR7713-NOTICE new file mode 100644 index 0000000000..8fa17b3fd6 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/quotients/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/quotient-split-minimal-odd-scale/credits/splits/7658-NOTICE b/research/quotient-split-minimal-odd-scale/credits/splits/7658-NOTICE new file mode 100644 index 0000000000..2baa2a719e --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/7658-NOTICE @@ -0,0 +1,21 @@ +Apache-2.0. DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. + +The base word (data/base-7641-word.json.gz, unmodified bytes, sha256 de43ed04f58133eaef8f8d12a9dae1e6e8aa7f9721044200cc839673d86fd7c1) +is the word of our #7641 (20 swap-then-delete composites on SYLforge's #7637), vendored as data only. #7641's own base is SYLforge's +#7637 candidate word, whose notices read: + + "Apache-2.0. Local H5B + E1/E4 combination experiment, prepared with OpenAI assistance. + All earlier contributors and notices in hydrogen-bounded-verification-20261117/NOTICE remain credited. In particular: Ali Romman + (#7605), SYLforge, Clear1nsight, DreamingOfClouds, and all upstream contributors listed there." + +#7637's recorded technique credits: DreamingOfClouds #7630 (E1 rebirth/canceller, E4 existing-co-presence reroute), Clear1nsight +#7631/#7633 (efficient E4 integration, E1 prefix/tail settlement), and SYLforge's H5B literal-frame-restored archive. Its lineage +also carries Clear1nsight's #7626/#7314/#7274, Rohan Arun's #7277 and signed #7113 caller, and the contributors named in the +retained sources. #7641, #7637 and their code are not run by this package; only their words are read as data. + +This package adds five edits found by a large-neighbourhood search (one SWAP-NULL relabel of two helpers with a stay deletion, one main +stop removal, three helper stay deletions with re-placed contacts) and one hub re-settle. The helper-stay deletion with re-charted +contacts (E3) is of the type introduced by Clear1nsight's #7612 and ToikY's #7643. check.py is our own code: its replay, crossing and +column-test sections come from our #7630-on-#7623, swap-composite and #7641 packages; its column tests follow the description of the +affected-pair tests in #7620's README and native runner. The CLEAR certificate check implements the acceptance rule of #7620's +verify_certificates (read, not run). No other author's code was run; their words are read as data. diff --git a/research/quotient-split-minimal-odd-scale/credits/splits/7700-CITATION.cff b/research/quotient-split-minimal-odd-scale/credits/splits/7700-CITATION.cff new file mode 100644 index 0000000000..d80f6b8660 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/7700-CITATION.cff @@ -0,0 +1,55 @@ +cff-version: 1.2.0 +message: >- + 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/quotient-split-minimal-odd-scale/credits/splits/7700-NOTICE b/research/quotient-split-minimal-odd-scale/credits/splits/7700-NOTICE new file mode 100644 index 0000000000..59d8e0cf31 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/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/quotient-split-minimal-odd-scale/credits/splits/NOTICE b/research/quotient-split-minimal-odd-scale/credits/splits/NOTICE new file mode 100644 index 0000000000..6d6192b9a0 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/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 three causal helper splits at charts 498, 480 and 595 on the #7708 circuit, together with their search, exact builder and checks. All code here is newly written, and predecessor packages were read as data only. + +aliromman supplied the relay-cut recodings (PR #7708) and the banked-transfer circuit (PR #7674). Clear1nsight supplied the role-1256 relay (PR #7704), the chart-595 split method (PR #7697) and the role-230 reroute (PR #7682). SYLforge supplied the cf6a nine-swap word (PR #7700) 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 #7700 word and the 16-call caller as published with #7704. `ASSETS.json` binds every package file. diff --git a/research/quotient-split-minimal-odd-scale/credits/splits/OUTER-GATE-NOTICE b/research/quotient-split-minimal-odd-scale/credits/splits/OUTER-GATE-NOTICE new file mode 100644 index 0000000000..1bc9b4da2b --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/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/quotient-split-minimal-odd-scale/credits/splits/PR7663-NOTICE b/research/quotient-split-minimal-odd-scale/credits/splits/PR7663-NOTICE new file mode 100644 index 0000000000..6ce1bc49a3 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/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/quotient-split-minimal-odd-scale/credits/splits/PR7669-PROVENANCE.md b/research/quotient-split-minimal-odd-scale/credits/splits/PR7669-PROVENANCE.md new file mode 100644 index 0000000000..bbee2437f0 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/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/quotient-split-minimal-odd-scale/credits/splits/PR7674-NOTICE b/research/quotient-split-minimal-odd-scale/credits/splits/PR7674-NOTICE new file mode 100644 index 0000000000..951f081717 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/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/quotient-split-minimal-odd-scale/credits/splits/PR7682-NOTICE b/research/quotient-split-minimal-odd-scale/credits/splits/PR7682-NOTICE new file mode 100644 index 0000000000..4654631de0 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/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/quotient-split-minimal-odd-scale/credits/splits/PR7704-NOTICE b/research/quotient-split-minimal-odd-scale/credits/splits/PR7704-NOTICE new file mode 100644 index 0000000000..7d2dfec60a --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/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/quotient-split-minimal-odd-scale/credits/splits/PR7705-NOTICE b/research/quotient-split-minimal-odd-scale/credits/splits/PR7705-NOTICE new file mode 100644 index 0000000000..2a92a9df69 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/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/quotient-split-minimal-odd-scale/credits/splits/PR7708-NOTICE b/research/quotient-split-minimal-odd-scale/credits/splits/PR7708-NOTICE new file mode 100644 index 0000000000..4a24e9bcb7 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/credits/splits/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/quotient-split-minimal-odd-scale/source/common.py b/research/quotient-split-minimal-odd-scale/source/common.py new file mode 100644 index 0000000000..2d809bdd3c --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/source/common.py @@ -0,0 +1,120 @@ +"""Read the fixed composition and bind its compact public interface.""" +from collections import Counter +from hashlib import sha256 +from pathlib import Path +import gzip +import json +import sys + +HERE = Path(__file__).resolve().parent +sys.path.insert(0, str(HERE / "vendor")) +import physical + +GRAPH = "5183479ecac34a1cb5c046f202e19d7161679265fe121b4a0af922fe344d8fc1" + + +def need(ok, message): + if not ok: + raise ValueError(message) + + +def read(name): + raw = (HERE / name).read_bytes() + return json.loads(gzip.decompress(raw) if str(name).endswith(".gz") else raw) + + +def digest(value): + return sha256(physical.encoded(value)).hexdigest() + + +def receipt(name, value): + actual = json.loads(json.dumps(value)) + need(actual == read(f"results/{name}.json"), "receipt mismatch: " + name) + + +def inputs(): + graph, layout = read("data/GRAPH.json.gz"), read("data/LAYOUT.json") + n, first = len(graph["initial"]), graph["first_output"] + need(digest(graph) == GRAPH and n == layout["public"] == len(graph["final"]) == 1470 + and first == 154768, "fixed graph and public namespace") + need(layout["frames"] == graph["frames"] and len(layout["live"]) == len(layout["ports"]) == 104, + "port inventory") + h = layout["hosted"] + hosted, planes = set(h["Dports"]), list(zip(h["X2"], h["Y2"], strict=True)) + need(len(hosted) == len(planes) == 96, "hosted ports") + mains = set(layout["live"]) | {x + 112 for x in layout["live"]} | set(h["X2"]) | set(h["Y2"]) + need(len(mains) == 400 and mains <= set(range(n)), "main labels") + frames, initial, final = graph["frames"], graph["initial"], graph["final"] + for x, q in zip(layout["live"], layout["ports"], strict=True): + y = x + 112 + need(frames[initial[x]] == [q] and frames[initial[y]] == [] + and frames[final[x]] == [1 << j for j in range(9)] and len(frames[final[y]]) == 8 + and all((v & q).bit_count() % 2 == 0 for v in frames[final[y]]), "main frames") + for i, pair in zip(h["Dports"], planes, strict=True): + need(all(graph[boundary][a] == graph[boundary][b] for boundary in ("initial", "final") + for a, b in zip((layout["live"][i], layout["live"][i] + 112), pair, strict=True)), + "hosted frames") + labels = layout["source_labels"] + need(len(labels) == len(set(labels)) == n, "distinct source owners") + for old in (325, 1087): + r = labels.index(old) + need(r not in mains and (initial[r], final[r]) == (3, 237), "protected helper") + for r, a, b in ((126, 3, 498), (278, 3, 595), (1468, 498, 127), (1469, 595, 127)): + need(r not in mains and (initial[r], final[r]) == (a, b), "split owner") + moves = {k: (a, b) for k, a, b in graph["moves"]} + rows = {k: [(d, physical.exact_coefficient(q)) for d, q in row] for k, row in graph["forms"]} + terminals = set(range(first, first + n)) + need(len(moves) == len(graph["moves"]) == 6054 and all(0 <= k < first for k in moves), "paid slots") + need(len(rows) == len(graph["forms"]) == len(moves) + n and set(rows) == set(moves) | terminals + and len(graph["schedule"]) == len(rows) and set(graph["schedule"]) == set(rows), "row inventory") + need(all([d for d, _ in row] == sorted({d for d, _ in row}) for row in rows.values()), "donor order") + return graph, layout, moves, rows, (mains, hosted, planes) + + +def jobs(graph, mains, moves): + frames = graph["frames"] + helpers = [(a, b) for r, (a, b) in enumerate(zip(graph["initial"], graph["final"], strict=True)) + if r not in mains] + pairs = set(moves.values()) | set(helpers) + spans = {i: physical.chart_span(frames[i]) for i in {j for pair in pairs for j in pair}} + need(all(spans[a] < spans[b] for a, b in helpers), "positive helper orientation") + need(all(spans[a] < spans[b] or spans[b] < spans[a] for a, b in pairs), "nested paid routes") + def rank(pair): + a, b = pair + return abs(len(frames[a]) - len(frames[b])) + return Counter(map(rank, moves.values())), Counter(map(rank, helpers)), pairs + + +def owner_stages(layout, mains, caller): + h = layout["hosted"] + second = dict(zip(h["Dports"], zip(h["X2"], h["Y2"], strict=True), strict=True)) + seen, stages = set(), [] + for event in caller["events"]: + if event[0] != "J": + continue + _, stage, group_a, group_b = event + bound = {} + for i, x in enumerate(layout["live"]): + for slot, role in zip((x, x + 112) + second.get(i, ()), + group_a if i in second else group_b[:2], strict=True): + need(slot not in bound, "main owner alias") + bound[slot] = (i, role) + need(bound.keys() == mains and len(set(bound.values())) == 400, "signed main owners") + fresh = {(stage, layout["source_labels"][r]) for r in range(layout["public"]) if r not in mains} + need(len(fresh) == 1070 and fresh.isdisjoint(seen), "distinct stage helper owners") + seen.update(fresh) + stages.append([stage, len(bound), len(fresh)]) + need([s[0] for s in stages] == list(range(1, 17)), "complete stages") + return stages + + +def provenance(): + pins = read("SOURCE-PINS.json") + for pin in pins: + raw = (HERE / pin["path"]).read_bytes() + need(sha256(raw).hexdigest() == pin["sha256"], "source bytes: " + pin["path"]) + for pin in read("SOURCES.json")["files"]: + if pin["usage"] == "input": + need(sha256((HERE.parents[1] / pin["path"]).read_bytes()).hexdigest() == pin["sha256"], + "external input: " + pin["path"]) + return len(pins) diff --git a/research/quotient-split-minimal-odd-scale/source/data/CALLER.json.gz b/research/quotient-split-minimal-odd-scale/source/data/CALLER.json.gz new file mode 100644 index 0000000000..26a75a1ae3 Binary files /dev/null and b/research/quotient-split-minimal-odd-scale/source/data/CALLER.json.gz differ diff --git a/research/quotient-split-minimal-odd-scale/source/data/GRAPH.json.gz b/research/quotient-split-minimal-odd-scale/source/data/GRAPH.json.gz new file mode 100644 index 0000000000..69b3f74cd0 Binary files /dev/null and b/research/quotient-split-minimal-odd-scale/source/data/GRAPH.json.gz differ diff --git a/research/quotient-split-minimal-odd-scale/source/data/LAYOUT.json b/research/quotient-split-minimal-odd-scale/source/data/LAYOUT.json new file mode 100644 index 0000000000..93b78213d2 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/source/data/LAYOUT.json @@ -0,0 +1,9109 @@ +{ + "public": 1470, + "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 + ], + "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": [ + 754, + 755, + 756, + 758, + 759, + 760, + 761, + 762, + 763, + 764, + 765, + 766, + 767, + 769, + 770, + 772, + 774, + 776, + 777, + 778, + 779, + 780, + 781, + 782, + 783, + 785, + 786, + 787, + 789, + 790, + 791, + 795, + 796, + 797, + 798, + 799, + 800, + 801, + 802, + 803, + 804, + 805, + 806, + 807, + 808, + 809, + 810, + 811, + 813, + 814, + 815, + 816, + 817, + 818, + 819, + 820, + 821, + 822, + 823, + 824, + 825, + 826, + 828, + 829, + 830, + 831, + 832, + 833, + 834, + 835, + 836, + 837, + 838, + 839, + 840, + 841, + 842, + 843, + 845, + 846, + 847, + 848, + 849, + 850, + 851, + 852, + 853, + 854, + 855, + 856, + 857, + 858, + 859, + 860, + 861, + 862 + ], + "Y2": [ + 863, + 864, + 865, + 867, + 868, + 869, + 870, + 871, + 872, + 873, + 874, + 875, + 876, + 878, + 879, + 880, + 881, + 883, + 884, + 885, + 886, + 887, + 888, + 889, + 890, + 891, + 892, + 893, + 895, + 896, + 897, + 899, + 900, + 901, + 902, + 903, + 904, + 906, + 907, + 908, + 909, + 911, + 912, + 913, + 914, + 915, + 916, + 917, + 919, + 920, + 921, + 922, + 923, + 924, + 925, + 926, + 927, + 928, + 929, + 930, + 931, + 932, + 934, + 935, + 936, + 937, + 938, + 939, + 940, + 941, + 942, + 943, + 944, + 945, + 946, + 947, + 948, + 949, + 951, + 952, + 953, + 954, + 955, + 956, + 957, + 958, + 959, + 960, + 961, + 962, + 963, + 964, + 965, + 966, + 967, + 968 + ], + "alpha": "-1", + "alpha2": "-1", + "beta": "1/2", + "beta2": "0", + "mode": "mix-t0" + }, + "frames": [ + [ + 11 + ], + [ + 19 + ], + [ + 35 + ], + [], + [ + 131 + ], + [ + 259 + ], + [ + 13 + ], + [ + 21 + ], + [ + 37 + ], + [ + 69 + ], + [ + 133 + ], + [ + 261 + ], + [ + 41 + ], + [ + 73 + ], + [ + 265 + ], + [ + 49 + ], + [ + 81 + ], + [ + 145 + ], + [ + 273 + ], + [ + 161 + ], + [ + 193 + ], + [ + 321 + ], + [ + 385 + ], + [ + 14 + ], + [ + 22 + ], + [ + 38 + ], + [ + 70 + ], + [ + 134 + ], + [ + 262 + ], + [ + 26 + ], + [ + 74 + ], + [ + 138 + ], + [ + 50 + ], + [ + 146 + ], + [ + 274 + ], + [ + 98 + ], + [ + 290 + ], + [ + 194 + ], + [ + 322 + ], + [ + 386 + ], + [ + 28 + ], + [ + 44 + ], + [ + 140 + ], + [ + 268 + ], + [ + 84 + ], + [ + 148 + ], + [ + 276 + ], + [ + 100 + ], + [ + 164 + ], + [ + 292 + ], + [ + 196 + ], + [ + 324 + ], + [ + 388 + ], + [ + 56 + ], + [ + 88 + ], + [ + 152 + ], + [ + 280 + ], + [ + 168 + ], + [ + 296 + ], + [ + 200 + ], + [ + 328 + ], + [ + 392 + ], + [ + 112 + ], + [ + 176 + ], + [ + 304 + ], + [ + 208 + ], + [ + 336 + ], + [ + 400 + ], + [ + 224 + ], + [ + 352 + ], + [ + 416 + ], + [ + 508 + ], + [ + 506 + ], + [ + 502 + ], + [ + 494 + ], + [ + 478 + ], + [ + 446 + ], + [ + 382 + ], + [ + 254 + ], + [ + 505 + ], + [ + 501 + ], + [ + 493 + ], + [ + 477 + ], + [ + 445 + ], + [ + 381 + ], + [ + 253 + ], + [ + 499 + ], + [ + 475 + ], + [ + 443 + ], + [ + 379 + ], + [ + 251 + ], + [ + 487 + ], + [ + 471 + ], + [ + 439 + ], + [ + 375 + ], + [ + 247 + ], + [ + 463 + ], + [ + 431 + ], + [ + 367 + ], + [ + 239 + ], + [ + 415 + ], + [ + 351 + ], + [ + 223 + ], + [ + 319 + ], + [ + 191 + ], + [ + 51 + ], + [ + 30 + ], + [ + 120 + ], + [ + 75 + ], + [ + 85 + ], + [ + 102 + ], + [ + 459 + ], + [ + 45 + ], + [ + 30, + 45, + 192, + 320 + ], + [ + 2, + 5, + 40, + 80, + 409 + ], + [ + 7, + 42, + 75, + 144, + 272 + ], + [ + 25, + 42, + 75, + 132, + 260 + ], + [ + 8, + 17, + 34, + 68, + 391 + ], + [ + 30, + 42, + 76, + 129, + 257 + ], + [ + 10, + 20, + 65, + 423 + ], + [ + 7, + 25, + 75, + 160, + 288 + ], + [ + 6, + 24, + 96, + 427 + ], + [ + 51, + 85, + 136, + 264 + ], + [ + 3, + 48, + 72, + 413 + ], + [ + 9, + 36, + 66, + 407 + ], + [ + 45, + 85, + 130, + 258 + ], + [ + 12, + 18, + 33, + 455 + ], + [ + 1, + 2, + 4, + 8, + 16, + 32, + 64, + 128, + 256 + ], + [ + 3, + 4, + 9, + 16, + 32, + 64, + 128, + 256 + ], + [ + 3, + 4, + 8, + 17, + 32, + 64, + 128, + 256 + ], + [ + 3, + 4, + 8, + 16, + 33, + 64, + 128, + 256 + ], + [ + 3, + 4, + 8, + 16, + 32, + 64, + 129, + 256 + ], + [ + 3, + 4, + 8, + 16, + 32, + 64, + 128, + 257 + ], + [ + 2, + 5, + 9, + 16, + 32, + 64, + 128, + 256 + ], + [ + 2, + 5, + 8, + 17, + 32, + 64, + 128, + 256 + ], + [ + 2, + 5, + 8, + 16, + 33, + 64, + 128, + 256 + ], + [ + 2, + 5, + 8, + 16, + 32, + 65, + 128, + 256 + ], + [ + 2, + 5, + 8, + 16, + 32, + 64, + 129, + 256 + ], + [ + 2, + 5, + 8, + 16, + 32, + 64, + 128, + 257 + ], + [ + 2, + 4, + 9, + 16, + 33, + 64, + 128, + 256 + ], + [ + 2, + 4, + 9, + 16, + 32, + 65, + 128, + 256 + ], + [ + 2, + 4, + 9, + 16, + 32, + 64, + 128, + 257 + ], + [ + 2, + 4, + 8, + 17, + 33, + 64, + 128, + 256 + ], + [ + 2, + 4, + 8, + 17, + 32, + 65, + 128, + 256 + ], + [ + 2, + 4, + 8, + 17, + 32, + 64, + 129, + 256 + ], + [ + 2, + 4, + 8, + 17, + 32, + 64, + 128, + 257 + ], + [ + 2, + 4, + 8, + 16, + 33, + 64, + 129, + 256 + ], + [ + 2, + 4, + 8, + 16, + 32, + 65, + 129, + 256 + ], + [ + 2, + 4, + 8, + 16, + 32, + 65, + 128, + 257 + ], + [ + 2, + 4, + 8, + 16, + 32, + 64, + 129, + 257 + ], + [ + 1, + 6, + 10, + 16, + 32, + 64, + 128, + 256 + ], + [ + 1, + 6, + 8, + 18, + 32, + 64, + 128, + 256 + ], + [ + 1, + 6, + 8, + 16, + 34, + 64, + 128, + 256 + ], + [ + 1, + 6, + 8, + 16, + 32, + 66, + 128, + 256 + ], + [ + 1, + 6, + 8, + 16, + 32, + 64, + 130, + 256 + ], + [ + 1, + 6, + 8, + 16, + 32, + 64, + 128, + 258 + ], + [ + 1, + 4, + 10, + 18, + 32, + 64, + 128, + 256 + ], + [ + 1, + 4, + 10, + 16, + 32, + 66, + 128, + 256 + ], + [ + 1, + 4, + 10, + 16, + 32, + 64, + 130, + 256 + ], + [ + 1, + 4, + 8, + 18, + 34, + 64, + 128, + 256 + ], + [ + 1, + 4, + 8, + 18, + 32, + 64, + 130, + 256 + ], + [ + 1, + 4, + 8, + 18, + 32, + 64, + 128, + 258 + ], + [ + 1, + 4, + 8, + 16, + 34, + 66, + 128, + 256 + ], + [ + 1, + 4, + 8, + 16, + 34, + 64, + 128, + 258 + ], + [ + 1, + 4, + 8, + 16, + 32, + 66, + 130, + 256 + ], + [ + 1, + 4, + 8, + 16, + 32, + 66, + 128, + 258 + ], + [ + 1, + 4, + 8, + 16, + 32, + 64, + 130, + 258 + ], + [ + 1, + 2, + 12, + 20, + 32, + 64, + 128, + 256 + ], + [ + 1, + 2, + 12, + 16, + 36, + 64, + 128, + 256 + ], + [ + 1, + 2, + 12, + 16, + 32, + 64, + 132, + 256 + ], + [ + 1, + 2, + 12, + 16, + 32, + 64, + 128, + 260 + ], + [ + 1, + 2, + 8, + 20, + 32, + 68, + 128, + 256 + ], + [ + 1, + 2, + 8, + 20, + 32, + 64, + 132, + 256 + ], + [ + 1, + 2, + 8, + 20, + 32, + 64, + 128, + 260 + ], + [ + 1, + 2, + 8, + 16, + 36, + 68, + 128, + 256 + ], + [ + 1, + 2, + 8, + 16, + 36, + 64, + 132, + 256 + ], + [ + 1, + 2, + 8, + 16, + 36, + 64, + 128, + 260 + ], + [ + 1, + 2, + 8, + 16, + 32, + 68, + 132, + 256 + ], + [ + 1, + 2, + 8, + 16, + 32, + 68, + 128, + 260 + ], + [ + 1, + 2, + 8, + 16, + 32, + 64, + 132, + 260 + ], + [ + 1, + 2, + 4, + 24, + 40, + 64, + 128, + 256 + ], + [ + 1, + 2, + 4, + 24, + 32, + 72, + 128, + 256 + ], + [ + 1, + 2, + 4, + 24, + 32, + 64, + 136, + 256 + ], + [ + 1, + 2, + 4, + 24, + 32, + 64, + 128, + 264 + ], + [ + 1, + 2, + 4, + 16, + 40, + 64, + 136, + 256 + ], + [ + 1, + 2, + 4, + 16, + 40, + 64, + 128, + 264 + ], + [ + 1, + 2, + 4, + 16, + 32, + 72, + 136, + 256 + ], + [ + 1, + 2, + 4, + 16, + 32, + 72, + 128, + 264 + ], + [ + 1, + 2, + 4, + 16, + 32, + 64, + 136, + 264 + ], + [ + 1, + 2, + 4, + 8, + 48, + 80, + 128, + 256 + ], + [ + 1, + 2, + 4, + 8, + 48, + 64, + 144, + 256 + ], + [ + 1, + 2, + 4, + 8, + 48, + 64, + 128, + 272 + ], + [ + 1, + 2, + 4, + 8, + 32, + 80, + 144, + 256 + ], + [ + 1, + 2, + 4, + 8, + 32, + 80, + 128, + 272 + ], + [ + 1, + 2, + 4, + 8, + 32, + 64, + 144, + 272 + ], + [ + 1, + 2, + 4, + 8, + 16, + 96, + 160, + 256 + ], + [ + 1, + 2, + 4, + 8, + 16, + 96, + 128, + 288 + ], + [ + 1, + 2, + 4, + 8, + 16, + 64, + 160, + 288 + ], + [ + 1, + 2, + 12, + 20, + 36, + 68, + 132, + 260 + ], + [ + 1, + 4, + 10, + 18, + 34, + 66, + 130, + 258 + ], + [ + 1, + 6, + 8, + 18, + 34, + 66, + 130, + 258 + ], + [ + 1, + 6, + 10, + 16, + 34, + 66, + 130, + 258 + ], + [ + 1, + 6, + 10, + 18, + 32, + 66, + 130, + 258 + ], + [ + 1, + 6, + 10, + 18, + 34, + 64, + 130, + 258 + ], + [ + 1, + 6, + 10, + 18, + 34, + 66, + 128, + 258 + ], + [ + 1, + 6, + 10, + 18, + 34, + 66, + 130, + 256 + ], + [ + 2, + 4, + 9, + 17, + 33, + 65, + 129, + 257 + ], + [ + 2, + 5, + 8, + 17, + 33, + 65, + 129, + 257 + ], + [ + 2, + 5, + 9, + 16, + 33, + 65, + 129, + 257 + ], + [ + 2, + 5, + 9, + 17, + 32, + 65, + 129, + 257 + ], + [ + 2, + 5, + 9, + 17, + 33, + 64, + 129, + 257 + ], + [ + 2, + 5, + 9, + 17, + 33, + 65, + 128, + 257 + ], + [ + 2, + 5, + 9, + 17, + 33, + 65, + 129, + 256 + ], + [ + 3, + 4, + 8, + 17, + 33, + 65, + 129, + 257 + ], + [ + 3, + 4, + 9, + 17, + 32, + 65, + 129, + 257 + ], + [ + 3, + 4, + 9, + 17, + 33, + 64, + 129, + 257 + ], + [ + 3, + 4, + 9, + 17, + 33, + 65, + 128, + 257 + ], + [ + 3, + 4, + 9, + 17, + 33, + 65, + 129, + 256 + ], + [ + 3, + 5, + 8, + 16, + 33, + 65, + 129, + 257 + ], + [ + 3, + 5, + 8, + 17, + 32, + 65, + 129, + 257 + ], + [ + 3, + 5, + 8, + 17, + 33, + 64, + 129, + 257 + ], + [ + 3, + 5, + 8, + 17, + 33, + 65, + 128, + 257 + ], + [ + 3, + 5, + 8, + 17, + 33, + 65, + 129, + 256 + ], + [ + 3, + 5, + 9, + 16, + 32, + 65, + 129, + 257 + ], + [ + 3, + 5, + 9, + 16, + 33, + 64, + 129, + 257 + ], + [ + 3, + 5, + 9, + 16, + 33, + 65, + 128, + 257 + ], + [ + 3, + 5, + 9, + 16, + 33, + 65, + 129, + 256 + ], + [ + 3, + 5, + 9, + 17, + 32, + 64, + 129, + 257 + ], + [ + 3, + 5, + 9, + 17, + 32, + 65, + 128, + 257 + ], + [ + 3, + 5, + 9, + 17, + 32, + 65, + 129, + 256 + ], + [ + 3, + 5, + 9, + 17, + 33, + 64, + 128, + 257 + ], + [ + 3, + 5, + 9, + 17, + 33, + 64, + 129, + 256 + ], + [ + 26, + 41, + 75, + 388 + ], + [ + 25, + 42, + 76, + 136, + 264 + ], + [ + 51, + 85, + 145, + 273 + ], + [ + 30, + 44, + 74, + 385 + ], + [ + 6, + 24, + 42, + 74, + 385 + ], + [ + 30, + 75, + 138, + 266 + ], + [ + 30, + 42, + 75, + 138, + 266 + ], + [ + 2, + 5, + 8, + 17, + 32, + 65, + 128, + 256 + ], + [ + 13, + 19, + 70, + 416 + ], + [ + 7, + 10, + 19, + 65, + 416 + ], + [ + 30, + 102, + 134, + 262 + ], + [ + 22, + 37, + 67, + 392 + ], + [ + 51, + 75, + 131, + 259 + ], + [ + 1, + 6, + 10, + 18, + 32, + 64, + 128, + 256 + ], + [ + 3, + 4, + 8, + 17, + 33, + 64, + 128, + 256 + ], + [ + 1, + 6, + 8, + 16, + 34, + 66, + 128, + 256 + ], + [ + 3, + 4, + 9, + 16, + 32, + 65, + 128, + 256 + ], + [ + 11, + 38 + ], + [ + 11, + 51 + ], + [ + 11, + 21 + ], + [ + 45, + 448 + ], + [ + 30, + 493 + ], + [ + 51, + 478 + ], + [ + 30, + 38 + ], + [ + 21, + 38 + ], + [ + 45, + 478 + ], + [ + 21, + 45 + ], + [ + 21, + 38, + 459 + ], + [ + 11, + 51, + 448 + ], + [ + 30, + 38, + 448 + ], + [ + 11, + 21, + 486 + ], + [ + 30, + 38, + 459 + ], + [ + 11, + 21, + 448 + ], + [ + 21, + 38, + 448 + ], + [ + 11, + 51, + 469 + ], + [ + 1, + 4, + 10, + 16, + 34, + 64, + 128, + 256 + ], + [ + 45, + 208 + ], + [ + 120, + 168 + ], + [ + 85, + 133 + ], + [ + 45, + 336 + ], + [ + 120, + 296 + ], + [ + 85, + 261 + ], + [ + 85, + 296 + ], + [ + 120, + 261 + ], + [ + 85, + 168 + ], + [ + 120, + 133 + ], + [ + 45, + 261 + ], + [ + 45, + 133 + ], + [ + 120, + 133, + 261 + ], + [ + 120, + 168, + 296 + ], + [ + 85, + 168, + 261 + ], + [ + 85, + 133, + 296 + ], + [ + 85, + 168, + 296 + ], + [ + 85, + 133, + 261 + ], + [ + 120, + 133, + 296 + ], + [ + 120, + 168, + 261 + ], + [ + 45, + 85, + 133, + 261 + ], + [ + 45, + 400 + ], + [ + 75, + 400 + ], + [ + 102, + 400 + ], + [ + 14, + 35 + ], + [ + 35, + 69 + ], + [ + 14, + 69 + ], + [ + 102, + 445 + ], + [ + 75, + 445 + ], + [ + 45, + 475 + ], + [ + 14, + 69, + 435 + ], + [ + 35, + 75, + 400 + ], + [ + 35, + 69, + 414 + ], + [ + 14, + 102, + 400 + ], + [ + 14, + 102, + 435 + ], + [ + 35, + 69, + 400 + ], + [ + 35, + 75, + 414 + ], + [ + 14, + 69, + 400 + ], + [ + 14, + 35, + 69, + 400 + ], + [ + 26, + 41 + ], + [ + 41, + 81 + ], + [ + 41, + 75 + ], + [ + 51, + 388 + ], + [ + 120, + 439 + ], + [ + 75, + 439 + ], + [ + 75, + 388 + ], + [ + 120, + 388 + ], + [ + 26, + 75 + ], + [ + 26, + 98 + ], + [ + 51, + 463 + ], + [ + 51, + 81 + ], + [ + 26, + 98, + 388 + ], + [ + 41, + 81, + 414 + ], + [ + 26, + 75, + 429 + ], + [ + 41, + 75, + 388 + ], + [ + 26, + 75, + 388 + ], + [ + 41, + 75, + 414 + ], + [ + 26, + 98, + 429 + ], + [ + 41, + 81, + 388 + ], + [ + 51, + 324 + ], + [ + 85, + 290 + ], + [ + 102, + 273 + ], + [ + 51, + 196 + ], + [ + 85, + 145 + ], + [ + 102, + 145 + ], + [ + 102, + 290 + ], + [ + 85, + 273 + ], + [ + 51, + 145 + ], + [ + 51, + 273 + ], + [ + 85, + 162, + 273 + ], + [ + 85, + 145, + 290 + ], + [ + 102, + 162, + 290 + ], + [ + 102, + 145, + 273 + ], + [ + 102, + 145, + 290 + ], + [ + 102, + 162, + 273 + ], + [ + 85, + 145, + 273 + ], + [ + 85, + 162, + 290 + ], + [ + 30, + 487 + ], + [ + 120, + 415 + ], + [ + 102, + 385 + ], + [ + 30, + 74 + ], + [ + 44, + 84 + ], + [ + 50, + 84 + ], + [ + 44, + 74 + ], + [ + 50, + 74 + ], + [ + 102, + 415 + ], + [ + 120, + 385 + ], + [ + 30, + 44 + ], + [ + 30, + 385 + ], + [ + 50, + 74, + 385 + ], + [ + 44, + 84, + 415 + ], + [ + 50, + 84, + 415 + ], + [ + 44, + 74, + 385 + ], + [ + 44, + 74, + 415 + ], + [ + 50, + 84, + 385 + ], + [ + 44, + 84, + 385 + ], + [ + 50, + 74, + 415 + ], + [ + 30, + 138 + ], + [ + 85, + 148 + ], + [ + 75, + 148 + ], + [ + 30, + 266 + ], + [ + 75, + 276 + ], + [ + 85, + 276 + ], + [ + 75, + 138 + ], + [ + 85, + 138 + ], + [ + 30, + 321 + ], + [ + 30, + 193 + ], + [ + 85, + 138, + 276 + ], + [ + 85, + 148, + 266 + ], + [ + 75, + 138, + 266 + ], + [ + 75, + 148, + 276 + ], + [ + 75, + 138, + 276 + ], + [ + 75, + 148, + 266 + ], + [ + 85, + 138, + 266 + ], + [ + 85, + 148, + 276 + ], + [ + 13, + 19 + ], + [ + 13, + 85 + ], + [ + 13, + 70 + ], + [ + 30, + 416 + ], + [ + 75, + 446 + ], + [ + 85, + 416 + ], + [ + 19, + 75 + ], + [ + 19, + 70 + ], + [ + 30, + 491 + ], + [ + 30, + 70 + ], + [ + 19, + 70, + 416 + ], + [ + 13, + 85, + 435 + ], + [ + 19, + 75, + 429 + ], + [ + 13, + 70, + 416 + ], + [ + 19, + 75, + 416 + ], + [ + 13, + 70, + 435 + ], + [ + 19, + 70, + 429 + ], + [ + 13, + 85, + 416 + ], + [ + 30, + 352 + ], + [ + 120, + 262 + ], + [ + 102, + 280 + ], + [ + 30, + 224 + ], + [ + 120, + 152 + ], + [ + 102, + 134 + ], + [ + 102, + 152 + ], + [ + 120, + 134 + ], + [ + 102, + 262 + ], + [ + 120, + 280 + ], + [ + 30, + 134 + ], + [ + 30, + 262 + ], + [ + 120, + 134, + 280 + ], + [ + 120, + 152, + 262 + ], + [ + 102, + 134, + 262 + ], + [ + 102, + 152, + 280 + ], + [ + 102, + 152, + 262 + ], + [ + 102, + 134, + 280 + ], + [ + 120, + 152, + 280 + ], + [ + 120, + 134, + 262 + ], + [ + 51, + 477 + ], + [ + 85, + 443 + ], + [ + 102, + 392 + ], + [ + 51, + 67 + ], + [ + 37, + 85 + ], + [ + 22, + 102 + ], + [ + 102, + 443 + ], + [ + 85, + 392 + ], + [ + 22, + 37 + ], + [ + 51, + 392 + ], + [ + 22, + 67, + 392 + ], + [ + 37, + 85, + 414 + ], + [ + 22, + 102, + 429 + ], + [ + 37, + 67, + 392 + ], + [ + 37, + 67, + 414 + ], + [ + 22, + 102, + 392 + ], + [ + 37, + 85, + 392 + ], + [ + 22, + 67, + 429 + ], + [ + 51, + 131 + ], + [ + 120, + 176 + ], + [ + 75, + 176 + ], + [ + 51, + 259 + ], + [ + 120, + 259 + ], + [ + 75, + 259 + ], + [ + 75, + 304 + ], + [ + 120, + 304 + ], + [ + 75, + 131 + ], + [ + 120, + 131 + ], + [ + 51, + 328 + ], + [ + 51, + 200 + ], + [ + 120, + 131, + 304 + ], + [ + 120, + 176, + 259 + ], + [ + 75, + 131, + 259 + ], + [ + 75, + 176, + 304 + ], + [ + 75, + 131, + 304 + ], + [ + 75, + 176, + 259 + ], + [ + 120, + 131, + 259 + ], + [ + 120, + 176, + 304 + ], + [ + 45, + 265 + ], + [ + 75, + 265 + ], + [ + 102, + 265 + ], + [ + 45, + 137 + ], + [ + 102, + 164 + ], + [ + 75, + 164 + ], + [ + 102, + 292 + ], + [ + 75, + 292 + ], + [ + 45, + 194 + ], + [ + 45, + 322 + ], + [ + 75, + 164, + 292 + ], + [ + 75, + 137, + 265 + ], + [ + 102, + 137, + 292 + ], + [ + 102, + 164, + 265 + ], + [ + 102, + 164, + 292 + ], + [ + 102, + 137, + 265 + ], + [ + 75, + 137, + 292 + ], + [ + 75, + 164, + 265 + ], + [ + 3, + 5, + 9, + 17, + 33, + 65, + 128, + 256 + ], + [ + 45, + 73 + ], + [ + 49, + 73 + ], + [ + 28, + 73 + ], + [ + 45, + 471 + ], + [ + 120, + 386 + ], + [ + 85, + 431 + ], + [ + 85, + 386 + ], + [ + 120, + 431 + ], + [ + 49, + 85 + ], + [ + 28, + 100 + ], + [ + 45, + 386 + ], + [ + 28, + 45 + ], + [ + 28, + 100, + 431 + ], + [ + 49, + 73, + 386 + ], + [ + 49, + 85, + 414 + ], + [ + 28, + 73, + 386 + ], + [ + 49, + 85, + 386 + ], + [ + 28, + 73, + 431 + ], + [ + 28, + 100, + 386 + ], + [ + 49, + 73, + 414 + ], + [ + 28, + 45, + 73, + 386 + ], + [ + 45, + 146 + ], + [ + 51, + 146 + ], + [ + 30, + 140 + ], + [ + 30, + 268 + ], + [ + 51, + 268 + ], + [ + 30, + 161 + ], + [ + 51, + 140 + ], + [ + 45, + 274 + ], + [ + 45, + 140 + ], + [ + 51, + 140, + 268 + ], + [ + 51, + 146, + 274 + ], + [ + 30, + 161, + 289 + ], + [ + 30, + 140, + 268 + ], + [ + 30, + 161, + 268 + ], + [ + 30, + 140, + 289 + ], + [ + 51, + 140, + 274 + ], + [ + 51, + 146, + 268 + ], + [ + 30, + 45, + 140, + 268 + ], + [ + 2, + 4, + 8, + 16, + 33, + 65, + 128, + 256 + ], + [ + 1, + 2, + 12, + 16, + 32, + 68, + 128, + 256 + ], + [ + 30, + 74, + 429 + ], + [ + 1, + 10, + 20, + 32, + 64, + 390 + ], + [ + 30, + 224, + 262 + ], + [ + 30, + 74, + 138, + 295 + ], + [ + 30, + 33, + 193, + 262 + ], + [ + 1, + 30, + 32, + 64, + 128, + 268 + ], + [ + 10, + 20, + 32, + 65, + 133, + 258 + ], + [ + 4, + 10, + 16, + 32, + 65, + 387 + ], + [ + 10, + 20, + 32, + 65, + 132, + 259 + ], + [ + 5, + 10, + 17, + 32, + 65, + 386 + ], + [ + 1, + 10, + 20, + 32, + 64, + 128, + 262 + ], + [ + 5, + 10, + 17, + 32, + 65, + 128, + 258 + ], + [ + 1, + 4, + 10, + 16, + 32, + 64, + 128, + 258 + ], + [ + 4, + 10, + 16, + 32, + 65, + 128, + 259 + ], + [ + 51, + 81, + 414 + ], + [ + 4, + 8, + 17, + 34, + 64, + 387 + ], + [ + 51, + 131, + 328 + ], + [ + 8, + 17, + 34, + 68, + 131, + 260 + ], + [ + 8, + 17, + 34, + 68, + 130, + 261 + ], + [ + 1, + 8, + 16, + 34, + 68, + 390 + ], + [ + 8, + 17, + 34, + 68, + 134, + 257 + ], + [ + 5, + 8, + 17, + 34, + 65, + 386 + ], + [ + 4, + 8, + 17, + 34, + 64, + 131, + 256 + ], + [ + 5, + 8, + 17, + 34, + 65, + 130, + 256 + ], + [ + 1, + 4, + 8, + 16, + 34, + 64, + 130, + 256 + ], + [ + 1, + 8, + 16, + 34, + 68, + 134, + 256 + ], + [ + 45, + 146, + 272 + ], + [ + 45, + 73, + 274 + ], + [ + 45, + 73, + 144, + 274 + ], + [ + 5, + 18, + 40, + 73, + 130, + 256 + ], + [ + 2, + 5, + 16, + 40, + 73, + 128, + 256 + ], + [ + 21, + 45, + 459 + ], + [ + 45, + 222, + 261 + ], + [ + 2, + 5, + 40, + 217, + 256 + ], + [ + 2, + 5, + 40, + 89, + 128, + 256 + ], + [ + 3, + 4, + 41, + 72, + 144, + 272 + ], + [ + 1, + 6, + 42, + 74, + 144, + 272 + ], + [ + 7, + 17, + 42, + 75, + 129, + 257 + ], + [ + 7, + 19, + 42, + 75, + 131, + 259 + ], + [ + 3, + 4, + 16, + 41, + 72, + 128, + 256 + ], + [ + 1, + 2, + 4, + 16, + 40, + 72, + 128, + 256 + ], + [ + 1, + 6, + 16, + 42, + 74, + 128, + 256 + ], + [ + 45, + 208, + 261 + ], + [ + 45, + 80, + 146 + ], + [ + 45, + 80, + 146, + 261 + ], + [ + 2, + 12, + 33, + 80, + 144, + 261 + ], + [ + 2, + 12, + 16, + 33, + 64, + 128, + 261 + ], + [ + 14, + 35, + 469 + ], + [ + 45, + 140, + 347 + ], + [ + 14, + 35, + 66, + 130, + 279 + ], + [ + 14, + 18, + 35, + 66, + 130, + 261 + ], + [ + 26, + 41, + 463 + ], + [ + 51, + 196, + 273 + ], + [ + 30, + 74, + 385 + ], + [ + 30, + 138, + 321 + ], + [ + 30, + 70, + 416 + ], + [ + 30, + 134, + 352 + ], + [ + 22, + 37, + 459 + ], + [ + 51, + 200, + 259 + ], + [ + 4, + 18, + 33, + 459 + ], + [ + 18, + 33, + 200, + 259 + ], + [ + 30, + 33, + 70, + 385 + ], + [ + 30, + 33, + 134, + 321 + ], + [ + 12, + 18, + 70, + 385 + ], + [ + 12, + 18, + 134, + 321 + ], + [ + 12, + 22, + 37, + 451 + ], + [ + 12, + 51, + 196, + 273 + ], + [ + 4, + 8, + 18, + 33, + 451 + ], + [ + 12, + 18, + 33, + 70, + 385 + ], + [ + 12, + 18, + 33, + 134, + 321 + ], + [ + 12, + 18, + 33, + 196, + 259 + ], + [ + 4, + 8, + 18, + 33, + 192, + 259 + ], + [ + 2, + 4, + 8, + 16, + 33, + 64, + 128, + 257 + ], + [ + 12, + 18, + 33, + 70, + 134, + 263 + ], + [ + 7 + ], + [ + 25 + ], + [ + 52 + ], + [ + 45, + 82, + 144 + ], + [ + 82 + ], + [ + 491 + ], + [ + 448 + ], + [ + 67 + ], + [ + 137 + ], + [ + 25, + 45 + ], + [ + 52, + 82 + ], + [ + 7, + 97 + ], + [ + 7, + 75 + ], + [ + 7, + 75, + 384 + ], + [ + 25, + 102 + ], + [ + 25, + 42 + ], + [ + 25, + 459 + ], + [ + 75, + 416 + ], + [ + 7, + 42, + 258 + ], + [ + 7, + 25, + 35, + 75, + 131, + 259 + ], + [ + 30, + 76 + ], + [ + 30, + 76, + 423 + ], + [ + 13, + 19, + 65 + ], + [ + 25, + 42, + 196 + ], + [ + 30, + 44, + 76 + ], + [ + 30, + 42, + 321 + ], + [ + 7, + 42, + 448 + ], + [ + 7, + 9, + 35 + ], + [ + 7, + 42, + 336 + ], + [ + 7, + 11, + 33, + 448 + ], + [ + 7, + 42, + 192, + 336 + ], + [ + 7, + 9, + 35, + 208 + ], + [ + 7, + 42, + 80, + 144, + 256 + ], + [ + 2, + 5, + 9, + 33, + 448 + ], + [ + 7, + 9, + 35, + 208, + 336 + ], + [ + 2, + 5, + 9, + 33, + 208, + 336 + ], + [ + 2, + 5, + 9, + 33, + 80, + 400 + ], + [ + 7, + 16, + 42, + 64, + 128, + 256 + ], + [ + 7, + 9, + 16, + 35, + 64, + 128, + 256 + ], + [ + 2, + 5, + 9, + 33, + 80, + 128, + 272 + ], + [ + 2, + 5, + 9, + 33, + 80, + 144, + 256 + ], + [ + 7, + 11, + 16, + 33, + 64, + 128, + 256 + ], + [ + 2, + 5, + 9, + 33, + 64, + 144, + 272 + ], + [ + 25, + 45, + 455 + ], + [ + 25, + 45, + 462 + ], + [ + 25, + 45, + 137 + ], + [ + 11, + 18, + 38, + 455 + ], + [ + 25, + 45, + 73, + 137 + ], + [ + 25, + 45, + 199, + 265 + ], + [ + 25, + 45, + 73, + 137, + 263 + ], + [ + 2, + 9, + 16, + 36, + 453 + ], + [ + 25, + 45, + 78, + 137, + 265 + ], + [ + 11, + 18, + 38, + 69, + 130, + 258 + ], + [ + 2, + 9, + 16, + 36, + 64, + 389 + ], + [ + 14, + 23, + 35, + 71, + 135, + 263 + ], + [ + 7, + 11, + 18, + 33, + 66, + 130, + 258 + ], + [ + 2, + 9, + 16, + 36, + 64, + 128, + 261 + ], + [ + 5, + 11, + 18, + 35, + 66, + 130, + 258 + ], + [ + 2, + 9, + 16, + 36, + 69, + 128, + 256 + ], + [ + 82, + 268 + ], + [ + 5, + 40, + 82, + 265 + ], + [ + 9, + 36, + 82, + 130, + 261 + ], + [ + 5, + 40, + 82, + 144, + 265 + ], + [ + 5, + 18, + 40, + 64, + 130, + 265 + ], + [ + 9, + 16, + 36, + 66, + 130, + 261 + ], + [ + 2, + 5, + 16, + 40, + 64, + 128, + 265 + ], + [ + 5, + 9, + 16, + 33, + 66, + 130, + 256 + ], + [ + 5, + 9, + 18, + 33, + 64, + 130, + 256 + ], + [ + 45, + 69, + 400 + ], + [ + 9, + 36, + 69, + 146, + 272 + ], + [ + 45, + 69, + 130, + 274 + ], + [ + 9, + 16, + 36, + 69, + 130, + 258 + ], + [ + 5, + 9, + 33, + 64, + 146, + 272 + ], + [ + 5, + 9, + 16, + 33, + 64, + 130, + 258 + ], + [ + 5, + 9, + 18, + 33, + 64, + 128, + 258 + ], + [ + 28, + 45, + 268 + ], + [ + 14, + 35, + 66, + 149, + 258 + ], + [ + 28, + 45, + 199, + 268 + ], + [ + 12, + 16, + 33, + 64, + 135, + 256 + ], + [ + 14, + 23, + 35, + 66, + 130, + 258 + ], + [ + 7, + 9, + 18, + 35, + 66, + 130, + 258 + ], + [ + 2, + 12, + 21, + 33, + 64, + 128, + 256 + ], + [ + 2, + 12, + 16, + 33, + 64, + 133, + 256 + ], + [ + 7, + 66 + ], + [ + 7, + 42, + 66, + 130 + ], + [ + 7, + 18, + 42, + 66, + 393 + ], + [ + 7, + 42, + 66, + 130, + 258 + ], + [ + 7, + 18, + 42, + 66, + 130, + 258 + ], + [ + 2, + 5, + 16, + 40, + 64, + 393 + ], + [ + 2, + 5, + 25, + 40, + 64, + 128, + 256 + ], + [ + 2, + 5, + 16, + 40, + 64, + 137, + 256 + ], + [ + 25, + 45, + 448 + ], + [ + 25, + 45, + 386 + ], + [ + 25, + 45, + 194 + ], + [ + 12, + 21, + 33, + 448 + ], + [ + 5, + 25, + 40, + 194 + ], + [ + 25, + 45, + 192, + 322 + ], + [ + 5, + 25, + 40, + 194, + 258 + ], + [ + 12, + 21, + 33, + 66, + 386 + ], + [ + 2, + 25, + 45, + 192, + 320 + ], + [ + 2, + 12, + 21, + 33, + 192, + 320 + ], + [ + 5, + 9, + 16, + 33, + 66, + 386 + ], + [ + 5, + 25, + 40, + 64, + 130, + 258 + ], + [ + 5, + 9, + 16, + 33, + 66, + 128, + 258 + ], + [ + 45, + 82, + 258 + ], + [ + 45, + 82, + 274 + ], + [ + 45, + 82, + 137 + ], + [ + 45, + 82, + 133, + 258 + ], + [ + 5, + 40, + 82, + 137 + ], + [ + 2, + 45, + 80, + 272 + ], + [ + 5, + 40, + 82, + 137, + 258 + ], + [ + 16, + 45, + 66, + 133, + 258 + ], + [ + 2, + 45, + 80, + 137, + 272 + ], + [ + 2, + 12, + 33, + 80, + 133, + 272 + ], + [ + 9, + 16, + 36, + 66, + 133, + 258 + ], + [ + 5, + 18, + 40, + 64, + 137, + 258 + ], + [ + 11, + 18, + 33, + 448 + ], + [ + 30, + 42 + ], + [ + 12, + 18, + 38, + 448 + ], + [ + 7, + 9, + 97, + 435 + ], + [ + 7, + 35, + 66, + 400 + ], + [ + 7, + 35, + 75, + 409 + ], + [ + 7, + 9, + 66, + 400 + ], + [ + 26, + 41, + 388 + ], + [ + 51, + 81, + 388 + ], + [ + 3, + 25, + 41, + 388 + ], + [ + 3, + 8, + 17, + 33, + 68, + 388 + ], + [ + 51, + 145, + 273 + ], + [ + 25, + 42, + 196, + 324 + ], + [ + 51, + 145, + 324 + ], + [ + 12, + 21, + 38, + 71, + 132, + 260 + ], + [ + 11, + 18, + 33, + 64, + 132, + 260 + ], + [ + 25, + 102, + 136, + 290 + ], + [ + 25, + 102, + 162, + 264 + ], + [ + 30, + 44, + 385 + ], + [ + 30, + 44, + 76, + 391 + ], + [ + 6, + 24, + 42, + 385 + ], + [ + 6, + 10, + 18, + 32, + 65, + 385 + ], + [ + 24, + 42, + 74, + 385 + ], + [ + 6, + 42, + 82, + 409 + ], + [ + 30, + 42, + 193, + 321 + ], + [ + 30, + 138, + 266 + ], + [ + 30, + 193, + 266 + ], + [ + 12, + 18, + 38, + 64, + 129, + 257 + ], + [ + 11, + 21, + 33, + 455 + ], + [ + 11, + 21, + 33, + 71, + 129, + 257 + ], + [ + 30, + 70, + 429 + ], + [ + 13, + 19, + 416 + ], + [ + 13, + 19, + 65, + 423 + ], + [ + 1, + 6, + 24, + 32, + 64, + 394 + ], + [ + 1, + 6, + 10, + 18, + 96, + 416 + ], + [ + 30, + 134, + 262 + ], + [ + 30, + 224, + 352 + ], + [ + 7, + 25, + 33, + 75, + 129, + 257 + ], + [ + 7, + 11, + 18, + 64, + 160, + 288 + ], + [ + 22, + 37, + 392 + ], + [ + 51, + 67, + 414 + ], + [ + 51, + 67, + 392 + ], + [ + 3, + 4, + 17, + 33, + 72, + 392 + ], + [ + 3, + 4, + 8, + 48, + 64, + 401 + ], + [ + 7, + 97, + 426 + ], + [ + 7, + 34, + 67, + 392 + ], + [ + 51, + 200, + 328 + ], + [ + 51, + 131, + 259 + ], + [ + 7, + 18, + 33, + 64, + 136, + 264 + ], + [ + 7, + 11, + 51, + 82, + 131, + 259 + ], + [ + 7, + 75, + 176, + 304 + ], + [ + 25, + 75, + 164, + 292 + ], + [ + 25, + 75, + 137, + 265 + ], + [ + 52, + 82, + 144, + 272 + ], + [ + 52, + 82, + 137, + 265 + ], + [ + 5, + 25, + 97, + 426 + ], + [ + 25, + 40, + 73, + 386 + ], + [ + 28, + 40, + 76, + 386 + ], + [ + 5, + 49, + 73, + 411 + ], + [ + 8, + 17, + 34, + 67, + 132, + 260 + ], + [ + 3, + 4, + 48, + 81, + 136, + 264 + ], + [ + 15, + 22, + 37, + 68, + 132, + 260 + ], + [ + 7, + 26, + 41, + 72, + 136, + 264 + ], + [ + 30, + 76, + 161, + 289 + ], + [ + 30, + 76, + 140, + 268 + ], + [ + 13, + 19, + 39, + 65, + 129, + 257 + ], + [ + 7, + 25, + 43, + 75, + 139, + 267 + ], + [ + 8, + 17, + 34, + 68, + 132, + 259 + ], + [ + 3, + 4, + 48, + 72, + 136, + 273 + ], + [ + 3, + 4, + 48, + 72, + 145, + 264 + ], + [ + 51, + 79, + 145, + 273 + ], + [ + 3, + 25, + 41, + 196, + 324 + ], + [ + 18, + 33, + 67, + 392 + ], + [ + 51, + 81, + 145, + 271 + ], + [ + 3, + 25, + 41, + 192, + 324 + ], + [ + 18, + 33, + 131, + 328 + ], + [ + 6, + 24, + 42, + 193, + 321 + ], + [ + 30, + 103, + 138, + 266 + ], + [ + 6, + 10, + 18, + 64, + 161, + 289 + ], + [ + 13, + 19, + 33, + 65, + 390 + ], + [ + 6, + 24, + 42, + 192, + 321 + ], + [ + 6, + 10, + 18, + 97, + 161, + 256 + ], + [ + 6, + 10, + 18, + 97, + 128, + 289 + ], + [ + 30, + 107, + 134, + 262 + ], + [ + 13, + 19, + 224, + 352 + ], + [ + 1, + 30, + 32, + 76, + 128, + 256 + ], + [ + 12, + 18, + 32, + 64, + 391 + ], + [ + 30, + 70, + 134, + 299 + ], + [ + 13, + 19, + 192, + 352 + ], + [ + 12, + 18, + 193, + 262 + ], + [ + 1, + 30, + 32, + 64, + 140, + 256 + ], + [ + 22, + 37, + 200, + 328 + ], + [ + 51, + 93, + 131, + 259 + ], + [ + 12, + 51, + 81, + 388 + ], + [ + 22, + 37, + 192, + 328 + ], + [ + 51, + 67, + 131, + 285 + ], + [ + 12, + 51, + 145, + 324 + ], + [ + 30, + 45, + 79, + 143, + 271 + ], + [ + 3, + 4, + 25, + 41, + 192, + 320 + ], + [ + 1, + 6, + 24, + 42, + 192, + 320 + ], + [ + 30, + 45, + 74, + 138, + 266 + ], + [ + 30, + 45, + 70, + 134, + 262 + ], + [ + 13, + 19, + 32, + 192, + 320 + ], + [ + 8, + 22, + 37, + 192, + 320 + ], + [ + 30, + 45, + 67, + 131, + 259 + ], + [ + 2, + 5, + 24, + 40, + 72, + 385 + ], + [ + 1, + 2, + 4, + 40, + 80, + 408 + ], + [ + 2, + 5, + 40, + 80, + 136, + 273 + ], + [ + 2, + 5, + 40, + 80, + 145, + 264 + ], + [ + 2, + 5, + 17, + 40, + 65, + 392 + ], + [ + 2, + 5, + 8, + 32, + 80, + 401 + ], + [ + 2, + 5, + 40, + 80, + 129, + 280 + ], + [ + 2, + 5, + 40, + 80, + 152, + 257 + ], + [ + 7, + 26, + 42, + 75, + 138, + 266 + ], + [ + 7, + 24, + 42, + 75, + 136, + 264 + ], + [ + 7, + 8, + 34, + 67, + 144, + 272 + ], + [ + 7, + 10, + 32, + 65, + 144, + 272 + ], + [ + 1, + 24, + 42, + 74, + 132, + 260 + ], + [ + 6, + 25, + 42, + 75, + 130, + 258 + ], + [ + 14, + 23, + 36, + 69, + 132, + 260 + ], + [ + 9, + 16, + 35, + 66, + 132, + 260 + ], + [ + 10, + 19, + 32, + 65, + 132, + 260 + ], + [ + 13, + 20, + 39, + 70, + 132, + 260 + ], + [ + 5, + 25, + 42, + 75, + 129, + 257 + ], + [ + 2, + 25, + 40, + 73, + 132, + 260 + ], + [ + 8, + 17, + 34, + 68, + 133, + 258 + ], + [ + 6, + 8, + 17, + 34, + 66, + 385 + ], + [ + 8, + 17, + 34, + 68, + 129, + 262 + ], + [ + 2, + 8, + 17, + 32, + 68, + 389 + ], + [ + 4, + 26, + 42, + 72, + 129, + 257 + ], + [ + 3, + 29, + 41, + 76, + 129, + 257 + ], + [ + 9, + 23, + 35, + 69, + 129, + 257 + ], + [ + 14, + 16, + 36, + 66, + 129, + 257 + ], + [ + 15, + 17, + 37, + 67, + 129, + 257 + ], + [ + 8, + 22, + 34, + 68, + 129, + 257 + ], + [ + 2, + 28, + 40, + 76, + 129, + 257 + ], + [ + 5, + 27, + 42, + 73, + 129, + 257 + ], + [ + 10, + 20, + 32, + 65, + 130, + 261 + ], + [ + 3, + 9, + 20, + 32, + 65, + 388 + ], + [ + 10, + 20, + 32, + 65, + 131, + 260 + ], + [ + 2, + 8, + 20, + 32, + 65, + 389 + ], + [ + 7, + 8, + 17, + 67, + 160, + 288 + ], + [ + 7, + 25, + 34, + 75, + 130, + 258 + ], + [ + 7, + 9, + 16, + 66, + 160, + 288 + ], + [ + 3, + 4, + 25, + 72, + 160, + 288 + ], + [ + 7, + 25, + 41, + 75, + 137, + 265 + ], + [ + 7, + 25, + 40, + 75, + 136, + 264 + ], + [ + 2, + 5, + 25, + 73, + 160, + 288 + ], + [ + 1, + 6, + 24, + 96, + 130, + 296 + ], + [ + 1, + 6, + 24, + 96, + 168, + 258 + ], + [ + 1, + 6, + 8, + 16, + 96, + 418 + ], + [ + 1, + 6, + 24, + 34, + 66, + 392 + ], + [ + 1, + 6, + 24, + 96, + 136, + 290 + ], + [ + 1, + 6, + 24, + 96, + 162, + 264 + ], + [ + 1, + 2, + 4, + 24, + 96, + 424 + ], + [ + 1, + 6, + 24, + 40, + 72, + 386 + ], + [ + 19, + 32, + 70, + 136, + 264 + ], + [ + 7, + 10, + 51, + 82, + 130, + 258 + ], + [ + 7, + 9, + 51, + 82, + 129, + 257 + ], + [ + 7, + 16, + 35, + 66, + 136, + 264 + ], + [ + 7, + 24, + 43, + 74, + 136, + 264 + ], + [ + 1, + 6, + 50, + 82, + 136, + 264 + ], + [ + 2, + 5, + 49, + 80, + 136, + 264 + ], + [ + 7, + 27, + 40, + 73, + 136, + 264 + ], + [ + 3, + 4, + 48, + 72, + 129, + 280 + ], + [ + 3, + 4, + 48, + 72, + 152, + 257 + ], + [ + 3, + 4, + 16, + 32, + 72, + 393 + ], + [ + 3, + 4, + 9, + 48, + 65, + 400 + ], + [ + 3, + 4, + 48, + 72, + 137, + 272 + ], + [ + 3, + 4, + 48, + 72, + 144, + 265 + ], + [ + 3, + 4, + 24, + 40, + 72, + 385 + ], + [ + 1, + 2, + 4, + 48, + 72, + 408 + ], + [ + 3, + 9, + 16, + 36, + 65, + 388 + ], + [ + 4, + 9, + 32, + 66, + 403 + ], + [ + 9, + 16, + 36, + 66, + 129, + 262 + ], + [ + 9, + 16, + 36, + 66, + 134, + 257 + ], + [ + 1, + 8, + 16, + 36, + 66, + 390 + ], + [ + 9, + 22, + 36, + 66, + 385 + ], + [ + 9, + 36, + 66, + 131, + 276 + ], + [ + 9, + 16, + 36, + 66, + 132, + 259 + ], + [ + 3, + 25, + 45, + 76, + 129, + 257 + ], + [ + 4, + 25, + 41, + 72, + 130, + 258 + ], + [ + 10, + 19, + 39, + 70, + 130, + 258 + ], + [ + 13, + 20, + 32, + 65, + 130, + 258 + ], + [ + 8, + 17, + 37, + 68, + 130, + 258 + ], + [ + 15, + 22, + 34, + 67, + 130, + 258 + ], + [ + 1, + 24, + 44, + 76, + 130, + 258 + ], + [ + 6, + 25, + 43, + 74, + 130, + 258 + ], + [ + 12, + 18, + 33, + 67, + 388 + ], + [ + 1, + 12, + 18, + 32, + 64, + 390 + ], + [ + 12, + 18, + 33, + 193, + 262 + ], + [ + 12, + 18, + 33, + 131, + 324 + ], + [ + 3, + 12, + 21, + 37, + 68, + 132, + 260 + ], + [ + 4, + 8, + 17, + 34, + 67, + 128, + 256 + ], + [ + 4, + 11, + 18, + 33, + 64, + 128, + 256 + ], + [ + 3, + 8, + 17, + 33, + 64, + 132, + 260 + ], + [ + 4, + 8, + 17, + 34, + 64, + 128, + 259 + ], + [ + 3, + 8, + 17, + 33, + 68, + 128, + 260 + ], + [ + 3, + 8, + 17, + 33, + 68, + 132, + 256 + ], + [ + 1, + 12, + 18, + 38, + 64, + 128, + 256 + ], + [ + 6, + 10, + 18, + 32, + 64, + 129, + 257 + ], + [ + 6, + 11, + 19, + 33, + 65, + 129, + 257 + ], + [ + 1, + 10, + 20, + 32, + 70, + 128, + 256 + ], + [ + 6, + 10, + 18, + 32, + 65, + 128, + 257 + ], + [ + 6, + 10, + 18, + 32, + 65, + 129, + 256 + ], + [ + 1, + 10, + 20, + 32, + 64, + 134, + 256 + ], + [ + 7, + 10, + 19, + 33, + 65, + 129, + 257 + ], + [ + 1, + 6, + 24, + 32, + 74, + 128, + 256 + ], + [ + 7, + 11, + 18, + 32, + 64, + 128, + 256 + ], + [ + 1, + 6, + 10, + 18, + 64, + 160, + 288 + ], + [ + 1, + 6, + 24, + 32, + 64, + 138, + 256 + ], + [ + 1, + 6, + 24, + 32, + 64, + 128, + 266 + ], + [ + 1, + 6, + 10, + 18, + 96, + 128, + 288 + ], + [ + 1, + 6, + 10, + 18, + 96, + 160, + 256 + ], + [ + 7, + 8, + 18, + 33, + 64, + 128, + 256 + ], + [ + 3, + 4, + 17, + 33, + 64, + 136, + 264 + ], + [ + 7, + 11, + 17, + 34, + 67, + 131, + 259 + ], + [ + 3, + 4, + 8, + 48, + 81, + 128, + 256 + ], + [ + 3, + 4, + 17, + 33, + 72, + 128, + 264 + ], + [ + 3, + 4, + 17, + 33, + 72, + 136, + 256 + ], + [ + 3, + 4, + 8, + 48, + 64, + 145, + 256 + ], + [ + 3, + 4, + 8, + 48, + 64, + 128, + 273 + ], + [ + 8, + 22, + 37, + 71, + 135, + 263 + ], + [ + 3, + 4, + 25, + 41, + 64, + 128, + 256 + ], + [ + 1, + 6, + 24, + 42, + 64, + 128, + 256 + ], + [ + 13, + 19, + 32, + 71, + 135, + 263 + ], + [ + 12, + 18, + 33, + 67, + 131, + 259 + ], + [ + 12, + 18, + 33, + 70, + 134, + 262 + ], + [ + 2, + 5, + 24, + 40, + 72, + 129, + 256 + ], + [ + 1, + 2, + 4, + 40, + 80, + 152, + 256 + ], + [ + 2, + 5, + 17, + 40, + 65, + 136, + 256 + ], + [ + 2, + 5, + 8, + 32, + 80, + 145, + 256 + ], + [ + 2, + 5, + 24, + 40, + 72, + 128, + 257 + ], + [ + 1, + 2, + 4, + 40, + 80, + 128, + 280 + ], + [ + 2, + 5, + 8, + 32, + 80, + 128, + 273 + ], + [ + 2, + 5, + 17, + 40, + 65, + 128, + 264 + ], + [ + 7, + 9, + 19, + 35, + 66, + 131, + 259 + ], + [ + 3, + 4, + 9, + 32, + 65, + 144, + 272 + ], + [ + 7, + 9, + 17, + 35, + 66, + 129, + 257 + ], + [ + 1, + 6, + 8, + 34, + 66, + 144, + 272 + ], + [ + 7, + 10, + 16, + 32, + 65, + 128, + 256 + ], + [ + 7, + 8, + 16, + 34, + 67, + 128, + 256 + ], + [ + 1, + 4, + 24, + 42, + 74, + 128, + 256 + ], + [ + 2, + 4, + 25, + 40, + 73, + 128, + 256 + ], + [ + 4, + 10, + 19, + 32, + 65, + 128, + 256 + ], + [ + 4, + 9, + 16, + 35, + 66, + 128, + 256 + ], + [ + 1, + 2, + 24, + 40, + 72, + 132, + 260 + ], + [ + 3, + 5, + 25, + 41, + 72, + 129, + 257 + ], + [ + 3, + 13, + 20, + 36, + 69, + 132, + 260 + ], + [ + 3, + 9, + 16, + 32, + 65, + 132, + 260 + ], + [ + 2, + 8, + 17, + 32, + 68, + 128, + 261 + ], + [ + 5, + 8, + 17, + 34, + 65, + 128, + 258 + ], + [ + 1, + 8, + 16, + 34, + 68, + 128, + 262 + ], + [ + 6, + 8, + 17, + 34, + 66, + 128, + 257 + ], + [ + 2, + 8, + 17, + 32, + 68, + 133, + 256 + ], + [ + 6, + 8, + 17, + 34, + 66, + 129, + 256 + ], + [ + 2, + 4, + 24, + 40, + 72, + 129, + 257 + ], + [ + 3, + 5, + 24, + 41, + 73, + 129, + 257 + ], + [ + 6, + 9, + 17, + 35, + 67, + 129, + 257 + ], + [ + 6, + 8, + 16, + 34, + 66, + 129, + 257 + ], + [ + 1, + 4, + 26, + 42, + 72, + 128, + 256 + ], + [ + 1, + 2, + 28, + 40, + 76, + 128, + 256 + ], + [ + 1, + 8, + 22, + 34, + 68, + 128, + 256 + ], + [ + 1, + 14, + 16, + 36, + 66, + 128, + 256 + ], + [ + 5, + 10, + 17, + 32, + 65, + 130, + 256 + ], + [ + 2, + 8, + 20, + 32, + 65, + 133, + 256 + ], + [ + 4, + 10, + 16, + 32, + 65, + 131, + 256 + ], + [ + 3, + 9, + 20, + 32, + 65, + 132, + 256 + ], + [ + 2, + 8, + 20, + 32, + 65, + 128, + 261 + ], + [ + 3, + 9, + 20, + 32, + 65, + 128, + 260 + ], + [ + 7, + 8, + 17, + 32, + 67, + 128, + 256 + ], + [ + 2, + 5, + 25, + 32, + 73, + 128, + 256 + ], + [ + 3, + 4, + 25, + 32, + 72, + 128, + 256 + ], + [ + 7, + 9, + 16, + 32, + 66, + 128, + 256 + ], + [ + 2, + 5, + 8, + 17, + 65, + 160, + 288 + ], + [ + 7, + 10, + 19, + 35, + 65, + 131, + 259 + ], + [ + 1, + 2, + 4, + 24, + 96, + 128, + 296 + ], + [ + 1, + 6, + 24, + 40, + 72, + 128, + 258 + ], + [ + 1, + 6, + 8, + 16, + 96, + 128, + 290 + ], + [ + 1, + 6, + 24, + 34, + 66, + 128, + 264 + ], + [ + 1, + 6, + 24, + 40, + 72, + 130, + 256 + ], + [ + 1, + 2, + 4, + 24, + 96, + 168, + 256 + ], + [ + 1, + 6, + 8, + 16, + 96, + 162, + 256 + ], + [ + 1, + 6, + 24, + 34, + 66, + 136, + 256 + ], + [ + 2, + 5, + 17, + 32, + 65, + 136, + 264 + ], + [ + 7, + 10, + 17, + 34, + 67, + 130, + 258 + ], + [ + 7, + 9, + 17, + 34, + 67, + 129, + 257 + ], + [ + 1, + 6, + 16, + 34, + 66, + 136, + 264 + ], + [ + 2, + 5, + 8, + 49, + 80, + 128, + 256 + ], + [ + 1, + 6, + 8, + 50, + 82, + 128, + 256 + ], + [ + 3, + 4, + 24, + 40, + 72, + 129, + 256 + ], + [ + 1, + 2, + 4, + 48, + 72, + 152, + 256 + ], + [ + 3, + 4, + 16, + 32, + 72, + 137, + 256 + ], + [ + 3, + 4, + 9, + 48, + 65, + 144, + 256 + ], + [ + 1, + 2, + 4, + 48, + 72, + 128, + 280 + ], + [ + 3, + 4, + 24, + 40, + 72, + 128, + 257 + ], + [ + 3, + 4, + 16, + 32, + 72, + 128, + 265 + ], + [ + 3, + 4, + 9, + 48, + 65, + 128, + 272 + ], + [ + 3, + 9, + 16, + 36, + 65, + 128, + 260 + ], + [ + 4, + 9, + 16, + 32, + 66, + 128, + 259 + ], + [ + 1, + 8, + 16, + 36, + 66, + 128, + 262 + ], + [ + 6, + 9, + 16, + 34, + 66, + 128, + 257 + ], + [ + 3, + 9, + 16, + 36, + 65, + 132, + 256 + ], + [ + 1, + 8, + 16, + 36, + 66, + 134, + 256 + ], + [ + 1, + 2, + 24, + 44, + 76, + 128, + 256 + ], + [ + 2, + 4, + 25, + 41, + 72, + 128, + 256 + ], + [ + 2, + 8, + 17, + 37, + 68, + 128, + 256 + ], + [ + 2, + 13, + 20, + 32, + 65, + 128, + 256 + ], + [ + 3, + 5, + 25, + 40, + 73, + 129, + 257 + ], + [ + 1, + 4, + 24, + 40, + 72, + 130, + 258 + ], + [ + 5, + 10, + 19, + 34, + 67, + 130, + 258 + ], + [ + 5, + 8, + 17, + 32, + 65, + 130, + 258 + ], + [ + 12, + 18, + 33, + 67, + 135, + 259 + ], + [ + 4, + 8, + 18, + 33, + 131, + 320 + ], + [ + 12, + 18, + 33, + 70, + 135, + 262 + ], + [ + 1, + 12, + 18, + 32, + 64, + 134, + 256 + ], + [ + 12, + 18, + 33, + 67, + 131, + 263 + ], + [ + 1, + 12, + 18, + 32, + 64, + 128, + 262 + ], + [ + 10, + 20, + 32, + 65, + 391 + ], + [ + 30, + 42, + 74, + 138, + 269 + ], + [ + 30, + 33, + 64, + 129, + 262 + ], + [ + 5, + 40, + 219, + 256 + ], + [ + 12, + 18, + 33, + 64, + 391 + ], + [ + 14, + 35, + 130, + 341 + ], + [ + 4, + 18, + 33, + 64, + 395 + ], + [ + 18, + 33, + 76, + 132, + 259 + ], + [ + 10, + 20, + 33, + 70, + 385 + ], + [ + 30, + 33, + 64, + 134, + 257 + ], + [ + 6, + 10, + 18, + 64, + 385 + ], + [ + 12, + 18, + 97, + 134, + 288 + ], + [ + 12, + 22, + 37, + 68, + 391 + ], + [ + 12, + 51, + 64, + 132, + 273 + ], + [ + 4, + 8, + 18, + 33, + 64, + 387 + ], + [ + 6, + 10, + 18, + 33, + 64, + 385 + ], + [ + 12, + 18, + 33, + 64, + 134, + 257 + ], + [ + 12, + 18, + 33, + 64, + 132, + 259 + ], + [ + 4, + 8, + 18, + 33, + 64, + 128, + 259 + ], + [ + 6, + 10, + 18, + 33, + 64, + 128, + 257 + ], + [ + 7, + 42, + 130, + 258 + ], + [ + 3, + 4, + 48, + 72, + 409 + ], + [ + 9, + 16, + 36, + 66, + 391 + ], + [ + 25, + 45, + 76, + 130, + 258 + ], + [ + 7, + 51, + 82, + 136, + 264 + ], + [ + 1, + 6, + 24, + 96, + 426 + ], + [ + 7, + 25, + 42, + 192, + 320 + ], + [ + 9, + 36, + 69, + 130, + 274 + ], + [ + 25, + 42, + 79, + 136, + 264 + ], + [ + 3, + 17, + 33, + 64, + 392 + ], + [ + 25, + 42, + 72, + 136, + 271 + ], + [ + 18, + 33, + 76, + 131, + 260 + ], + [ + 30, + 42, + 77, + 138, + 266 + ], + [ + 7, + 10, + 19, + 224, + 352 + ], + [ + 7, + 25, + 65, + 129, + 299 + ], + [ + 7, + 10, + 19, + 192, + 352 + ], + [ + 12, + 18, + 97, + 160, + 262 + ], + [ + 7, + 17, + 34, + 200, + 328 + ], + [ + 7, + 17, + 34, + 192, + 328 + ], + [ + 7, + 51, + 67, + 131, + 282 + ], + [ + 12, + 51, + 64, + 145, + 260 + ], + [ + 7, + 25, + 42, + 72, + 136, + 264 + ], + [ + 7, + 25, + 42, + 74, + 138, + 266 + ], + [ + 7, + 25, + 42, + 65, + 129, + 257 + ], + [ + 7, + 10, + 19, + 32, + 192, + 320 + ], + [ + 7, + 8, + 17, + 34, + 192, + 320 + ], + [ + 7, + 25, + 42, + 67, + 131, + 259 + ], + [ + 7, + 19, + 32, + 65, + 136, + 264 + ], + [ + 4, + 9, + 16, + 32, + 66, + 387 + ], + [ + 6, + 9, + 16, + 34, + 66, + 385 + ], + [ + 9, + 16, + 36, + 66, + 131, + 260 + ], + [ + 3, + 12, + 17, + 33, + 64, + 388 + ], + [ + 12, + 18, + 33, + 64, + 129, + 262 + ], + [ + 12, + 18, + 33, + 64, + 131, + 260 + ], + [ + 7, + 8, + 17, + 34, + 64, + 128, + 256 + ], + [ + 7, + 10, + 19, + 32, + 64, + 128, + 256 + ], + [ + 7, + 11, + 18, + 33, + 67, + 131, + 259 + ], + [ + 7, + 11, + 18, + 33, + 65, + 129, + 257 + ], + [ + 3, + 12, + 17, + 33, + 64, + 132, + 256 + ], + [ + 4, + 8, + 18, + 33, + 64, + 131, + 256 + ], + [ + 6, + 10, + 18, + 33, + 64, + 129, + 256 + ], + [ + 3, + 12, + 17, + 33, + 64, + 128, + 260 + ], + [ + 30, + 44, + 459 + ], + [ + 265, + 194, + 164, + 75 + ], + [ + 11, + 21, + 51, + 469 + ], + [ + 11, + 21, + 38, + 448 + ], + [ + 30, + 42, + 384 + ], + [ + 7, + 9, + 35, + 66, + 400 + ], + [ + 28, + 45, + 76, + 139, + 268 + ], + [ + 30, + 193, + 321 + ], + [ + 51, + 196, + 324 + ], + [ + 52, + 82, + 384 + ] + ], + "ports": [ + 11, + 19, + 35, + 131, + 259, + 13, + 21, + 37, + 69, + 133, + 261, + 41, + 73, + 265, + 49, + 81, + 145, + 273, + 161, + 193, + 321, + 385, + 14, + 22, + 38, + 70, + 134, + 262, + 26, + 74, + 138, + 50, + 146, + 274, + 98, + 290, + 194, + 322, + 386, + 28, + 44, + 140, + 268, + 84, + 148, + 276, + 100, + 164, + 292, + 196, + 324, + 388, + 56, + 88, + 152, + 280, + 168, + 296, + 200, + 328, + 392, + 112, + 176, + 304, + 208, + 336, + 400, + 224, + 352, + 416, + 508, + 506, + 502, + 494, + 478, + 446, + 382, + 254, + 505, + 501, + 493, + 477, + 445, + 381, + 253, + 499, + 475, + 443, + 379, + 251, + 487, + 471, + 439, + 375, + 247, + 463, + 431, + 367, + 239, + 415, + 351, + 223, + 319, + 191 + ], + "source_labels": [ + 0, + 1, + 2, + 3, + 4, + 5, + 6, + 7, + 8, + 9, + 10, + 11, + 12, + 13, + 14, + 15, + 16, + 17, + 18, + 19, + 20, + 21, + 22, + 23, + 24, + 25, + 26, + 27, + 28, + 29, + 30, + 31, + 32, + 33, + 34, + 35, + 36, + 37, + 38, + 39, + 40, + 41, + 42, + 43, + 44, + 45, + 46, + 47, + 48, + 49, + 50, + 51, + 52, + 53, + 54, + 55, + 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, + 104, + 105, + 106, + 107, + 108, + 109, + 110, + 111, + 112, + 113, + 114, + 115, + 116, + 117, + 118, + 119, + 120, + 121, + 122, + 123, + 124, + 125, + 126, + 127, + 128, + 129, + 130, + 131, + 132, + 133, + 134, + 135, + 136, + 137, + 138, + 139, + 140, + 141, + 142, + 143, + 144, + 145, + 146, + 147, + 148, + 149, + 150, + 151, + 152, + 153, + 154, + 155, + 156, + 157, + 158, + 159, + 160, + 161, + 162, + 163, + 164, + 165, + 166, + 167, + 168, + 169, + 170, + 171, + 172, + 173, + 174, + 175, + 176, + 177, + 178, + 179, + 180, + 181, + 182, + 183, + 184, + 185, + 186, + 187, + 188, + 189, + 190, + 191, + 192, + 193, + 194, + 195, + 196, + 197, + 198, + 199, + 200, + 201, + 202, + 203, + 204, + 205, + 206, + 207, + 208, + 209, + 210, + 211, + 212, + 213, + 214, + 215, + 216, + 217, + 218, + 219, + 220, + 221, + 222, + 223, + 224, + 225, + 226, + 227, + 228, + 229, + 230, + 231, + 232, + 233, + 234, + 235, + 236, + 237, + 238, + 240, + 241, + 242, + 243, + 244, + 245, + 246, + 247, + 248, + 249, + 250, + 251, + 252, + 253, + 254, + 255, + 256, + 257, + 258, + 260, + 261, + 262, + 263, + 265, + 266, + 267, + 268, + 269, + 270, + 271, + 272, + 273, + 274, + 275, + 276, + 277, + 278, + 279, + 280, + 281, + 282, + 283, + 284, + 285, + 286, + 287, + 288, + 289, + 290, + 291, + 292, + 293, + 294, + 295, + 296, + 297, + 298, + 299, + 300, + 301, + 302, + 303, + 304, + 305, + 306, + 307, + 309, + 311, + 312, + 313, + 314, + 315, + 316, + 317, + 318, + 319, + 320, + 321, + 322, + 323, + 325, + 328, + 329, + 330, + 331, + 332, + 333, + 334, + 335, + 336, + 337, + 338, + 339, + 340, + 341, + 342, + 343, + 344, + 345, + 346, + 347, + 349, + 350, + 351, + 352, + 353, + 354, + 355, + 356, + 357, + 358, + 359, + 360, + 361, + 362, + 363, + 364, + 365, + 366, + 367, + 368, + 369, + 370, + 371, + 372, + 373, + 374, + 375, + 376, + 377, + 378, + 379, + 380, + 381, + 382, + 383, + 384, + 385, + 387, + 388, + 389, + 390, + 391, + 392, + 393, + 394, + 395, + 396, + 397, + 398, + 399, + 400, + 401, + 402, + 403, + 404, + 405, + 407, + 408, + 409, + 410, + 411, + 413, + 414, + 415, + 416, + 417, + 418, + 419, + 420, + 421, + 422, + 423, + 424, + 425, + 426, + 427, + 428, + 429, + 430, + 431, + 432, + 433, + 434, + 435, + 436, + 437, + 438, + 439, + 440, + 441, + 442, + 443, + 444, + 445, + 446, + 447, + 448, + 449, + 450, + 451, + 452, + 453, + 455, + 456, + 458, + 459, + 460, + 461, + 462, + 463, + 464, + 465, + 466, + 467, + 468, + 469, + 470, + 471, + 472, + 473, + 474, + 475, + 476, + 477, + 478, + 479, + 480, + 481, + 482, + 483, + 484, + 485, + 486, + 487, + 488, + 489, + 490, + 491, + 492, + 493, + 494, + 495, + 496, + 497, + 498, + 499, + 500, + 501, + 502, + 503, + 504, + 505, + 506, + 507, + 508, + 509, + 510, + 511, + 512, + 513, + 514, + 515, + 516, + 517, + 518, + 519, + 520, + 521, + 522, + 523, + 524, + 525, + 526, + 527, + 528, + 529, + 530, + 531, + 532, + 533, + 534, + 535, + 536, + 537, + 538, + 539, + 540, + 541, + 542, + 543, + 544, + 545, + 546, + 547, + 548, + 549, + 550, + 551, + 552, + 553, + 554, + 555, + 556, + 557, + 558, + 560, + 561, + 562, + 563, + 564, + 565, + 566, + 567, + 568, + 569, + 570, + 571, + 572, + 573, + 574, + 575, + 576, + 577, + 578, + 579, + 580, + 581, + 582, + 583, + 584, + 585, + 586, + 587, + 588, + 589, + 590, + 591, + 592, + 593, + 594, + 595, + 596, + 597, + 598, + 599, + 600, + 601, + 602, + 603, + 604, + 605, + 606, + 607, + 608, + 609, + 610, + 611, + 612, + 613, + 614, + 615, + 616, + 617, + 618, + 619, + 620, + 621, + 622, + 623, + 624, + 625, + 626, + 627, + 628, + 629, + 630, + 631, + 632, + 633, + 634, + 635, + 636, + 637, + 638, + 639, + 640, + 641, + 642, + 643, + 644, + 645, + 646, + 647, + 648, + 649, + 650, + 653, + 654, + 655, + 656, + 657, + 658, + 659, + 660, + 661, + 662, + 663, + 664, + 665, + 666, + 667, + 668, + 669, + 670, + 671, + 672, + 673, + 674, + 675, + 676, + 677, + 678, + 679, + 680, + 681, + 682, + 683, + 684, + 685, + 686, + 687, + 688, + 689, + 690, + 691, + 692, + 693, + 694, + 695, + 697, + 698, + 699, + 700, + 701, + 702, + 703, + 704, + 705, + 706, + 707, + 708, + 709, + 710, + 711, + 712, + 713, + 714, + 715, + 716, + 717, + 718, + 719, + 720, + 721, + 722, + 723, + 724, + 725, + 726, + 727, + 728, + 729, + 730, + 731, + 732, + 733, + 734, + 735, + 736, + 737, + 738, + 739, + 740, + 741, + 742, + 743, + 744, + 745, + 746, + 747, + 748, + 749, + 750, + 751, + 752, + 753, + 754, + 755, + 756, + 757, + 758, + 759, + 760, + 761, + 762, + 763, + 764, + 765, + 766, + 767, + 768, + 769, + 770, + 771, + 772, + 773, + 774, + 775, + 776, + 777, + 778, + 779, + 780, + 781, + 782, + 783, + 784, + 785, + 786, + 787, + 788, + 789, + 790, + 791, + 792, + 793, + 794, + 795, + 796, + 797, + 798, + 799, + 800, + 801, + 802, + 803, + 804, + 805, + 806, + 807, + 808, + 809, + 810, + 811, + 812, + 813, + 814, + 815, + 816, + 817, + 818, + 819, + 820, + 821, + 822, + 823, + 824, + 825, + 826, + 827, + 828, + 829, + 830, + 832, + 833, + 834, + 835, + 836, + 837, + 838, + 839, + 840, + 841, + 842, + 843, + 844, + 845, + 846, + 847, + 848, + 849, + 850, + 851, + 852, + 853, + 854, + 855, + 856, + 857, + 858, + 859, + 860, + 861, + 862, + 863, + 864, + 865, + 866, + 867, + 868, + 869, + 870, + 871, + 872, + 873, + 874, + 875, + 876, + 877, + 878, + 879, + 880, + 881, + 882, + 883, + 884, + 885, + 886, + 887, + 888, + 889, + 890, + 891, + 892, + 893, + 894, + 895, + 896, + 897, + 898, + 899, + 900, + 901, + 902, + 903, + 904, + 905, + 906, + 907, + 908, + 909, + 910, + 911, + 912, + 913, + 914, + 915, + 916, + 917, + 918, + 919, + 920, + 921, + 922, + 923, + 924, + 925, + 926, + 927, + 928, + 929, + 930, + 931, + 932, + 933, + 934, + 935, + 936, + 937, + 938, + 939, + 940, + 941, + 942, + 943, + 944, + 945, + 946, + 947, + 948, + 949, + 950, + 951, + 952, + 953, + 954, + 955, + 956, + 957, + 958, + 959, + 960, + 961, + 962, + 963, + 964, + 965, + 966, + 967, + 968, + 969, + 970, + 971, + 972, + 973, + 974, + 975, + 976, + 977, + 978, + 979, + 980, + 981, + 982, + 983, + 984, + 985, + 986, + 987, + 988, + 989, + 990, + 991, + 992, + 993, + 994, + 995, + 996, + 997, + 998, + 999, + 1000, + 1001, + 1002, + 1003, + 1004, + 1005, + 1006, + 1007, + 1008, + 1009, + 1010, + 1011, + 1012, + 1013, + 1014, + 1015, + 1016, + 1017, + 1018, + 1019, + 1020, + 1021, + 1022, + 1023, + 1024, + 1025, + 1026, + 1027, + 1028, + 1029, + 1030, + 1031, + 1032, + 1033, + 1034, + 1035, + 1036, + 1037, + 1038, + 1039, + 1040, + 1041, + 1042, + 1043, + 1044, + 1045, + 1046, + 1047, + 1048, + 1049, + 1050, + 1051, + 1052, + 1053, + 1054, + 1055, + 1056, + 1057, + 1058, + 1059, + 1060, + 1061, + 1062, + 1063, + 1064, + 1065, + 1066, + 1067, + 1068, + 1069, + 1070, + 1071, + 1072, + 1073, + 1074, + 1075, + 1076, + 1077, + 1078, + 1079, + 1080, + 1081, + 1082, + 1083, + 1084, + 1085, + 1086, + 1087, + 1088, + 1089, + 1090, + 1091, + 1092, + 1093, + 1094, + 1095, + 1096, + 1097, + 1098, + 1099, + 1100, + 1101, + 1102, + 1103, + 1104, + 1105, + 1106, + 1107, + 1108, + 1109, + 1110, + 1111, + 1112, + 1113, + 1114, + 1115, + 1116, + 1117, + 1118, + 1119, + 1120, + 1121, + 1122, + 1123, + 1124, + 1125, + 1126, + 1127, + 1128, + 1129, + 1130, + 1131, + 1132, + 1133, + 1134, + 1135, + 1136, + 1137, + 1138, + 1139, + 1140, + 1141, + 1142, + 1143, + 1144, + 1145, + 1146, + 1147, + 1148, + 1149, + 1150, + 1151, + 1152, + 1153, + 1154, + 1155, + 1156, + 1157, + 1158, + 1159, + 1160, + 1161, + 1162, + 1163, + 1164, + 1165, + 1166, + 1167, + 1168, + 1169, + 1170, + 1171, + 1172, + 1173, + 1174, + 1175, + 1176, + 1177, + 1178, + 1179, + 1180, + 1181, + 1182, + 1183, + 1184, + 1185, + 1186, + 1187, + 1188, + 1189, + 1190, + 1191, + 1192, + 1193, + 1194, + 1195, + 1196, + 1197, + 1198, + 1199, + 1200, + 1201, + 1202, + 1203, + 1204, + 1205, + 1206, + 1207, + 1208, + 1209, + 1210, + 1211, + 1212, + 1213, + 1214, + 1215, + 1216, + 1217, + 1218, + 1219, + 1220, + 1221, + 1222, + 1223, + 1224, + 1225, + 1226, + 1227, + 1228, + 1229, + 1230, + 1231, + 1232, + 1233, + 1234, + 1235, + 1236, + 1237, + 1238, + 1239, + 1240, + 1241, + 1242, + 1243, + 1244, + 1245, + 1246, + 1247, + 1248, + 1249, + 1250, + 1251, + 1252, + 1253, + 1254, + 1255, + 1256, + 1257, + 1258, + 1259, + 1260, + 1261, + 1262, + 1263, + 1264, + 1265, + 1266, + 1267, + 1268, + 1269, + 1270, + 1271, + 1272, + 1273, + 1274, + 1275, + 1276, + 1277, + 1278, + 1279, + 1280, + 1281, + 1282, + 1283, + 1284, + 1285, + 1286, + 1287, + 1288, + 1289, + 1290, + 1291, + 1292, + 1293, + 1294, + 1295, + 1296, + 1297, + 1298, + 1299, + 1300, + 1301, + 1302, + 1303, + 1304, + 1305, + 1306, + 1307, + 1308, + 1309, + 1310, + 1311, + 1312, + 1313, + 1314, + 1315, + 1316, + 1317, + 1318, + 1319, + 1320, + 1321, + 1322, + 1323, + 1324, + 1325, + 1326, + 1327, + 1328, + 1329, + 1330, + 1331, + 1332, + 1333, + 1334, + 1335, + 1336, + 1337, + 1338, + 1339, + 1340, + 1341, + 1342, + 1343, + 1344, + 1345, + 1346, + 1347, + 1348, + 1349, + 1350, + 1351, + 1352, + 1353, + 1354, + 1355, + 1356, + 1357, + 1358, + 1359, + 1362, + 1363, + 1364, + 1365, + 1366, + 1367, + 1368, + 1369, + 1370, + 1371, + 1372, + 1373, + 1374, + 1375, + 1376, + 1377, + 1378, + 1379, + 1380, + 1381, + 1382, + 1383, + 1384, + 1385, + 1386, + 1387, + 1388, + 1389, + 1390, + 1391, + 1392, + 1393, + 1394, + 1396, + 1397, + 1400, + 1401, + 1403, + 1406, + 1408, + 1409, + 1411, + 1412, + 1413, + 1414, + 1415, + 1416, + 1417, + 1418, + 1419, + 1420, + 1421, + 1422, + 1423, + 1424, + 1425, + 1426, + 1427, + 1428, + 1429, + 1430, + 1431, + 1432, + 1437, + 1438, + 1439, + 1440, + 1441, + 1442, + 1443, + 1444, + 1445, + 1446, + 1447, + 1448, + 1449, + 1450, + 1451, + 1452, + 1453, + 1454, + 1455, + 1456, + 1457, + 1458, + 1459, + 1460, + 1461, + 1462, + 1463, + 1464, + 1465, + 1466, + 1467, + 1468, + 1469, + 1470, + 1471, + 1472, + 1473, + 1474, + 1475, + 1476, + 1477, + 1478, + 1479, + 1480, + 1481, + 1482, + 1483, + 1484, + 1485, + 1486, + 1487, + 1488, + 1489, + 1490, + 1491, + 1492, + 1493, + 1494, + 1495, + 1496, + 1497, + 1498, + 1499, + 1500, + 1501, + 1503 + ] +} diff --git a/research/quotient-split-minimal-odd-scale/source/results/application.json b/research/quotient-split-minimal-odd-scale/source/results/application.json new file mode 100644 index 0000000000..197c3a8a09 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/source/results/application.json @@ -0,0 +1,662 @@ +{ + "claim": "0.00376313686053", + "probe": "0.00376313686060", + "bracket": [ + "0.00376313686061", + "0.00376313686062" + ], + "previous_upper": "0.00376154487712", + "gain_over_previous_upper": "159198341/100000000000000", + "graph_sha256": "5183479ecac34a1cb5c046f202e19d7161679265fe121b4a0af922fe344d8fc1", + "stages": [ + [ + 1, + 400, + 1070 + ], + [ + 2, + 400, + 1070 + ], + [ + 3, + 400, + 1070 + ], + [ + 4, + 400, + 1070 + ], + [ + 5, + 400, + 1070 + ], + [ + 6, + 400, + 1070 + ], + [ + 7, + 400, + 1070 + ], + [ + 8, + 400, + 1070 + ], + [ + 9, + 400, + 1070 + ], + [ + 10, + 400, + 1070 + ], + [ + 11, + 400, + 1070 + ], + [ + 12, + 400, + 1070 + ], + [ + 13, + 400, + 1070 + ], + [ + 14, + 400, + 1070 + ], + [ + 15, + 400, + 1070 + ], + [ + 16, + 400, + 1070 + ] + ], + "owner_alias_rejected": true, + "caller": { + "fixed_caller_paid": { + "8": 640, + "9": 32, + "56": 416, + "48": 416, + "40": 416, + "32": 416, + "24": 416, + "16": 416, + "1": 384 + }, + "fixed_root_targets": { + "129": 208, + "65": 416, + "57": 416, + "49": 416, + "41": 416, + "33": 416, + "25": 416, + "17": 416, + "9": 416 + }, + "uses": { + "ADD": 92400, + "SCALE": 11728, + "IDLE_ONE": 3136, + "LAMBDA": 10672, + "IDLE_ODD": 32, + "SWAP": 240, + "QUERY": 384 + }, + "calls": 16, + "roles": 68, + "root_owners": 3536, + "dyadic_height": 9, + "odd_scale": 2025, + "peak_scaled_mass": "495734175/2", + "peak_witness": [ + 1196, + "stored sum" + ], + "exact_preproduct_divisions": 153295 + }, + "paid": 100416, + "productive": 20656, + "invoice": { + "schema": "integer-mult-recursive-invoice/v1", + "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": 63328, + "2": 13552, + "3": 9024, + "4": 3568, + "5": 5904, + "6": 1536, + "7": 160, + "8": 752, + "9": 96, + "16": 416, + "24": 416, + "32": 416, + "40": 416, + "48": 416, + "56": 416 + }, + "targets": { + "1": 304, + "2": 336, + "3": 752, + "4": 3616, + "5": 1184, + "6": 400, + "7": 256, + "8": 528, + "9": 10160, + "17": 416, + "25": 416, + "33": 416, + "41": 416, + "49": 416, + "57": 416, + "65": 416, + "129": 208 + } + }, + "comparison": { + "schema": "integer-mult-recursive-invoice-comparison/v1", + "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": {}, + "delta_targets": { + "1": 16, + "4": 16, + "5": 16, + "8": 16, + "9": -32 + }, + "signed_net_delta": { + "1": -16, + "4": -16, + "5": -16, + "8": -16, + "9": 32 + }, + "hinges": [ + { + "rank": 0, + "value": 0 + }, + { + "rank": 1, + "value": -32 + }, + { + "rank": 4, + "value": -80 + }, + { + "rank": 5, + "value": -80 + }, + { + "rank": 8, + "value": -32 + }, + { + "rank": 9, + "value": 0 + } + ], + "rank_mass": { + "old": { + "paid": 268368, + "targets": 269696, + "paid_minus_targets": -1328 + }, + "new": { + "paid": 268368, + "targets": 269696, + "paid_minus_targets": -1328 + }, + "delta": { + "paid": 0, + "targets": 0, + "paid_minus_targets": 0 + } + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "tariff_class": "increasing concave f on nonnegative ranks, with f(0)=0", + "uniform_order": "weak; some concave tariffs can give equality", + "power_moment": { + "tariff": "r^t", + "exponent": "0 < t < 1", + "new_minus_old_sign": "strictly_negative" + }, + "assurance": { + "contract": "Exact matching user declarations; mathematical applicability is not verified.", + "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.", + "inconclusive": "Mixed hinge signs do not establish a power-moment crossing or failure." + }, + "method_credit": "Classical concave order/majorization; mightyOil's t16-moment-order-audit and its retained predecessors. No new theorem claim." + }, + "powers": [ + { + "graph": "parent", + "kappa": "0.00376154487712", + "paid_minus_productive": { + "lower": "23790951429644132432384771249536720596097410269015464642295605017809/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "11895475714822066216192385624768360298048705134507732321147806445843/3618502788666131106986593281521497120414687020801267626233049500247285301248" + } + }, + { + "graph": "candidate", + "kappa": "0.00376154487712", + "paid_minus_productive": { + "lower": "-2017236434193873650985584391338189761824009530847244098431260572729477644953/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "-4034472868387747301971168782676379523648019061694488196862521145458947424359/7237005577332262213973186563042994240829374041602535252466099000494570602496" + } + }, + { + "graph": "candidate", + "kappa": "0.00376313686053", + "paid_minus_productive": { + "lower": "-207542879684415947245599103135760542034904404612128611395239845978385/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "-1621428747534499587856242993248129234647690661032254776525311244531/56539106072908298546665520023773392506479484700019806659891398441363832832" + } + }, + { + "graph": "candidate", + "kappa": "0.00376313686060", + "paid_minus_productive": { + "lower": "-15073228127183160486989542033465530395749927754763834164794178190015/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "-15073228127183160486989542033465530395749927754763834164794174531331/3618502788666131106986593281521497120414687020801267626233049500247285301248" + } + }, + { + "graph": "candidate", + "kappa": "0.00376313686061", + "paid_minus_productive": { + "lower": "-4804110050077680095326468320601703804309777403442510524505347802565/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "-600513756259710011915808540075212975538722175430313815563167633745/904625697166532776746648320380374280103671755200316906558262375061821325312" + } + }, + { + "graph": "candidate", + "kappa": "0.00376313686062", + "paid_minus_productive": { + "lower": "20538236154209920064717157952839541301037251126476494157232824160121/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "20538236154209920064717157952839541301037251126476494157232830247213/7237005577332262213973186563042994240829374041602535252466099000494570602496" + } + } + ], + "compiler": { + "claim": "376313686053/100000000000000", + "tested": "18815684303/5000000000000", + "raw_bracket": [ + "376313686061/100000000000000", + "188156843031/50000000000000" + ], + "moment_margins": { + "376313686061/100000000000000": [ + "2074455207484702926030112137700139910023177074797145346620054202804213/3125000000000000000000000000000000000000000000000000000000000000000000000000000", + "4148910414969405852060224275400279820046354149594290693240108407808079/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "188156843031/50000000000000": [ + "-8868583462604578427582733417494336221187339122320071674345030899756089/3125000000000000000000000000000000000000000000000000000000000000000000000000000", + "-17737166925209156855165466834988672442374678244640143348690061797302833/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "18815684303/5000000000000": [ + "26034987755148867341418481037425381630793778515043517569472138750598191/6250000000000000000000000000000000000000000000000000000000000000000000000000000", + "26034987755148867341418481037425381630793778515043517569472138752812859/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ] + }, + "moment_margin_float": { + "376313686061/100000000000000": [ + 6.638256663951049e-10, + 6.638256663951049e-10 + ], + "188156843031/50000000000000": [ + -2.837946708033465e-09, + -2.837946708033465e-09 + ], + "18815684303/5000000000000": [ + 4.165598040823819e-09, + 4.165598040823819e-09 + ] + }, + "derivative_upper": -345126.2373073017, + "alpha": [ + 0.9999999999999843, + 0.9999999999999843 + ], + "gamma": [ + 0.9350934678096133, + 0.9350934678096133 + ], + "delta": [ + 0.9214681586687725, + 0.9214681586687725 + ], + "minimum_log_power": 2309, + "written_log_power": 2310, + "compiler_gap": "1/100000000000000", + "H": "14708600000000000000", + "BIT_pin": "376669/100000000", + "BIT_margin": "17765697/5000000000000", + "outer": { + "strict_count": 54, + "functional_count": 4, + "minimum_margin": "1/1000000000000000", + "BIT_just_below_effective_rejected": true + }, + "input_lift": { + "margins": { + "376313686053/100000000000000": [ + "128212819437215132785375491472764766869508245223834092678152280014785772545853/100000000000000000000000000000000000000000000000000000000000000000000000000000000", + "128212819437215132785375491472764766869508245223834092678152280014785772547813/100000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "18815684303/5000000000000": [ + "64106409719747457611963813428072613555135046186112831880468485065975180592871/50000000000000000000000000000000000000000000000000000000000000000000000000000000", + "1001662651871054025186934584813634586798985096658012998132320079155862196779/781250000000000000000000000000000000000000000000000000000000000000000000000000" + ] + }, + "interval_kappa_cap": "376669/100000000", + "derivative_upper_on_required_interval": "-2299831290525933154178526076272396899996972093654613095735772838275432653960006518819/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + "source_BIT_wide_crude_bound_would_be": "-2299831290525933154178526076272396899996972093654613095735772838275432653960006518819/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000" + } + }, + "conditional_interfaces": [ + "native_all_columns", + "owned_erasure", + "compiler", + "precision_tape", + "analytic_recovery" + ], + "physical": { + "native": { + "public": 1470, + "slots": 6054, + "terms": 178845, + "path_grid": 2184944025600, + "path_grid_odd": 2083725, + "path_grid_height": 20, + "positive_path_mass_bound_unscaled": "164863744927/4608", + "positive_path_mass_peak_node": 156119, + "paid_native_ranks": { + "1": 3934, + "2": 847, + "4": 223, + "3": 564, + "5": 369, + "6": 96, + "9": 4, + "7": 10, + "8": 7 + }, + "positive_helper_ranks": { + "9": 609, + "2": 21, + "4": 226, + "8": 33, + "7": 16, + "3": 47, + "1": 19, + "6": 25, + "5": 74 + }, + "coefficient_products": 9966426, + "checked_nontrivial_divisions": 5312755, + "checked_nontrivial_divisions_by_denominator": { + "3": 71276, + "4": 1775911, + "12": 4443, + "2": 2530408, + "8": 439428, + "21": 15307, + "256": 22, + "16": 144485, + "32": 45118, + "64": 20651, + "128": 732, + "10": 6742, + "5": 50696, + "20": 15512, + "7": 102347, + "96": 172, + "48": 439, + "24": 6804, + "384": 6, + "6": 25853, + "192": 58, + "14": 29488, + "9": 17, + "40": 660, + "28": 14857, + "56": 6793, + "63": 394, + "42": 1203, + "112": 2124, + "224": 809 + }, + "exact_all_public_rows": 1470, + "minimum_product_grid": 90316800, + "minimum_snapshot_grid": 322560, + "maximum_exact_row_prefix_mass_scaled": "465156710107425/256", + "missing_odd_factor_controls": { + "3": { + "row": 88440, + "donor": -1325, + "entrance_column": 1324, + "coefficient": "2/3", + "removed_factor": 243, + "numerator_without_factor": 17983078400, + "denominator": 3, + "positive_remainder": 2 + }, + "5": { + "row": 88808, + "donor": -1301, + "entrance_column": 1300, + "coefficient": "1/10", + "removed_factor": 25, + "numerator_without_factor": 87397761024, + "denominator": 10, + "positive_remainder": 4 + } + }, + "numerical_homes": 8999, + "guarded_dummy_slots": 1, + "separate_guide_tracks": 1, + "max_outstanding_native_senders": 1, + "declared_senders": 1, + "immutable_entry_banks": 1470, + "immutable_paid_return_banks": 6054, + "deferred_terminal_banks": 1470, + "native_scalar_scratch_homes": 4, + "additional_independent_guarded_streams": 4, + "trace_sha256": "7c0449f16fe3dfcfd78b14f3e7a58c43ea119241d522acc4f9b7e3cfc164b38e", + "selected_logical_operations": { + "initialize_complete_dirty_home": 8999, + "write_entrance": 1470, + "read_immutable_donor": 178845, + "initialize_empty_sender_before_departure": 6054, + "stage_full_sender": 6054, + "read_parked_sender": 6054, + "write_complete_return": 6054, + "clear_full_sender_after_return": 6054, + "write_terminal": 1470, + "read_terminal_for_same_owner_install": 1470, + "retire_complete_home": 8999 + }, + "fixture_addressed_cells_per_home": 4, + "fixture_addressed_cells_overwritten": { + "initialize_complete_dirty_home": 35996, + "initialize_empty_sender_before_departure": 24216, + "clear_full_sender_after_return": 24216, + "retire_complete_home": 35996 + }, + "tracked_stream_reset_visits": 544059, + "same_owner_complete_fixture_outputs": 1470, + "exact_odd_unscale_outputs": 1470, + "retired_and_guards_restored": true, + "live_sender_alias_control_rejected": true, + "all_public_inputs_preserved_until_final_installs": true + }, + "caller_envelope": { + "records": 4192, + "stages": 16, + "uses": { + "ADD": 92400, + "SCALE": 11728, + "IDLE_ONE": 3136, + "LAMBDA": 10672, + "IDLE_ODD": 32, + "SWAP": 240, + "QUERY": 384 + }, + "binary_height_at_all_completed_cuts_and_products": 325, + "binary_height_at_native_entrances": 318, + "scaled_mass_at_all_cuts_and_products": "422697641667541055184649383436611894902745135854144098178147008285122975926924780864462653005878076090749928607858304935653611344748944586891405006118422035825340979484130265226717/787320000000000", + "scaled_mass_at_native_entrances": "841540548201148271304709423731170105326708333407364819898222426096105903810343041288214438457604474421941928920227707368470121101079538458948446020268383922323667853993448395617/100776960000000", + "normalized_bound_uses_no_cancellation_or_commutation": true + }, + "common_root": { + "caller_odd": 2025, + "native_odd": { + "candidate": 2083725 + }, + "native_binary": { + "candidate": 20 + }, + "context_mass_bound": "47587657515536117050088106519258994580293747171033193792670305801720492655022147042355197832891493877471654969938199350475235561468207852602392400007694405834999596668034956636079496165240937/76441190400000", + "context_mass_bits": 588, + "context_binary_bits": 338, + "context_c": 1176, + "H_guard": "bit_length(context_c*1920*153**1920*(H+1)**2) < H for each actual compiler bound H", + "exact_grid": "2^(-p-D)", + "signed_width": "W=p+h+2D+3", + "temporary_width": "W+26" + }, + "depth_guard": { + "compiler_H": 14708600000000000000, + "argument_bit_length": 14083, + "strict_guard_passed": true + }, + "ordinary": { + "native_numeric_homes": 8999, + "native_numeric_homes_plus_dummy": 9000, + "raw_numeric_homes": 143984, + "raw_numeric_homes_plus_dummy": 144000, + "separate_guarded_guide_tracks_per_native": 1, + "separate_guarded_guide_tracks_raw": 16, + "separate_guarded_streams_per_native": 4, + "separate_guarded_streams_raw": 64, + "odd_conversions": 54112, + "reset_services_per_native": 1526938, + "typed_selected_transfers_per_native": 414942, + "reset_services_by_kind_per_native": { + "dirty_home_initializations_and_retirements": 17998, + "term_and_row_stream_initializations_and_retirements": 1490952, + "owner_scale_unscale_stream_initializations_and_retirements": 5880, + "sender_reinitializations_and_retirements": 12108 + }, + "typed_transfer_legs_by_kind_per_native": { + "complete_scalar_donor_staging_legs": 357690, + "complete_sender_and_terminal_staging_legs": 15048, + "paid_parked_sender_return_and_adapter_legs": 36324, + "immutable_entrance_and_public_terminal_install_legs": 5880 + }, + "reset_services_all_native_stages": 24431008, + "typed_selected_transfer_legs_all_native_stages": 6639072, + "selector_steps_per_selected_service_L_and_constant": [ + 125995, + 567325 + ], + "additional_full_overwrite_steps_per_reset_L_and_constant": [ + 2, + 3 + ], + "selected_total_steps_per_native_L_and_constant": [ + 244723337052, + 1101814433254 + ], + "selected_total_steps_raw_L_and_constant": [ + 3915573392832, + 17629030932064 + ], + "scalar_services": 124816384, + "scalar_step_rate": 536870912, + "raw_scalar_incidence_allowance_before_factor_32": { + "literal_native_products_and_accumulations": 2861520, + "width_padded_native_row_lifecycles": 481536, + "public_boundary_installations_and_scale_preparations": 47040, + "private_home_flags_and_cleanup": 143984, + "serial_sender_initialization_and_retirement": 193728, + "weighted_signed_caller_operation_slots": 118592, + "complete_array_odd_conversions": 54112 + }, + "ordinary_map_slots": 276672, + "ordinary_elementary_record_upper": 26246212608, + "raw_paid_positions": 100416, + "raw_productive_targets": 20656, + "root_negative_q_translations": 3536, + "native_paid_wrappers": 96864, + "native_productive_wrappers": 17120, + "ordinary_main_pair_slots": 6400, + "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": { + "padded_payload": "L'=N_c(2(W+26)+3)", + "per_stage_selector_and_stream_tracks": 11, + "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", + "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]", + "shadow_cells_upper": "M+352", + "complete_view_step_bound": "34*(256(M+352)+128) plus fixed-degree descriptor work" + } + }, + "scalars": { + "distinct_scalar_and_conversion_factors": 796, + "signed_bit_transducer_cases": 4776, + "coefficient_bits": 21, + "rejected_one_tick_denominators": [ + 2, + 3, + 5, + 7 + ], + "retained_max_bits": 24, + "component_padding": 26 + }, + "missing_seven_rejected": true, + "partial_clear_control": { + "dirty_unaddressed_last_cell_rejected": true, + "neighbor_unchanged": true + } + } +} diff --git a/research/quotient-split-minimal-odd-scale/source/vendor/caller16.py b/research/quotient-split-minimal-odd-scale/source/vendor/caller16.py new file mode 100644 index 0000000000..2865530b78 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/source/vendor/caller16.py @@ -0,0 +1,182 @@ +"""Exact signed caller replay, adapted from Ali Romman's #7663 caller.py. + +See SOURCE-PINS.json for Rohan Arun's literal #7113-derived caller and +the attributed reference engines. Apache-2.0. +""" + +from collections import Counter +from fractions import Fraction +from functools import cache + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def exact_div(numerator, denominator): + quotient, remainder = divmod(numerator, denominator) + require(remainder == 0, "inexact caller pre-product") + return quotient + + +def literal_layout(caller, word): + stages = caller["stages"] + require(stages == 16 and caller["ambient_rank"] == 9 + 8 * stages == 137, + "literal 16-call, 137-axis layout") + require(len(caller["events"]) == 4192, "literal caller event count") + types = caller["types"] + require(set(types) == {"A", "B"}, "literal type partition") + require(all(spec["roles"] == 34 for spec in types.values()), "literal 34+34 roles") + require(types["A"]["ports"] == word["hosted"]["Dports"], "hosted port assignment") + require((len(types["A"]["ports"]), len(types["B"]["ports"])) == (96, 8), + "literal 96+8 ports") + require(sorted(types["A"]["ports"] + types["B"]["ports"]) == list(range(104)), + "disjoint complete 104-port assignment") + role_sets = { + kind: set(range(spec["offset"], spec["offset"] + spec["roles"])) + for kind, spec in types.items() + } + require(role_sets["A"].isdisjoint(role_sets["B"]) + and role_sets["A"] | role_sets["B"] == set(range(caller["roles"])), + "disjoint complete root role ranges") + h = word["hosted"] + coefficients = tuple(Fraction(h[k]) for k in ("alpha", "beta", "alpha2", "beta2")) + require(coefficients == (-1, Fraction(1, 2), -1, 0), "joint normalized source coefficients") + require(Fraction(types["A"]["alpha2"]) == coefficients[2], "A second-plane coefficient") + return stages, types, role_sets + + +def signed_caller(caller, word, odd_scale, dyadic_height): + stages, types, role_sets = literal_layout(caller, word) + unit = odd_scale << dyadic_height + zero = (0,) * stages + rows = [{(r, 0, zero): (unit, 0)} for r in range(caller["roles"])] + paid = Counter() + targets = Counter() + uses = Counter() + calls = [] + checks = 0 + peak = unit + peak_at = (-1, "entrance") + clock = -1 + + def observe(row, site): + nonlocal peak, peak_at + mass = sum(abs(real) + abs(imag) for real, imag in row.values()) + if mass > peak: + peak, peak_at = mass, (clock, site) + + @cache + def shifted(exponents, shift): + result = list(exponents) + for stage in shift: + result[stage - 1] += 1 + return tuple(result) + + def term(row, ar=1, ai=0, denominator=1, phase=0, shift=()): + nonlocal checks + out = {} + for (role, q, powers), (x, y) in row.items(): + real, imag = ar * x - ai * y, ar * y + ai * x + if denominator != 1: + real, imag = exact_div(real, denominator), exact_div(imag, denominator) + checks += 1 + if real or imag: + key = (role, (q + phase) % 4, shifted(powers, shift) if shift else powers) + out[key] = (real, imag) + observe(out, "scaled separate term") + return out + + def add(a, b): + out = a.copy() + for key, (u, v) in b.items(): + x, y = out.get(key, (0, 0)) + if x + u or y + v: + out[key] = (x + u, y + v) + else: + out.pop(key, None) + observe(out, "stored sum") + return out + + for clock, event in enumerate(caller["events"]): + kind = event[0] + if kind == "J": + _, stage, (x, y, u, v), (a, b, alpha, beta) = event + require(stage == len(calls) + 1, "chronological joint occurrences") + require(Fraction(alpha) == -1 and Fraction(beta) == Fraction(1, 2), + "literal joint coefficients") + require(len({x, y, u, v}) == 4 and {x, y, u, v} <= role_sets["A"] + and a != b and {a, b} <= role_sets["B"], "joint owner alias") + calls.append(stage) + rows[y] = add(rows[y], term(rows[x], phase=-1)) + rows[u] = add(rows[u], term(rows[v], -1, phase=1)) + first, second = rows[a], rows[b] + rows[a] = add(first, term(second, -1, phase=1)) + rows[b] = add(term(second, denominator=2), + term(first, denominator=2, phase=-1)) + for role in (x, y, u, v, a, b): + rows[role] = term(rows[role], shift=(stage,)) + continue + + _, op, role, *args = event + require(kind in role_sets and role in role_sets[kind], "caller target owner") + replicas = len(types[kind]["ports"]) + uses[op] += replicas + if op in {"ADD", "SWAP", "QUERY"}: + require(args[0] in role_sets[kind] and args[0] != role, "caller donor owner") + if op == "SWAP": + other, = args + rows[role], rows[other] = rows[other], rows[role] + elif op == "QUERY": + donor, sign = args + require(sign in (-1, 1), "caller query orientation") + rows[role] = add(rows[role], term(rows[donor], phase=sign)) + paid[1] += replicas + elif op in {"ADD", "SCALE"}: + factor = Fraction(args[-1]) + donor = args[0] if op == "ADD" else role + contribution = term(rows[donor], factor.numerator, denominator=factor.denominator) + rows[role] = add(rows[role], contribution) if op == "ADD" else contribution + elif op == "LAMBDA": + sign, = args + require(sign in (-1, 1), "caller LAMBDA sign") + old = rows[role] + rows[role] = add(term(old, 1, sign, 2), term(old, 1, -sign, 2, phase=2)) + else: + require(op in {"IDLE_ONE", "IDLE_ODD"}, "known caller operation") + block = tuple(args[0]) + require(block and len(block) == len(set(block)) + and all(1 <= k <= stages for k in block), "whole idle stage subset") + if op == "IDLE_ODD": + require(len(args) == 2 and len(block) == 1 and args[1] == -1, + "literal signed rank-nine child") + else: + require(len(args) == 1, "literal unit idle") + phase = args[1] if op == "IDLE_ODD" else 0 + rows[role] = term(rows[role], phase=phase, shift=block) + paid[8 * len(block) + phase % 2] += replicas + + require(calls == list(range(1, stages + 1)), "all 16 native invocations") + for spec in types.values(): + require(len(spec["diagonal"]) == spec["roles"], "complete diagonal") + for off, (phase, coefficient_phase, *powers) in enumerate(spec["diagonal"]): + role = spec["offset"] + off + require(phase in (-1, 0, 1) and coefficient_phase == 0 and len(powers) == stages + and set(powers) <= {0, 1} and any(powers), "positive whole root target") + require(rows[role] == {(role, phase % 4, tuple(powers)): (unit, 0)}, + "exact signed root endpoint") + targets[8 * sum(powers) + phase % 2] += len(spec["ports"]) + return { + "fixed_caller_paid": dict(paid), + "fixed_root_targets": dict(targets), + "uses": dict(uses), + "calls": stages, + "roles": len(rows), + "root_owners": sum(targets.values()), + "dyadic_height": dyadic_height, + "odd_scale": odd_scale, + "peak_scaled_mass": str(Fraction(peak, 1 << dyadic_height)), + "peak_witness": peak_at, + "exact_preproduct_divisions": checks, + } diff --git a/research/quotient-split-minimal-odd-scale/source/vendor/physical.py b/research/quotient-split-minimal-odd-scale/source/vendor/physical.py new file mode 100644 index 0000000000..e7c4e5798b --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/source/vendor/physical.py @@ -0,0 +1,868 @@ +#!/usr/bin/env python3 +# SPDX-License-Identifier: Apache-2.0 +"""Exact grids and occupied bank schedules for the cf6a banked relay. + +Adapt the guarded bank and exact-root accounting of #7697, based on #7682. +The graph folds the supplied #7700 tape and contracts its role-1256 relay. +""" + +from argparse import ArgumentParser +from collections import Counter +from fractions import Fraction +import gzip +from hashlib import sha256 +import importlib.util +import json +from math import gcd, lcm +from pathlib import Path + + +HERE = Path(__file__).resolve().parent +PEER = "72705b094d83d2ba24006661bbb031786a691b776bedb94515b1321e1535105f" +CANDIDATE = "8e7b755bd2d2d387bc3d3adfe48100985adf74775ca5acbb143170a3d16b5ccf" +SOURCE_WORD = "ae62d5d8bef6f7146454b4b3643e487a58380c606a16c5baef7bf0dcf9df1472" +SOURCE_HEAD = "7d84799a447867d36137d12ef7ca5646154d763c" +SOURCE_CERTS = "39ef28b708cd8bf1166b111d656809407b370dd11cd81a8e43820779f995aca3" +CALLER = "62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf" +CALLER_REPLAY = "ced48867f07ca0143604aa98cfd74fa7453696b9d3221f7c230d73e9ab9ba81f" +STAGES = 16 +CALLER_ODD = 2025 +COMPILER_H = 14571800000000000000 +AMBIENT_CAP = 153 +PROTECTED_HELPERS = (325, 1087) +OLD_NATIVE_STOCK = 15290 +REMOVED, SURVIVOR = 95828, 104442 +RELAY_ROLE = 1256 +RELAY_CHARTS = (476, 878, 127) +PAYLOAD_AXES = 4 + + +def require(condition, reason): + if not condition: + raise ValueError(reason) + + +def encoded(data): + return json.dumps(data, sort_keys=True, separators=(",", ":")).encode() + + +def load_gzip(path, pin, *, canonical=True): + packed = path.read_bytes() + raw = gzip.decompress(packed) + require(sha256(raw).hexdigest() == pin, f"wrong decoded hash for {path.name}") + data = json.loads(raw) + require(not canonical or encoded(data) == raw, f"noncanonical data for {path.name}") + return data, sha256(packed).hexdigest() + + +def chart_span(basis): + span = {0} + for axis in basis: + require(type(axis) is int and 0 < axis < 512 and axis not in span, + "invalid independent ordered chart basis") + span |= {axis ^ vector for vector in span} + return span + + +def exact_coefficient(text): + value = Fraction(text) + require(value and str(value) == text, "noncanonical or zero scalar incidence") + return value + + +def exact_div(value, denominator): + result, remainder = divmod(value, denominator) + require(remainder == 0, "nonintegral scalar pre-product") + return result + + +def grid_parts(grid): + height = (grid & -grid).bit_length() - 1 + return grid >> height, height + + +def ceiling_bits(value): + return (-(-value.numerator // value.denominator)).bit_length() + + +def public_interface(graph, layout): + n = len(graph["initial"]) + require(layout["public"] == n == len(graph["final"]) == 1501 + and len(layout["live"]) == len(layout["ports"]) == 104, + "complete public and port denominators") + hosted = layout["hosted"] + hosted_ports = set(hosted["Dports"]) + second_planes = list(zip(hosted["X2"], hosted["Y2"], strict=True)) + require(len(hosted_ports) == len(second_planes) == 96, "actual 96 hosted ports") + live = layout["live"] + mains = set(live) | {role + 112 for role in live} | set(hosted["X2"]) | set(hosted["Y2"]) + require(len(mains) == 400 and mains <= set(range(n)), "400 distinct real main slots") + for port, (x, q) in enumerate(zip(live, layout["ports"], strict=True)): + y = x + 112 + initial, final = graph["initial"], graph["final"] + frames = graph["frames"] + require(frames[initial[x]] == [q] and frames[initial[y]] == [] + and frames[final[x]] == [1 << j for j in range(9)] + and len(frames[final[y]]) == 8 + and all((v & q).bit_count() % 2 == 0 for v in frames[final[y]]), + f"main binding at port {port}") + for position, pair in zip(hosted["Dports"], second_planes, strict=True): + original = (live[position], live[position] + 112) + require(all(graph[boundary][a] == graph[boundary][b] + for boundary in ("initial", "final") for a, b in zip(original, pair)), + "separate hosted main partners in the same charts") + require(all(r not in mains and (graph["initial"][r], graph["final"][r]) == (3, 237) + for r in PROTECTED_HELPERS), "fixed rank-four same-owner helper boundaries") + return mains, hosted_ports, second_planes + + +def expected_rows(n, layout, interface, unit): + mains, hosted, second = interface + rows = [{r: unit} for r in range(n)] + for port, x in enumerate(layout["live"]): + y = x + 112 + if port in hosted: + rows[y][x] = unit + else: + rows[x][y] = -unit + rows[y] = {x: exact_div(unit, 2), y: exact_div(unit, 2)} + for x, y in second: + rows[x][y] = -unit + require(all(r in mains or row == {r: unit} for r, row in enumerate(rows)), + "independent arbitrary helper definition") + return rows + + +def graph_inputs(graph): + n = len(graph["initial"]) + first = graph["first_output"] + require(n == 1501 and first == 154768, "stable paid and public namespace") + moves = {key: (a, b) for key, a, b in graph["moves"]} + rows = {key: [(donor, exact_coefficient(coef)) for donor, coef in terms] + for key, terms in graph["forms"]} + terminal_keys = set(range(first, first + n)) + order = graph["schedule"] + require(len(moves) == len(graph["moves"]) and all(0 <= key < first for key in moves), + "exact positive paid slots") + require(len(rows) == len(graph["forms"]) == len(moves) + n + and set(rows) == moves.keys() | terminal_keys and moves.keys().isdisjoint(terminal_keys) + and len(order) == len(rows) and set(order) == rows.keys(), + "exact held-bank schedule denominator") + require(all([donor for donor, _ in row] == sorted({donor for donor, _ in row}) + for row in rows.values()), "unique donor keys in literal scalar order") + return moves, rows + + +def graph_bounds(graph, moves, rows, mains): + frames = graph["frames"] + spans = list(map(chart_span, frames)) + starts, ends = graph["initial"], graph["final"] + first = graph["first_output"] + n = len(starts) + require(all(type(chart) is int and 0 <= chart < len(spans) for chart in (*starts, *ends)), + "valid public charts") + + def rank(a, b, helper=False): + require(0 <= a < len(spans) and 0 <= b < len(spans), "valid paid chart IDs") + require(spans[a] < spans[b] or (not helper and spans[b] < spans[a]), + "strictly nested positive paid or helper charts") + return abs(len(frames[b]) - len(frames[a])) + + paid = Counter(rank(a, b) for a, b in moves.values()) + productive = Counter(rank(starts[r], ends[r], helper=True) for r in range(n) if r not in mains) + available = {~r: (chart, 1, Fraction(1)) for r, chart in enumerate(starts)} + grid, peak_mass, peak_node = 1, Fraction(1), None + for key in graph["schedule"]: + a = moves[key][0] if key in moves else ends[key - first] + row_grid, mass = 1, Fraction() + for donor, q in rows[key]: + require(donor in available and available[donor][0] == a, + f"donor unavailable or in wrong chart at row {key}") + _, divisor, weight = available[donor] + row_grid = lcm(row_grid, divisor * q.denominator) + mass += abs(q) * weight + grid = lcm(grid, row_grid) + if mass > peak_mass: + peak_mass, peak_node = mass, key + if key in moves: + available[key] = (moves[key][1], row_grid, mass) + odd, height = grid_parts(grid) + return { + "public": n, "slots": len(moves), "terms": sum(map(len, rows.values())), + "path_grid": grid, "path_grid_odd": odd, "path_grid_height": height, + "positive_path_mass_bound_unscaled": str(peak_mass), + "positive_path_mass_peak_node": peak_node, + "paid_native_ranks": dict(paid), "positive_helper_ranks": dict(productive), + } + + +def exact_basis_grid(graph, moves, rows, grid, expected): + """Check every separate rational product, prefix and installed basis row.""" + values = {~r: {r: grid} for r in range(len(graph["initial"]))} + product_gcd = snapshot_gcd = grid + odd_factors = {} + for prime in (3, 5): + reduced = grid + while reduced % prime == 0: + reduced //= prime + require(reduced < grid, f"missing expected odd prime {prime}") + odd_factors[prime] = grid // reduced + off_grid_controls = {} + n_checks = nontrivial = 0 + divisors = Counter() + peak_absolute = grid + for key in graph["schedule"]: + row, row_bound = {}, 0 + for donor, q in rows[key]: + a, b = q.numerator, q.denominator + n_checks += len(values[donor]) + nontrivial += len(values[donor]) if b != 1 else 0 + if b != 1: + divisors[b] += len(values[donor]) + for column, value in values[donor].items(): + product = exact_div(a * value, b) + product_gcd = gcd(product_gcd, product) + if len(off_grid_controls) < len(odd_factors): + for prime, factor in odd_factors.items(): + if prime not in off_grid_controls and product % factor: + require(value % factor == 0, "first under-scaled donor already off grid") + reduced_numerator = a * (value // factor) + require(reduced_numerator % b, "removed odd factor must cause a literal DIV fault") + off_grid_controls[prime] = { + "row": key, "donor": donor, "entrance_column": column, + "coefficient": str(q), "removed_factor": factor, + "numerator_without_factor": reduced_numerator, "denominator": b, + "positive_remainder": reduced_numerator % b, + } + row_bound += abs(product) + result = row.get(column, 0) + product + if result: + row[column] = result + else: + row.pop(column, None) + peak_absolute = max(peak_absolute, row_bound) + for value in row.values(): + snapshot_gcd = gcd(snapshot_gcd, value) + if key in moves: + values[key] = row + else: + require(row == expected[key - graph["first_output"]], f"wrong normalized endpoint {key}") + return { + "coefficient_products": n_checks, "checked_nontrivial_divisions": nontrivial, + "checked_nontrivial_divisions_by_denominator": dict(divisors), + "exact_all_public_rows": len(expected), + "minimum_product_grid": grid // product_gcd, "minimum_snapshot_grid": grid // snapshot_gcd, + "maximum_exact_row_prefix_mass_scaled": str(Fraction(peak_absolute, 1 << grid_parts(grid)[1])), + "missing_odd_factor_controls": off_grid_controls, + } + + +class HeldBank: + """Finite extent fixture with typed payloads and separately guarded streams.""" + + def __init__(self, homes): + self.homes = homes + self.blank = (None, None, (0,) * PAYLOAD_AXES) + self.left_guard = object() + self.right_guard = object() + self.dummy = object() + self.left = self.left_guard + self.right = self.right_guard + self.slots = [self.dummy] + [ + (("dirty", slot), -1, tuple((-1)**axis * (slot + axis) for axis in range(PAYLOAD_AXES))) + for slot in range(1, homes + 1) + ] + self.head = 0 + self.operations = Counter() + self.overwritten_cells = Counter() + self.trace = sha256() + # GET restores the selector head. Its complete donor and the running + # accumulator have independent backing throughout the term. + self.streams = {name: None for name in ("accumulator", "donor", "product", "quotient")} + self.stream_resets = 0 + + def access(self, slot, operation, replacement=None, *, require_blank=False, clear=False): + require(self.head == 0 and 1 <= slot <= self.homes, "bad guarded bank selection") + self.head = slot + try: + old = self.slots[slot] + require(not require_blank or old == self.blank, + "send or install before previous full owner extent cleared") + if clear: + require(replacement is None and len(old[2]) == PAYLOAD_AXES, "wrong reset extent") + # Scan every addressed payload cell without inspecting its + # value or treating a normalized zero as a reset. + cleared = tuple(0 for _ in old[2]) + self.slots[slot] = (None, None, cleared) + self.overwritten_cells[operation] += len(cleared) + if replacement is not None: + require(len(replacement[2]) == PAYLOAD_AXES, "wrong staged copy extent") + tag, chart, payload = replacement + self.slots[slot] = (tag, chart, tuple(cell for cell in payload)) + self.operations[operation] += 1 + self.trace.update(encoded([operation, slot, old[0], replacement[0] if replacement else None])) + return old + finally: + self.head = 0 + + def reset_stream(self, name): + live = self.streams[name] + if live is not None: + require(len(live) == PAYLOAD_AXES, "wrong stream reset extent") + self.streams[name] = None + self.stream_resets += 1 + + def close(self): + require(self.head == 0 and self.slots[0] is self.dummy + and self.left is self.left_guard and self.right is self.right_guard + and all(slot == self.blank for slot in self.slots[1:]) + and all(stream is None for stream in self.streams.values()), + "packed bank and four stream retirement") + + +def rejected_write(bank, slot, record, control_operation): + try: + bank.access(slot, control_operation, record, require_blank=True) + except ValueError as failure: + require(str(failure) == "send or install before previous full owner extent cleared" + and bank.head == 0, "wrong dirty or outstanding-sender control failure") + else: + raise ValueError("dirty or held payload accepted as blank") + + +def partial_clear_control(): + bank = HeldBank(2) + old_unselected = bank.slots[2] + # A missing final address remains dirty even though the tag, chart, and + # all earlier positions have been cleared. + bank.slots[1] = (None, None, (0,) * (PAYLOAD_AXES - 1) + (17,)) + record = (("fresh", 0), 3, (1,) * PAYLOAD_AXES) + rejected_write(bank, 1, record, "partial_clear_fault") + residue = bank.access(1, "clear_every_address", clear=True) + require(residue[2][-1] == 17 and bank.slots[1] == bank.blank and bank.slots[2] == old_unselected, + "complete overwrite must remove the residual and preserve neighbors") + bank.access(1, "accepted_after_full_clear", record, require_blank=True) + return {"dirty_unaddressed_last_cell_rejected": True, "neighbor_unchanged": True} + + +def held_schedule(graph, moves, rows, grid, expected, control=False): + n, k, first = len(graph["initial"]), len(moves), graph["first_output"] + entrance = {~r: r + 1 for r in range(n)} + returned = {key: n + i + 1 for i, key in enumerate(sorted(moves))} + terminal = {first + r: n + k + r + 1 for r in range(n)} + sender = 2*n + k + 1 + scratch = range(sender + 1, sender + 5) + allocated = set(entrance.values()) | set(returned.values()) | set(terminal.values()) | {sender} | set(scratch) + require(allocated == set(range(1, 2*n + k + 6)), "injective bank home plan") + bank = HeldBank(len(allocated)) + odd = grid_parts(grid)[0] + binary_grid = grid // odd + public = [ + (("public", r), chart, tuple( + binary_grid * ((r * (719 - 41*axis) + 29 + 37*axis) % 127 - 63) + for axis in range(PAYLOAD_AXES) + )) + for r, chart in enumerate(graph["initial"]) + ] + original_public = public.copy() + for slot in sorted(allocated): + old = bank.access(slot, "initialize_complete_dirty_home", clear=True) + require(all(old[2]), "every initial fixture address must be dirty") + for r, (_, chart, value) in enumerate(public): + scaled = tuple(x * odd for x in value) + bank.access(entrance[~r], "write_entrance", (("entry", r), chart, scaled), require_blank=True) + known = dict(entrance) + installed = set() + outstanding = None + attempted_early_reuse = False + + for key in graph["schedule"]: + paid = key in moves + source, destination = moves[key] if paid else (graph["final"][key - first], None) + require(bank.streams["accumulator"] is None, "running accumulator already occupied") + bank.streams["accumulator"] = (0,) * PAYLOAD_AXES + for donor, q in rows[key]: + require(donor in known, "read before donor RETURN") + tag, chart, value = bank.access(known[donor], "read_immutable_donor") + require(tag == (("entry", ~donor) if donor < 0 else ("returned", donor)) + and chart == source, "wrong owner or chart at guarded GET") + require(all(bank.streams[name] is None for name in ("donor", "product", "quotient")), + "term workspace was live before GET") + bank.streams["donor"] = tuple(cell for cell in value) + bank.streams["product"] = tuple(q.numerator * x for x in bank.streams["donor"]) + bank.streams["quotient"] = tuple(exact_div(x, q.denominator) for x in bank.streams["product"]) + bank.streams["accumulator"] = tuple(a + b for a, b in zip( + bank.streams["accumulator"], bank.streams["quotient"], strict=True)) + for name in ("donor", "product", "quotient"): + bank.reset_stream(name) + value = bank.streams["accumulator"] + if paid: + require(outstanding is None and key not in known, "invalid new native sender") + bank.access(sender, "initialize_empty_sender_before_departure", require_blank=True, clear=True) + record = (("sender", key), source, value) + bank.access(sender, "stage_full_sender", record, require_blank=True) + outstanding = key + if control and key == SURVIVOR: + rejected_write(bank, sender, (("sender", key + 1), source, value), "early_sender_fault") + require(bank.slots[sender] == record and key not in known and bank.slots[returned[key]] == bank.blank, + "fault disturbed the parked sender or exposed an incomplete return") + attempted_early_reuse = True + held_tag, held_chart, held_value = bank.access(sender, "read_parked_sender") + require(outstanding == key and held_tag == ("sender", key) and held_chart == source, + "parked sender must survive until shape and complete return") + # Native checks supply both complete adapters and the paid + # Gaussian child. Their normalized composite preserves this value. + returned_record = (("returned", key), destination, held_value) + bank.access(returned[key], "write_complete_return", returned_record, require_blank=True) + bank.access(sender, "clear_full_sender_after_return", clear=True) + require(bank.head == 0, "sender head not restored after full retirement") + outstanding = None + known[key] = returned[key] + else: + role = key - first + bank.access(terminal[key], "write_terminal", (("terminal", role), source, value), require_blank=True) + bank.reset_stream("accumulator") + + require(outstanding is None and len(known) == n+k and public == original_public, + "all full public entrances must remain intact throughout the native schedule") + for role in range(n): + tag, chart, values = bank.access(terminal[first + role], "read_terminal_for_same_owner_install") + predicted = tuple(exact_div( + sum(q * original_public[i][2][axis] for i, q in expected[role].items()), grid) + for axis in range(PAYLOAD_AXES)) + unscaled = tuple(exact_div(value, odd) for value in values) + require(tag == ("terminal", role) and chart == graph["final"][role] and unscaled == predicted, + "wrong extent, chart, value or same-owner terminal install") + public[role] = (("public", role), chart, unscaled) + installed.add(role) + bank.trace.update(encoded(["public_install_and_unscale", role, chart])) + require(installed == set(range(n)) and all( + record[:2] == (("public", role), graph["final"][role]) for role, record in enumerate(public)), + "every public owner fully installed exactly once") + for slot in sorted(allocated): + bank.access(slot, "retire_complete_home", clear=True) + bank.close() + terms = sum(map(len, rows.values())) + wanted = { + "initialize_complete_dirty_home": len(allocated), "write_entrance": n, + "read_immutable_donor": terms, "initialize_empty_sender_before_departure": k, + "stage_full_sender": k, "read_parked_sender": k, "write_complete_return": k, + "clear_full_sender_after_return": k, "write_terminal": n, + "read_terminal_for_same_owner_install": n, "retire_complete_home": len(allocated), + } + resets = { + op: count * PAYLOAD_AXES for op, count in wanted.items() + if op in {"initialize_complete_dirty_home", "initialize_empty_sender_before_departure", + "clear_full_sender_after_return", "retire_complete_home"} + } + require(bank.operations == wanted and bank.overwritten_cells == resets + and bank.stream_resets == 3*terms+k+n, "complete independent selected replay counts") + return { + "numerical_homes": len(allocated), "guarded_dummy_slots": 1, "separate_guide_tracks": 1, + "max_outstanding_native_senders": 1, "declared_senders": 1, + "immutable_entry_banks": n, "immutable_paid_return_banks": k, + "deferred_terminal_banks": n, "native_scalar_scratch_homes": 4, + "additional_independent_guarded_streams": len(bank.streams), + "trace_sha256": bank.trace.hexdigest(), "selected_logical_operations": dict(bank.operations), + "fixture_addressed_cells_per_home": PAYLOAD_AXES, + "fixture_addressed_cells_overwritten": dict(bank.overwritten_cells), + "tracked_stream_reset_visits": bank.stream_resets, + "same_owner_complete_fixture_outputs": len(installed), "exact_odd_unscale_outputs": len(installed), + "retired_and_guards_restored": True, "live_sender_alias_control_rejected": attempted_early_reuse, + "all_public_inputs_preserved_until_final_installs": True, + } + + +def scalar_service(value, coefficient, signed_width): + """Finite signed carry, quotient, exact remainder and padded installation.""" + a, b = abs(coefficient.numerator), coefficient.denominator + magnitude = abs(value) + require(magnitude.bit_length() < signed_width, "input width") + padding = signed_width + 26 + carry, bits = 0, [] + for j in range(padding): + carry += a * ((magnitude >> j) & 1) + bits.append(carry & 1) + carry >>= 1 + require(carry == 0, "padded product overflow") + quotient = remainder = 0 + for bit in reversed(bits): + trial = 2 * remainder + bit + next_bit = int(trial >= b) + remainder = trial - next_bit * b + quotient = (quotient << 1) | next_bit + require(remainder == 0, "physical remainder") + require(quotient.bit_length() < signed_width, "installed scalar overflow") + return -quotient if (value < 0) != (coefficient.numerator < 0) else quotient + + +def scalar_cases(graph_rows, caller, scales): + factors = {factor for rows in graph_rows for row in rows.values() for _, factor in row} + factors.update(Fraction(event[-1]) for event in caller["events"] + if event[0] != "J" and event[1] in ("ADD", "SCALE")) + factors.update((Fraction(-1), Fraction(1), Fraction(-1, 2), Fraction(1, 2))) + for scale in scales: + factors.update((Fraction(scale), Fraction(1, scale), Fraction(-1, scale))) + bits = max(max(abs(q.numerator).bit_length(), q.denominator.bit_length()) for q in factors) + require(bits <= 24, "all literal scalar and division conversions fit W+26") + cases = 0 + for coefficient in sorted(factors): + for k in (0, -127, -1, 1, 19, (1 << 68) + 1): + value = k * coefficient.denominator + signed_width = max(3, abs(value).bit_length()+2, abs(k * coefficient.numerator).bit_length()+2) + require(scalar_service(value, coefficient, signed_width) == k * coefficient.numerator, + "fixed scalar sign/carry/remainder or installation") + cases += 1 + rejected_denominators = (2, 3, 5, 7) + for denominator in rejected_denominators: + try: + scalar_service(1, Fraction(-1, denominator), 3) + except ValueError as failure: + require(str(failure) == "physical remainder", "wrong inexact scalar rejection") + else: + raise ValueError("nonintegral scalar installed") + return {"distinct_scalar_and_conversion_factors": len(factors), "signed_bit_transducer_cases": cases, + "coefficient_bits": bits, "rejected_one_tick_denominators": rejected_denominators, + "retained_max_bits": 24, "component_padding": 26} + + +def caller_envelope(caller): + """Majorize raw caller products with no cancellation or operator commutation.""" + roles = [(0, Fraction(1)) for _ in range(caller["roles"])] + max_height, max_mass = 0, Fraction(1) + pre_height, pre_mass = 0, Fraction(1) + visits = Counter() + + def observe(*values): + nonlocal max_height, max_mass + for height, mass in values: + max_height = max(max_height, height) + max_mass = max(max_mass, mass) + + def scale(value, factor): + height, mass = value + return height + grid_parts(factor.denominator)[1], abs(factor) * mass + + def add(first, second): + return max(first[0], second[0]), first[1] + second[1] + + stages = [] + for event in caller["events"]: + if event[0] == "J": + _, stage, (x, y, u, v), (a, b, alpha, beta) = event + require((Fraction(alpha), Fraction(beta)) == (-1, Fraction(1, 2)), + "exact signed joint envelope coefficients") + stages.append(stage) + pre_height = max(pre_height, *(roles[j][0] for j in (x, y, u, v, a, b))) + pre_mass = max(pre_mass, *(roles[j][1] for j in (x, y, u, v, a, b))) + roles[y], roles[u] = add(roles[y], roles[x]), add(roles[u], roles[v]) + old_a, old_b = roles[a], roles[b] + roles[a] = add(old_a, old_b) + roles[b] = add(scale(old_a, Fraction(1, 2)), scale(old_b, Fraction(1, 2))) + observe(roles[y], roles[u], roles[a], roles[b]) + continue + kind, op, role, *args = event + visits[op] += len(caller["types"][kind]["ports"]) + if op == "ADD": + term = scale(roles[args[0]], Fraction(args[-1])) + roles[role] = add(roles[role], term) + observe(term) + elif op == "SCALE": + roles[role] = scale(roles[role], Fraction(args[-1])) + elif op == "SWAP": + donor = args[0] + roles[role], roles[donor] = roles[donor], roles[role] + elif op == "QUERY": + roles[role] = add(roles[role], roles[args[0]]) + elif op == "LAMBDA": + height, mass = roles[role] + # (1 ± i)/2 and (1 ∓ i)/2 each have Gaussian l1 norm one. + roles[role] = height + 1, 2 * mass + else: + require(op in {"IDLE_ONE", "IDLE_ODD"}, "unknown signed caller operation") + observe(roles[role]) + require(stages == list(range(1, STAGES+1)), "complete exact 16-stage raw schedule") + return { + "records": len(caller["events"]), "stages": len(stages), "uses": dict(visits), + "binary_height_at_all_completed_cuts_and_products": max_height, + "binary_height_at_native_entrances": pre_height, + "scaled_mass_at_all_cuts_and_products": str(CALLER_ODD * max_mass), + "scaled_mass_at_native_entrances": str(CALLER_ODD * pre_mass), + "normalized_bound_uses_no_cancellation_or_commutation": True, + } + + +def replay_caller(caller, layout): + path = HERE / "engines/caller/caller16.py" + require(sha256(path.read_bytes()).hexdigest() == CALLER_REPLAY, "wrong signed caller engine") + spec = importlib.util.spec_from_file_location("physical_signed_caller16", path) + require(spec is not None and spec.loader is not None, "signed caller engine must be loadable") + module = importlib.util.module_from_spec(spec) + spec.loader.exec_module(module) + result = module.signed_caller(caller, layout, CALLER_ODD, 9) + require(result["calls"] == STAGES and result["roles"] == 68 and result["root_owners"] == 3536 + and result["exact_preproduct_divisions"] == 153295 + and Fraction(result["peak_scaled_mass"]) == Fraction(495734175, 2), + "exact inherited caller odd scale and literal divide replay") + roots_q = sum(len(specification["ports"]) * sum(row[0] < 0 for row in specification["diagonal"]) + for specification in caller["types"].values()) + require(roots_q == 3536, "charge all root negative-q ordinary translations") + envelope = caller_envelope(caller) + require(envelope["uses"] == result["uses"], "independent weighted caller operation count") + return result, envelope, roots_q + + +def ordinary_budget(native, signed, roots_q, scalar_bits): + n, k, terms, homes = (native[key] for key in ("public", "slots", "terms", "numerical_homes")) + conversions = 2 * (signed["root_owners"] + STAGES * n) + reset_counts = { + "dirty_home_initializations_and_retirements": 2 * homes, + "term_and_row_stream_initializations_and_retirements": 8 * (terms + k + n), + "owner_scale_unscale_stream_initializations_and_retirements": 4 * n, + "sender_reinitializations_and_retirements": 2 * k, + } + transfer_counts = { + "complete_scalar_donor_staging_legs": 2 * terms, + "complete_sender_and_terminal_staging_legs": 2 * (k + n), + "paid_parked_sender_return_and_adapter_legs": 6 * k, + "immutable_entrance_and_public_terminal_install_legs": 4 * n, + } + resets, transfers = sum(reset_counts.values()), sum(transfer_counts.values()) + selector_l = 14*homes + 9 + selector_constant = 63*homes - 7*homes.bit_count() + 27*homes.bit_length() + 59 + # Allow the separate full overwrite scan for every reset, in addition + # to the selector/reset bound, including the stream resets. + selections = [resets*(selector_l+2) + transfers*(selector_l+128), + resets*(selector_constant+3) + transfers*(selector_constant+320)] + selected = native["selected_logical_operations"] + checked_home_resets = sum(selected[op] for op in native["fixture_addressed_cells_overwritten"]) + checked_copy_visits = sum(selected.values()) - checked_home_resets + require(checked_home_resets == 2*(homes+k) + and resets >= checked_home_resets + native["tracked_stream_reset_visits"], + "full occupied resets, sender reuse and independent stream resets charged") + require(checked_copy_visits == terms+3*(k+n) and transfers == 2*checked_copy_visits + 2*k, + "all staged copy visits plus complete paid adapter legs charged") + p = STAGES * k + sum(signed["fixed_caller_paid"].values()) + t = STAGES * sum(native["positive_helper_ranks"].values()) + sum(signed["fixed_root_targets"].values()) + uses = signed["uses"] + maps = 2*(p+t+STAGES*400) + 2*(uses["IDLE_ONE"]+uses["IDLE_ODD"]) + maps += 3*uses["QUERY"] + uses["LAMBDA"] + uses["IDLE_ODD"] + roots_q + scalar_counts = { + "literal_native_products_and_accumulations": STAGES * terms, + "width_padded_native_row_lifecycles": STAGES * 4 * (k + n), + "public_boundary_installations_and_scale_preparations": STAGES * 2 * n, + "private_home_flags_and_cleanup": STAGES * homes, + "serial_sender_initialization_and_retirement": STAGES * 2 * k, + "weighted_signed_caller_operation_slots": sum(uses.values()), + "complete_array_odd_conversions": conversions, + } + scalar_count = 32 * sum(scalar_counts.values()) + require(homes <= OLD_NATIVE_STOCK and native["additional_independent_guarded_streams"] == 4, + "retained numerical home ceiling and extra independent streams") + return { + "native_numeric_homes": homes, "native_numeric_homes_plus_dummy": homes+1, + "raw_numeric_homes": STAGES*homes, "raw_numeric_homes_plus_dummy": STAGES*(homes+1), + "separate_guarded_guide_tracks_per_native": 1, "separate_guarded_guide_tracks_raw": STAGES, + "separate_guarded_streams_per_native": 4, "separate_guarded_streams_raw": STAGES*4, + "odd_conversions": conversions, "reset_services_per_native": resets, + "typed_selected_transfers_per_native": transfers, + "reset_services_by_kind_per_native": reset_counts, + "typed_transfer_legs_by_kind_per_native": transfer_counts, + "reset_services_all_native_stages": STAGES * resets, + "typed_selected_transfer_legs_all_native_stages": STAGES * transfers, + "selector_steps_per_selected_service_L_and_constant": [selector_l, selector_constant], + "additional_full_overwrite_steps_per_reset_L_and_constant": [2, 3], + "selected_total_steps_per_native_L_and_constant": selections, + "selected_total_steps_raw_L_and_constant": [STAGES * part for part in selections], + "scalar_services": scalar_count, "scalar_step_rate": 2**max(20, scalar_bits+8), + "raw_scalar_incidence_allowance_before_factor_32": scalar_counts, + "ordinary_map_slots": maps, "ordinary_elementary_record_upper": maps*4*(AMBIENT_CAP+1)**2, + "raw_paid_positions": p, "raw_productive_targets": t, "root_negative_q_translations": roots_q, + "native_paid_wrappers": STAGES * k, + "native_productive_wrappers": STAGES * sum(native["positive_helper_ranks"].values()), + "ordinary_main_pair_slots": STAGES * 400, + "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": { + "padded_payload": "L'=N_c(2(W+26)+3)", + "per_stage_selector_and_stream_tracks": 11, + "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", + "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]", + "shadow_cells_upper": "M+352", + "complete_view_step_bound": "34*(256(M+352)+128) plus fixed-degree descriptor work", + }, + } + + +def root_envelope(native, caller): + max_binary = max(caller["binary_height_at_all_completed_cuts_and_products"], + *(caller["binary_height_at_native_entrances"] + side["path_grid_height"] + for side in native.values())) + max_mass = max(Fraction(caller["scaled_mass_at_all_cuts_and_products"]), + *(Fraction(caller["scaled_mass_at_native_entrances"]) * side["path_grid_odd"] + * Fraction(side["positive_path_mass_bound_unscaled"]) + for side in native.values())) + mass_bits = ceiling_bits(max_mass) + c = 2 * max(max_binary, mass_bits) + return { + "caller_odd": CALLER_ODD, + "native_odd": {side: audit["path_grid_odd"] for side, audit in native.items()}, + "native_binary": {side: audit["path_grid_height"] for side, audit in native.items()}, + "context_mass_bound": str(max_mass), "context_mass_bits": mass_bits, + "context_binary_bits": max_binary, "context_c": c, + "H_guard": "bit_length(context_c*1920*153**1920*(H+1)**2) < H for each actual compiler bound H", + "exact_grid": "2^(-p-D)", + "signed_width": "W=p+h+2D+3", + "temporary_width": "W+26", + } + + +def relay_edit(parent, candidate, word): + require(all(parent[field] == candidate[field] == word[field] + for field in ("frames", "initial", "final")), + "same complete raw chart atlas and public owner shapes") + require(parent["first_output"] == candidate["first_output"] == len(word["program"]), + "stable raw clocks and complete public output namespace") + enter, middle, leave = RELAY_CHARTS + require(word["program"][REMOVED] == ["MOVE", RELAY_ROLE, enter, middle, False] + and word["program"][SURVIVOR] == ["MOVE", RELAY_ROLE, middle, leave, False], + "literal nonproductive source relay on owner 1256") + parent_moves, parent_rows = graph_inputs(parent) + child_moves, child_rows = graph_inputs(candidate) + raw_moves = {clock: (event[2], event[3]) for clock, event in enumerate(word["program"]) + if event[0] == "MOVE"} + require(parent_moves == raw_moves and len(raw_moves) == 6144 and len(child_moves) == 6143, + "exact source and contracted paid denominators") + require(child_moves == {key: (enter, leave) if key == SURVIVOR else edge + for key, edge in parent_moves.items() if key != REMOVED}, + "only one direct paid edge replaces the two source children") + require(parent_rows[SURVIVOR] == [(REMOVED, Fraction(1))] + and [key for key, terms in parent_rows.items() if any(donor == REMOVED for donor, _ in terms)] + == [SURVIVOR], + "pure single-consumer relay") + require(child_rows == {key: parent_rows[REMOVED] if key == SURVIVOR else terms + for key, terms in parent_rows.items() if key != REMOVED}, + "retained paid sender uses exactly four substituted source terms") + edited = {REMOVED, SURVIVOR} + require([key for key in candidate["schedule"] if key not in edited] + == [key for key in parent["schedule"] if key not in edited], + "relative schedule order of all rows outside the relay") + positions = (parent["schedule"].index(REMOVED), parent["schedule"].index(SURVIVOR), + candidate["schedule"].index(SURVIVOR)) + require(positions == (3308, 4114, 3310), "exact old and new zero-based relay schedule positions") + a, b, c = (chart_span(word["frames"][chart]) for chart in RELAY_CHARTS) + require(a < b < c and (len(a), len(b), len(c)) == (8, 64, 512), + "strict consecutive ranks 3+3, direct rank 6") + return {"role": RELAY_ROLE, "removed_paid_key": REMOVED, "surviving_paid_key": SURVIVOR, + "ordered_charts": list(RELAY_CHARTS), "old_ranks": [3, 3], "new_rank": 6, + "new_sender_donors": [[donor, str(coef)] for donor, coef in child_rows[SURVIVOR]], + "schedule_positions_zero_based": {"parent_removed": positions[0], "parent_survivor": positions[1], + "candidate_survivor": positions[2]}, + "relative_order_unchanged_rows": len(candidate["schedule"]) - 1, + "row_later_relay_consumers": 1, "new_recursive_charges_outside_replacement": 0} + + +def check_raw_clear_inventory(word, certs): + indices = {str(clock) for clock, event in enumerate(word["program"]) if event[0] == "CLEAR"} + certificates = certs["clear_event_index"] + count = sum(len(terms) for terms in certificates.values()) + require(certs["candidate_canonical_sha256"] == SOURCE_WORD and set(certificates) == indices + and len(indices) == 235 and count == 1135, "source raw CLEAR certificate inventory") + return {"raw_clear_clocks": len(indices), "normalized_source_terms": count, + "bank_execution_source": "complete addressed retirement in the new banked schedule", + "raw_clear_role": "source-word chronological normalized proof; graph replay checks its own ownership"} + + +def check_depth_guard(root, h): + require(h > 0, "positive compiler H") + k_star = 1920 * 153**1920 * (h + 1)**2 + bits = (root["context_c"] * k_star).bit_length() + require(bits < h, "common exact-root depth guard") + return {"compiler_H": h, "argument_bit_length": bits, "strict_guard_passed": True} + + +def qualify(parent, candidate, word, certs, caller, h): + relay = relay_edit(parent, candidate, word) + clear_inventory = check_raw_clear_inventory(word, certs) + signed, caller_bound, roots_q = replay_caller(caller, word) + native, all_rows = {}, [] + for side, graph in (("parent", parent), ("candidate", candidate)): + interface = public_interface(graph, word) + moves, rows = graph_inputs(graph) + all_rows.append(rows) + audit = graph_bounds(graph, moves, rows, interface[0]) + grid = audit["path_grid"] + expected = expected_rows(audit["public"], word, interface, grid) + native[side] = { + **audit, + **exact_basis_grid(graph, moves, rows, grid, expected), + **held_schedule(graph, moves, rows, grid, expected, control=side == "candidate"), + } + parent_audit, child = native["parent"], native["candidate"] + require(parent_audit["path_grid"] == 2025 << 20 and parent_audit["terms"] == 172415 + and parent_audit["coefficient_products"] == 9044218, "independent G3 folded native anchor") + require(set(child["missing_odd_factor_controls"]) == {3, 5} and child["live_sender_alias_control_rejected"], + "actual under-scaled literal divisions and outstanding sender controls must reject") + old_paid = Counter(parent_audit["paid_native_ranks"]) + new_paid = Counter(child["paid_native_ranks"]) + require(new_paid - old_paid == {6: 1} and old_paid - new_paid == {3: 2} + and child["positive_helper_ranks"] == parent_audit["positive_helper_ranks"], + "exact paid replacement, unchanged productive ranks") + require(sum(rank * count for rank, count in new_paid.items()) + == sum(rank * count for rank, count in old_paid.items()), "paid rank mass conservation") + require((parent_audit["numerical_homes"], child["numerical_homes"]) == (9151, 9150), + "complete serial sender realization on both exact graphs") + root = root_envelope(native, caller_bound) + scalars = scalar_cases(all_rows, caller, (CALLER_ODD, *root["native_odd"].values())) + ordinary = {side: ordinary_budget(audit, signed, roots_q, scalars["coefficient_bits"]) + for side, audit in native.items()} + return { + "status": "PASS_CF6A_RELAY_BANK_PHYSICAL", + "scope": "Complete folded normalized products, all public endpoints, charged guarded bank schedules, finite scalar services and common exact root under the retained physical and recursive interfaces.", + "relay": relay, "raw_clear_source_inventory": clear_inventory, + "native": native, "ordinary": ordinary, "scalar_services": scalars, + "physical_controls": partial_clear_control(), + "caller_exact": signed, "caller_hereditary_envelope": caller_bound, "common_exact_root": root, + "bit_guard": check_depth_guard(root, h), + "both_graphs_respect_historical_numeric_homes_and_streams": True, + "inherited_private_home_cap_per_stage": OLD_NATIVE_STOCK, + "raw_stage_count": STAGES, + } + + +def main(): + parser = ArgumentParser(description=__doc__) + parser.add_argument("--parent", type=Path, default=HERE / "data/PARENT-GRAPH.json.gz") + parser.add_argument("--candidate", type=Path, default=HERE / "data/CANDIDATE-GRAPH.json.gz") + parser.add_argument("--word", type=Path, default=HERE / "data/WORD.json.gz") + parser.add_argument("--certs", type=Path, default=HERE / "data/CERTS.json") + parser.add_argument("--caller", type=Path, default=HERE / "data/CALLER.json.gz") + parser.add_argument("--candidate-sha256", default=CANDIDATE) + parser.add_argument("--compiler-H", type=int, default=COMPILER_H) + parser.add_argument("--out", type=Path) + args = parser.parse_args() + require(args.candidate_sha256 == CANDIDATE, "wrong frozen candidate pin") + parent, parent_gzip = load_gzip(args.parent, PEER) + child, child_gzip = load_gzip(args.candidate, CANDIDATE) + word, word_gzip = load_gzip(args.word, SOURCE_WORD) + caller, caller_gzip = load_gzip(args.caller, CALLER, canonical=False) + certs_raw = args.certs.read_bytes() + require(sha256(certs_raw).hexdigest() == SOURCE_CERTS, "wrong literal raw CLEAR certificate binding") + result = qualify(parent, child, word, json.loads(certs_raw), caller, args.compiler_H) + result.update({ + "graphs": {"parent": PEER, "candidate": CANDIDATE}, "caller_sha256": CALLER, + "source_head": SOURCE_HEAD, "source_word_sha256": SOURCE_WORD, "source_certs_sha256": SOURCE_CERTS, + "transport_sha256": {"parent": parent_gzip, "candidate": child_gzip, "word": word_gzip, + "caller": caller_gzip}, + }) + if args.out is None: + print(json.dumps(result, sort_keys=True, indent=2)) + else: + with args.out.open("x", encoding="utf-8") as handle: + json.dump(result, handle, sort_keys=True, indent=2) + handle.write("\n") + print(result["status"]) + + +if __name__ == "__main__": + main() diff --git a/research/quotient-split-minimal-odd-scale/verify.py b/research/quotient-split-minimal-odd-scale/verify.py new file mode 100644 index 0000000000..028a38b803 --- /dev/null +++ b/research/quotient-split-minimal-odd-scale/verify.py @@ -0,0 +1,190 @@ +"""Check the minimal odd-scale substitution on the fixed composed graph. + +The grid and basis-witness methods adapt PR7680, with its PR866 credit. +The physical engines and interface reader retain their PR7717 bytes. +See CREDITS.md. Ali Romman, with OpenAI Codex assistance. Apache-2.0. +""" +from fractions import Fraction as F +from hashlib import sha1, sha256 +from math import gcd +from pathlib import Path +import json +import sys + +HERE = Path(__file__).resolve().parent +sys.path.insert(0, str(HERE / "source")) +from common import inputs, need, physical, read as source_read +from caller16 import signed_caller + +sys.path.insert(0, str(HERE.parents[1] / "research/shared-wire-split-composition/frozen")) +import native_verify as native + +ODD, HEIGHT = 11025, 20 + + +def odd(value): + need(value > 0, "positive denominator") + return value >> ((value & -value).bit_length() - 1) + + +def valuation(value, prime): + exponent = 0 + while value % prime == 0: + value //= prime + exponent += 1 + return exponent + + +def provenance(): + pins = json.loads((HERE / "SOURCE-PINS.json").read_text()) + for pin in pins: + raw = (HERE / pin["path"]).read_bytes() + need(sha256(raw).hexdigest() == pin["sha256"] + and sha1(f"blob {len(raw)}\0".encode() + raw).hexdigest() == pin["git_blob"], + "retained source identity: " + pin["path"]) + for pin in json.loads((HERE / "SOURCES.json").read_text())["files"]: + if pin["usage"] == "input": + need(sha256((HERE.parents[1] / pin["path"]).read_bytes()).hexdigest() == pin["sha256"], + "external interpreter identity") + return len(pins) + + +def coefficient_certificate(graph, moves, forms, grid): + values = {~r: {r: grid} for r in range(len(graph["initial"]))} + common, products, witnesses = grid, 0, {} + for node in graph["schedule"]: + row = {} + for donor, factor in forms[node]: + for owner, value in values[donor].items(): + term, remainder = divmod(factor.numerator * value, factor.denominator) + need(remainder == 0, "sufficient source grid") + new = gcd(common, term) + if new != common: + for prime in (3, 5, 7): + if valuation(new, prime) < valuation(common, prime): + coefficient = F(term, grid) + witnesses[str(prime)] = dict(node=node, donor=donor, input=owner, + factor=str(factor), coefficient=str(coefficient), + odd_denominator=odd(coefficient.denominator), + chart=moves[node][0] if node in moves else graph["final"][node-graph["first_output"]]) + common = new + total = row.get(owner, 0) + term + if total: + row[owner] = total + else: + row.pop(owner, None) + products += 1 + values[node] = row + minimum = grid // common + need(odd(minimum) == ODD and minimum == 90316800 and set(witnesses) == {"3", "5", "7"}, + "complete odd denominator certificate") + return dict(odd=ODD, binary_height=valuation(minimum, 2), products=products, witnesses=witnesses) + + +def rational_witness(graph, forms, witness): + values = {~r: F(int(r == witness["input"])) for r in range(len(graph["initial"]))} + observed = False + for node in graph["schedule"]: + row = F(0) + for donor, factor in forms[node]: + term = factor * values[donor] + if node == witness["node"] and donor == witness["donor"]: + need(str(term) == witness["coefficient"] and str(factor) == witness["factor"], + "independent Fraction product witness") + observed = True + row += term + values[node] = row + need(observed, "witness site reached") + + +def first_fault(graph, forms, owner, grid): + values = {~r: grid * int(r == owner) for r in range(len(graph["initial"]))} + for node in graph["schedule"]: + row = 0 + for donor, factor in forms[node]: + numerator = factor.numerator * values[donor] + term, remainder = divmod(numerator, factor.denominator) + if remainder: + return dict(node=node, donor=donor, input=owner, grid=grid, + numerator=numerator, divisor=factor.denominator, remainder=remainder) + row += term + values[node] = row + raise ValueError("insufficient odd scale completed") + + +def physical_witness(graph, prime, witness): + first, last = graph["initial"][witness["input"]], witness["chart"] + x, xbits = native.state(native.frame(graph["frames"][first], 9)) + y, ybits = native.state(native.frame(graph["frames"][last], 9)) + need(x == {0: (1, 0)} and xbits == 0, "literal physical unit input") + coefficient = F(witness["coefficient"]) + full, under = ODD * coefficient, (ODD // prime) * coefficient + need(all(odd((full * F(v, 2**ybits)).denominator) == 1 for pair in y.values() for v in pair), + "all chart components clear on the smaller scale") + bad = next((address, part, F(v, 2**ybits)) for address, pair in sorted(y.items()) + for part, v in zip(("real", "imaginary"), pair, strict=True) + if (under * F(v, 2**ybits)).denominator % prime == 0) + return dict(prime=prime, input_role=witness["input"], input_chart=first, input_basis=0, + input_dyadic_bits=xbits, input_column_sha256=sha256(physical.encoded([x, xbits])).hexdigest(), + product_chart=last, address=bad[0], component=bad[1], chart_amplitude=str(bad[2]), + normalized_product=str(coefficient), scaled_product=str(full * bad[2]), + under_scaled_product=str(under * bad[2])) + + +def contract_controls(): + need(odd((F(1, 3) * 3).denominator) == 1, "nonunit map hides an odd denominator") + need(F(1, 3) - F(1, 3) == 0, "correlated inputs hide an odd denominator") + phase = (F(3, 5), F(4, 5)) + need(sum(x*x for x in phase) == 1 and all(odd(x.denominator) == 5 for x in phase), + "arbitrary unitary global phase can add an odd denominator") + return dict(nonunit_chart_counterexample_checked=True, correlated_input_counterexample_checked=True, + unrestricted_global_phase_counterexample_checked=True) + + +def verify(): + pins = provenance() + graph, layout, moves, forms, interface = inputs() + published = source_read("results/application.json") + bound = physical.graph_bounds(graph, moves, forms, interface[0]) + for key, value in bound.items(): + need(json.loads(json.dumps(value)) == published["physical"]["native"][key], "source bound identity") + certificate = coefficient_certificate(graph, moves, forms, bound["path_grid"]) + physical_columns = [] + for prime, witness in certificate["witnesses"].items(): + rational_witness(graph, forms, witness) + witness["first_under_scaled_fault"] = first_fault(graph, forms, witness["input"], (ODD // int(prime)) << HEIGHT) + physical_columns.append(physical_witness(graph, int(prime), witness)) + grid = ODD << HEIGHT + expected = physical.expected_rows(layout["public"], layout, interface, grid) + exact = physical.exact_basis_grid(graph, moves, forms, grid, expected) + addressed = physical.held_schedule(graph, moves, forms, grid, expected, control=True) + need(addressed["live_sender_alias_control_rejected"] and addressed["retired_and_guards_restored"], + "complete addressed storage controls") + caller = source_read("data/CALLER.json.gz") + signed = signed_caller(caller, layout, 2025, 9) + need(json.loads(json.dumps(signed)) == published["caller"], "same complete signed caller") + scalars = physical.scalar_cases([forms], caller, (2025, ODD)) + budget = physical.ordinary_budget(bound | exact | addressed, signed, 3536, scalars["coefficient_bits"]) + old = published["physical"]["ordinary"] + need(all(value == old[key] for key, value in budget.items() if key != "scalar_step_rate"), + "all ordinary counts and layout charges retained") + need(scalars["coefficient_bits"] == 14 and budget["scalar_step_rate"] == 2**22 + and old["scalar_step_rate"] == 128 * budget["scalar_step_rate"], "exact finite scalar-rate reduction") + need(ODD < bound["path_grid_odd"] and HEIGHT == bound["path_grid_height"], "old root envelope dominates") + guard = physical.check_depth_guard(published["physical"]["common_root"], int(published["compiler"]["H"])) + need(guard == published["physical"]["depth_guard"], "retained depth guard") + return dict(status="PASS_MINIMAL_ODD_PHYSICAL_SUBSTITUTION", graph_sha256=published["graph_sha256"], + source_pins=pins, coefficient_certificate=certificate, physical_columns=physical_columns, + implementation_odd=ODD, implementation_binary_height=HEIGHT, implementation_grid=grid, + exact=exact, addressed=addressed, scalars=scalars, ordinary=budget, + conservative_source_path_bounds=bound, retained_root_envelope=published["physical"]["common_root"], + retained_compiler_H=published["compiler"]["H"], retained_depth_guard=guard, + conditional_interfaces=published["conditional_interfaces"], + scalar_rate_reduction=128, contract_controls=contract_controls(), + partial_clear_control=physical.partial_clear_control()) + + +if __name__ == "__main__": + result = verify() + need(json.loads(json.dumps(result)) == json.loads((HERE / "RESULT.json").read_text()), "receipt mismatch") + print(result["status"], result["implementation_odd"], result["scalar_rate_reduction"])