diff --git a/docs/ci-verification.md b/docs/ci-verification.md index 63ba3e9aa8..52b62d0481 100644 --- a/docs/ci-verification.md +++ b/docs/ci-verification.md @@ -1,8 +1,25 @@ # CI verification -## Current selected-family replay: #6030 +## Current selected-family replay: #7000 with #7001 The [selected record](../certificates/selected-result.json) binds conditional +κ = 0.00363005817 to the [application review](research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md), +[validation receipts](research/pr-intake-evidence/pr7000-application/VALIDATION.json), +and [explicit source closure](../certificates/frontier7000-source.json). +`make frontier7000-verify` follows that exact-source selected replay. The review +reuses eleven authenticated preceding executions and records seven fresh serial +application, scalar and complete native-catalogue executions. The earlier +monolithic timeout is retained separately and is not completed coverage. +Consult the receipts for exact commands, source heads and limits. + +The five inherited framework assumptions remain. No complete uniform word, +literal multiplier execution, independent human proof or formal-kernel proof +is asserted. Routine research submissions do not need to rerun this +selected-family replay. The sections below preserve historical checkpoints. + +## Historical selected-family replay: #6030 + +The [historical checkpoint](../certificates/checkpoints/frontier6030.json) binds conditional κ = 0.003125804 to the [proof review](research/pr-intake-evidence/pr6030-audit/PROOF-REVIEW.md), [validation receipts](research/pr-intake-evidence/pr6030-audit/VALIDATION.json), and [explicit source closure](../certificates/frontier6030-source.json). diff --git a/research/bit-first-observer-compensation/AUDIT.json b/research/bit-first-observer-compensation/AUDIT.json new file mode 100644 index 0000000000..febd77dbb6 --- /dev/null +++ b/research/bit-first-observer-compensation/AUDIT.json @@ -0,0 +1 @@ +{"causal_slots": 180, "coefficients": 1036, "exterior_outputs": 114, "protected_contacts": 2266, "scopes": [{"coefficient_rank": 148, "expanded_singletons": 0, "kernel_dimension": 888, "recipient_modes": 2, "scope": "joint protected and exterior"}, {"coefficient_rank": 0, "expanded_singletons": 0, "kernel_dimension": 1036, "recipient_modes": 2, "scope": "no leak constraints"}], "status": "PASS"} diff --git a/research/bit-first-observer-compensation/LICENSE b/research/bit-first-observer-compensation/LICENSE new file mode 100644 index 0000000000..261eeb9e9f --- /dev/null +++ b/research/bit-first-observer-compensation/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/bit-first-observer-compensation/NOTICE b/research/bit-first-observer-compensation/NOTICE new file mode 100644 index 0000000000..092616fc50 --- /dev/null +++ b/research/bit-first-observer-compensation/NOTICE @@ -0,0 +1,19 @@ +This fixed first-observer BIT compensation result is Apache-2.0. +OpenAI Codex and subagents materially assisted the proof, implementation and audit. + +Jerry Chen / CubeJerry #7001 and #6726 supplied the retained native word, complete +invoice and directed interval implementation. NOTICE-7001 and LICENSE preserve +that attribution and license. #7209 supplied marked midpoint geometry and the +directed stock tariff. #7258 supplied the fixed marked libraries. #7260 supplied +the original unmarked donor bound and separately paid split fee. + +#7271 supplied the fixed-payload ingress census and exact joint price. #7272 +supplied the 60 exact changed ingress events, coframed source bases and independent +fixed-suffix impulse audit. #7273 supplied the offline dependency closure and late +compensation predecessor. NOTICE-7271, NOTICE-7272 and NOTICE-7273 preserve +predecessor attribution. PROVENANCE.tsv records the inherited public Git blobs. + +Clear1nsight #7244 supplied the complete comparable witness and retained BIT +premise. NOTICE-7244 preserves that attribution. PEER-BIT-BLOBS.txt records the +identity of the exact BIT input files. Nick Petalas #7264 supplied the abstract +two-for-one sharpness comparison. diff --git a/research/bit-first-observer-compensation/NOTICE-7001 b/research/bit-first-observer-compensation/NOTICE-7001 new file mode 100644 index 0000000000..32c2936ea0 --- /dev/null +++ b/research/bit-first-observer-compensation/NOTICE-7001 @@ -0,0 +1,26 @@ +Paired E-free BIT specialization and complete accounting, with substantial +OpenAI Codex assistance, for the integer-multiplication research project. +Apache-2.0; LICENSE is retained from the source project. + +DreamingOfClouds (Claude Opus assistance) receives credit for #6834's chain-root +BIT caller, #6937's E-free roots and the underlying two-chain construction. +@CubeJerry (OpenAI assistance) receives credit for #6980's four-input three-query +identity, separated interval replacement and QUERY-only caller. The complete +#6980 proof is retained byte-for-byte in data/6980_PROOF.md. + +The new contribution specializes that existing caller to the actual #6726 BIT +native, supplies the parity-driven pairing of two real 111-port invocations, +and checks the complete E-free finite/compiler/ordinary budget from the selected +ordinary backend. No general QUERY-only mechanism, chain root or new raw kappa +is claimed as new here. + +independent/bit_review.py and independent/interval_gate.py were written by a +separate OpenAI Codex research worker for an implementation-independent scalar +and arithmetic audit. This is model-run checking, not external human review. + +zxv and retained predecessor authors receive credit for #6726's source-native +export, integer-before-mod2 transfer, complete source checking and admission +framework. Ali Romman and Cinna Davis retain the root/native lineage credit. +The copied arithmetic and native checker retain their original headers; see +retained/NOTICE. The selected .0034 backend retains the source and contributor +credits in data/selected_record.json and data/selected_review.md. diff --git a/research/bit-first-observer-compensation/NOTICE-7244 b/research/bit-first-observer-compensation/NOTICE-7244 new file mode 100644 index 0000000000..c31402a4fb --- /dev/null +++ b/research/bit-first-observer-compensation/NOTICE-7244 @@ -0,0 +1,13 @@ +Prepared for Clear1nsight with substantial OpenAI Codex and ChatGPT Pro +assistance. New work is Apache-2.0. + +ChatGPT Pro identified the symmetric and antisymmetric two-cut mechanism. +OpenAI Codex independently reconstructed the exact timed witness, emitted +the literal candidate, and adapted and executed the source-bound checks. +Credit the exact #7161 funded exit and #7164 application review, Rohan +Arun's #7156 and #7113, Ali Romman's causal-history owned-buffer identity, +Jerry Chen / CubeJerry's timing and exact replay, Matarener's kernels, +dillona's temporal constructor, and ToikY's exact pricing engines. The +selected framework retains the #7000/#7001 contributor and maintainer +credit. Source licenses and predecessor notices remain in the archive +and reference directory. diff --git a/research/bit-first-observer-compensation/NOTICE-7271 b/research/bit-first-observer-compensation/NOTICE-7271 new file mode 100644 index 0000000000..ffcf51dba1 --- /dev/null +++ b/research/bit-first-observer-compensation/NOTICE-7271 @@ -0,0 +1,21 @@ +This BIT funded-ingress census and separately charged split calculation is Apache-2.0. +OpenAI Codex and subagents materially assisted the construction audit, proof and replay. + +Jerry Chen / CubeJerry #7001 and #6726 supply the literal native word, full +invoice and directed interval implementation. NOTICE-7001 and LICENSE preserve +the original attribution and license. + +#7209 supplies the 22 marked banks, their literal rank-seven midpoint geometry, +and the directed stock tariff. #7258 supplies the fixed marked library and +quotient replay. #7260 supplies the 523-port same-chart old-payload census, the +unmarked donor and release argument, and the separate full-volume split tariff. +Exact published source and blob pins appear in PROVENANCE.tsv. + +Clear1nsight #7244 supplies the independently reproduced complete comparator and +retained BIT premise. NOTICE-7244 preserves the original attribution, and +PEER-BIT-BLOBS.txt records the identity of the three exact BIT inputs. + +Nick Petalas #7264 supplies the synthetic sharpness result for the abstract +two-for-one rank bound. This package checks literal old paid ingress and its +directed tariff for the fixed native, and adds the joint price threshold for +changed marked libraries. diff --git a/research/bit-first-observer-compensation/NOTICE-7272 b/research/bit-first-observer-compensation/NOTICE-7272 new file mode 100644 index 0000000000..9b832671d0 --- /dev/null +++ b/research/bit-first-observer-compensation/NOTICE-7272 @@ -0,0 +1,20 @@ +This BIT changed-carrier exterior rank certificate is Apache-2.0. +OpenAI Codex and subagents materially assisted the analysis, implementation and replay. + +Jerry Chen / CubeJerry #7001 and #6726 supply the literal native word, full +invoice and directed interval implementation. NOTICE-7001 and LICENSE preserve +its source attribution and license. #7209 supplies the marked midpoint geometry +and stock tariff. #7258 supplies the fixed marked library and quotient replay. +#7260 supplies the unmarked donor and release argument and full-volume split fee. + +#7271 supplies the 185-port fixed-payload funded-ingress receipt and joint price. +NOTICE-7271 preserves that predecessor's attribution. This package reconstructs +its receipts and uses its exact 60 old ingress events for a changed-payload test. +PROVENANCE.tsv gives the exact public commit, Git blob and SHA-256 of each copy. + +Clear1nsight #7244 supplies the independently reproduced complete comparator and +retained BIT premise. NOTICE-7244 preserves that attribution. PEER-BIT-BLOBS.txt +records the identity of the three exact BIT inputs. + +Nick Petalas #7264 supplies the synthetic sharpness result motivating the +algebra control. The exterior injectivity result uses the literal retained word. diff --git a/research/bit-first-observer-compensation/NOTICE-7273 b/research/bit-first-observer-compensation/NOTICE-7273 new file mode 100644 index 0000000000..6da58cb835 --- /dev/null +++ b/research/bit-first-observer-compensation/NOTICE-7273 @@ -0,0 +1,18 @@ +This late BIT compensation and fixed-prebirth certificate is Apache-2.0. +OpenAI Codex and subagents materially assisted the proof, implementation and audit. + +Jerry Chen / CubeJerry #7001 and #6726 supply the retained native word, complete +invoice and directed interval implementation. NOTICE-7001 and LICENSE preserve +that source attribution and license. #7209 supplies marked midpoint geometry and +the directed stock tariff. #7258 supplies the fixed marked libraries. #7260 +supplies the original unmarked donor bound and separately paid split fee. + +#7271 supplies the fixed-payload ingress census and exact joint price. #7272 +supplies the 60 exact changed ingress events, the coframed source bases and the +independent fixed-suffix impulse audit. NOTICE-7271 and NOTICE-7272 preserve +predecessor attribution. PROVENANCE.tsv records their public Git blobs. + +Clear1nsight #7244 supplies the complete comparable witness and retained BIT +premise. NOTICE-7244 preserves that attribution. PEER-BIT-BLOBS.txt records the +identity of the exact BIT input files. Nick Petalas #7264 supplies the abstract +two-for-one sharpness comparison. diff --git a/research/bit-first-observer-compensation/PEER-BIT-BLOBS.txt b/research/bit-first-observer-compensation/PEER-BIT-BLOBS.txt new file mode 100644 index 0000000000..a682360cd0 --- /dev/null +++ b/research/bit-first-observer-compensation/PEER-BIT-BLOBS.txt @@ -0,0 +1,8 @@ +e54523517d0f03e58352e647c403a5af3e525a57 +100644 blob 575f76487f9999ecc3e7b1b70f9f71bc582ef8a8 research/paired-query-only-bit/EFREE-RESULT.json +100644 blob 6d5a751dde7554b2bb3ccb9a958a3508d74ea155 research/paired-query-only-bit/independent/interval_gate.py +100644 blob b718d6b2848215ad785022106dfa9f871a3d1c0c research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz +4156504fa39efb51c550d218a9b94fe69dbce8f6 +100644 blob 575f76487f9999ecc3e7b1b70f9f71bc582ef8a8 research/paired-query-only-bit/EFREE-RESULT.json +100644 blob 6d5a751dde7554b2bb3ccb9a958a3508d74ea155 research/paired-query-only-bit/independent/interval_gate.py +100644 blob b718d6b2848215ad785022106dfa9f871a3d1c0c research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz diff --git a/research/bit-first-observer-compensation/PROOF.md b/research/bit-first-observer-compensation/PROOF.md new file mode 100644 index 0000000000..3b2e31f8fc --- /dev/null +++ b/research/bit-first-observer-compensation/PROOF.md @@ -0,0 +1,30 @@ +# Scope and directed price + +The retained word and invoice originate in Jerry Chen / CubeJerry's [#7001](https://github.com/CrocSwap/integer-mult-bounds/pull/7001) and [#6726](https://github.com/CrocSwap/integer-mult-bounds/pull/6726), at canonical base `e54523517d0f03e58352e647c403a5af3e525a57`. The historical complete comparator is Clear1nsight's [#7244](https://github.com/CrocSwap/integer-mult-bounds/pull/7244), science commit `4156504fa39efb51c550d218a9b94fe69dbce8f6`, conditional κ `0.003645372367832`. The pending [#7274](https://github.com/CrocSwap/integer-mult-bounds/pull/7274) changes complex costs and retains the BIT premise. The fixed BIT price target here is `10018846261809/2500000000000000`. + +## Scope + +Fix the normalized old program, paid schedule, charts, owners and literal transport. Allow each of the 60 selected paid ingress inputs to change in its available coframed source span. Allow one ordinary additive perturbation on each existing touched owner immediately after its first old observing operation. The pinned word's next contact with the ingress owner always reads it as the source of a coframed ADD, with no earlier contact or lineage SWAP. The verifier finds the clock by a binary search on an independently reconstructed contact index. The auditor scans the literal word for each next contact and checks both bound owners and the actual chart. These are 60 distinct clocks and exactly 120 ordinary slots. Keep the old recipient geometry and the two pinned cut conventions. + +## Causal overgrant + +At a slot, write the old and perturbation rows of every live coframed peer as `b + sum(m_i d_i)`, where `b` is the pinned old row, `m_i` says which earlier perturbation markers the peer carries, and `d_i` is the selected perturbation row for slot `i`. Give the slot the span of all such `b` and independently every source-space basis of each earlier marker present on those peers. This contains every coframed combination of the actual peer rows by induction on the clock and drops the coupling between the old part and its earlier markers. The two ordinary slots at a clock share the same grant. Applying one before the other can only add its perturbation, which already lies in that shared span. This relaxation treats copying, setup, routing, holding, ownership cleanup, restoration, precision and tape as free. The earlier-marker expansion applies only to live rows at the listed cuts in the frozen word. + +## Joint rank and quotient + +Inject one independent slot marker at each paid ingress and post-ADD correction. Propagate marker masks through the literal ADD, SWAP, MOVE and erasure chronology. Requiring zero change on the 2,266 other nonterminal paid operands and 114 exterior outputs gives homogeneous exact GF(2) equations in 1,036 source-basis coefficients. Defer all 545 terminal operands at this gate. The rank is 148 and the nullity is 888. Disabling the 120 new variables recovers the known-good [#7272](https://github.com/CrocSwap/integer-mult-bounds/pull/7272) paid and exterior masks. The independent audit uses set-valued slot propagation, independent source-span comparisons and elimination on exact columns. + +For each of ten singleton banks let `U` be the span of the 523 unmarked terminal rows, `W` the span of all 545, and `W_j = U + ` for its old marked row. The old allowed library plus every perturbation response at either cutoff spans `S_j`. The number of extra marked directions is + +```text +dim(S_j ∩ W) − dim(S_j ∩ W_j) + = 21 − dim(S_j + W) + dim(S_j + W_j). +``` + +The verifier computes the quotient by terminal coordinates and the audit checks the rank difference independently. Every quotient dimension is zero at both literal and owner-quiet clocks, even after dropping all 2,380 operand and output protections and granting the full 1,036-dimensional coefficient space. Thus none of the tested ordinary corrections can expand eligible singleton stock under these fixed cuts, even if those corrections are free. + +## Whole-family consequence + +[The marked geometry and price](https://github.com/CrocSwap/integer-mult-bounds/pull/7209), [fixed libraries](https://github.com/CrocSwap/integer-mult-bounds/pull/7258), [donor and split price](https://github.com/CrocSwap/integer-mult-bounds/pull/7260) and [paid ingress stock](https://github.com/CrocSwap/integer-mult-bounds/pull/7271) give thresholds of 7, 5 and 4 distinct expanded singleton libraries with zero, one and two separately charged donor splits. The stock caps remain 14, 16 and 18, with directed net uppers approximately −1.4176039760312882, −1.151724566668849 and −0.8858451573064098. Exact endpoints are in [SUMMARY.json](SUMMARY.json). The scope is exhausted with zero unresolved slots. There was no 545-port survivor, signed candidate build or changed native supplier. + +[#7273](https://github.com/CrocSwap/integer-mult-bounds/pull/7273) grants late compensation and uses unchanged prebirth propagation. This package adds the specific ordinary corrections at the literal first observations and independently derives those clocks from public pinned inputs. The old paid-graph relay is a separate Round 27 relaxation with different source and transport assumptions. This proof leaves its composition with post-ADD corrections, other clocks, changed paid routes and unmarked libraries open. [Round 27 discussion and evidence](https://github.com/CrocSwap/integer-mult-bounds/discussions/7111#discussioncomment-19543917) diff --git a/research/bit-first-observer-compensation/PROVENANCE.tsv b/research/bit-first-observer-compensation/PROVENANCE.tsv new file mode 100644 index 0000000000..ab6092cc48 --- /dev/null +++ b/research/bit-first-observer-compensation/PROVENANCE.tsv @@ -0,0 +1,25 @@ +LICENSE c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4 261eeb9e9f8b2b4b0d119366dda99c6fd7d35c64 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/LICENSE +NOTICE-7001 8c73eaf46327f01b4cfc18640b5e5f552648fc5e4427cbccd42af5e7ecd3b732 32c2936ea041e8f3e78638572a73f5f4079d4180 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/NOTICE-7001 +NOTICE-7244 3ed23f5fea64744747b3f03d85bcddee18a6fd52611733f34096c200547a2c8b c31402a4fb56f7e334722dd8cdc5313eaa104cfd https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/NOTICE-7244 +NOTICE-7271 faf69e7bd327f0f774e8d529ad086a22cf6f9a4194ac27e05cb2f04082915507 ffcf51dba1d3adc77f9e19fa7c60c56068553d7b https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/NOTICE-7271 +NOTICE-7272 ebaac21ca7c6bda5590252eb8d3c3dd55c04891021c4d520838c1dfb789abb61 9b832671d02daf46a8b7bd4843a7796782e7dfc7 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/NOTICE-7272 +NOTICE-7273 9b89d1786f35553379bd30e004294fbac68f840d7f50abdf4e3e0243fb14023d 6da58cb83523713ebd361edb6f508909a406a6b1 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/NOTICE +PEER-BIT-BLOBS.txt d7da3234c9d61826d21e1af381dc94e6697519645cfdbf6ce10d31492fe826fe a682360cd040e1ba9cd24c9ed3ac42e4ccd27c5f https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/PEER-BIT-BLOBS.txt +inputs/pr7209/RESULT.json 0cba78ea171cea0327bb59d95fd4e7ddb45ce004a7966de763e3f18346e1aea1 07664a3820ace218226f6e6ec6086068665f018a https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/pr7209/RESULT.json +inputs/pr7209/verify.py e153760831952878b5def1776811ea182ea6f3876f09262f7e81a10991ddbd94 f2460426f9f21d2ce65293f6bf28e7f00bb909ba https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/pr7209/verify.py +inputs/pr7244/PROPOSED-CLAIM.json 14e52a8a25f8f47fa8a9b1429246fa73f047707b4cc51a575154b60788b9e688 786f5550a20184637fc1e05f99a0e28e0976e1a4 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/pr7244/PROPOSED-CLAIM.json +inputs/pr7258/SUMMARY.json b4f35a88da911a3b935aa3f4bbf3c921906d60df147e068bacb5b5ca66b0bfa0 1e215cd7e002638356fcc278a4620234511e8129 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/pr7258/SUMMARY.json +inputs/research/paired-query-only-bit/EFREE-RESULT.json a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b 575f76487f9999ecc3e7b1b70f9f71bc582ef8a8 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/research/paired-query-only-bit/EFREE-RESULT.json +inputs/research/paired-query-only-bit/independent/interval_gate.py 8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec 6d5a751dde7554b2bb3ccb9a958a3508d74ea155 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/research/paired-query-only-bit/independent/interval_gate.py +inputs/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz 51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78 b718d6b2848215ad785022106dfa9f871a3d1c0c https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz +predecessor/bit-price/verify.py 2a6eac8cdfd1c7d3a6caafca1adf103ebf84b3af26be214b99911fc4155f474c 65966652bcfb4a625b266e48381a0639efbf38ce https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/bit-price/verify.py +predecessor/round22/SOURCES.tsv 963e6412a7d3c6fdca55bfb5c7cddcf80c21f2a5ac99162a2c20ffb00bfe77e6 d12b980b7ebf42f438f136ccf47335a55dfe4c02 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round22/SOURCES.tsv +predecessor/round22/verify.py 6c911eb044f9342459be2e21ef6c9c27d1c1fd47e58be87873c6e9656047c948 1a12b3b16122ad2fabb6dfd958d7db9cf0b62687 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round22/verify.py +predecessor/round23/SOURCES.tsv a528875c1092556b60bb77af66ca85b2a8302ea12ae4e4b746891c37fc605dc2 850072eb41fc3fee97d7493a2490cd660c01d529 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round23/SOURCES.tsv +predecessor/round23/verify.py b5b776fe7a5b9a99c256bf6a013831c9707ff54fb1df28f0867acc3a5b2e0ad2 97b5b52e37209e7ccd55d411d4836fbcfef24789 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round23/verify.py +predecessor/round24/SOURCES.tsv d60d52cfb3f4ee7db18fac70cf94e93bae94e22974fcbc59403b353541bdab15 d637b693dc5f83272b3857a97e404f48de23352f https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round24/SOURCES.tsv +predecessor/round24/verify.py 80e4ca5de690c76b266888a9307874d07a4f90c11bba4e42f87ddb45f9221380 74ec88d93e71fb112b16620d07a8ef7751526190 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round24/verify.py +predecessor/round25/AUDIT.json ae5657f8b8fe37aedee5e1dd659fbcd81fe0bf09c0d17734aaf2d559643b0513 e79e71a271b3a176a2af6d680716f9d184dc332d https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round25/AUDIT.json +predecessor/round25/SOURCES.tsv f7d91bad2f7fb645e7d931a9aaeb1e572ed864c7d6057eae53c2f6eefa05a7e9 9bd36d3284567e352a3bd88bfae51b9a49b66c38 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/SOURCES.tsv +predecessor/round25/audit.py c28d073ccd45991579384b1aa29cccc2fdf95c6edb0a492e8e203cb681aa486a a2195bedb8eafa0a7c0e0c923f5ee789a9e3fa90 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round25/audit.py +predecessor/round25/verify.py 4fb801c8219cf4f356b9eab7108a8f2497cc3bc49b089d87086b8ba3c8b13a84 c43102089ed41eb55b723db46ac93c071861291d https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/prior.py diff --git a/research/bit-first-observer-compensation/README.md b/research/bit-first-observer-compensation/README.md new file mode 100644 index 0000000000..5a0a94ee65 --- /dev/null +++ b/research/bit-first-observer-compensation/README.md @@ -0,0 +1,21 @@ +# Fixed first-observer BIT compensation ceiling + +**NO VERIFIED GAIN.** The exact retained BIT word has 60 selected rank-seven paid ingresses. At each ingress's first observer, an old coframed ADD, this package grants a correction on both touched owners. All 120 post-ADD correction slots are covered. Even waiving every protected paid and exterior constraint, the enlarged source libraries contribute zero new directions at all ten singleton banks. The joint constrained system has 1,036 coefficients, rank 148 and nullity 888. This bounds the family on the frozen word. Conditional κ is unchanged. + +## Reproduce + +From this directory in a clean checkout, use CPython 3.12 with assertions enabled. + +```sh +python3.12 -I -B replay.py --controls +``` + +This offline command authenticates the included inputs, regenerates five predecessor receipts, derives the 60 clocks directly from the native word, and independently verifies the coefficient rank and marked quotients. It rejects a changed native input, duplicate manifest path, forged receiver clock and forged quotient expansion. Expect exit 0 with both `PASS_BIT_FIRST_OBSERVER_COMPENSATION` and `PASS_BIT_FIRST_OBSERVER_CONTROLS`. Add `--write-result /path/to/new.json` to save the detailed regenerated receipt. No network, earlier round state or user-specific interpreter path is required. + +[PROOF.md](PROOF.md) gives the exact scope and bound. [SUMMARY.json](SUMMARY.json) pins the complete regenerated receipt and rational directed prices. [AUDIT.json](AUDIT.json) records the independent reconstruction. [PROVENANCE.tsv](PROVENANCE.tsv) binds inherited bytes by package-relative path, SHA-256, Git blob and exact public URL. [REPLAY.sha256](REPLAY.sha256) binds replay inputs. The checked receipt is for the retained BIT component under the historical complete #7244 comparison and fixed moonshot target. The pending complex-only #7274 claim retains that BIT premise. + +## Open next questions + +Can a changed paid route or genuinely new source library deliver new marked directions early enough? Begin by enumerating all frozen paid ingress and compatible target-chart pairs, including late balancing edges in the circulation. Price the upper against the same stock thresholds before a physical build. If chart reassignment closes, inventory new typed ingress sources and the cost of the old calls they could displace. Either route still needs signed arbitrary-input action, chronology, ownership, restoration, precision, tape and the full paid bill. This package's scope leaves new clocks, changed unmarked libraries, paid routes and their composition open. + +Credit Jerry Chen / CubeJerry for #7001 and #6726, #7209 for marked geometry and tariff, #7258 for the fixed libraries, #7260 for donor and split prices, #7271 for paid ingress stock, #7272 for the fixed-suffix carrier source audit, and #7273 for the late-compensation proof and public offline closure. Clear1nsight's #7244 pins the retained BIT premise. OpenAI Codex and subagents materially assisted the proof, implementation and audit. See [NOTICE](NOTICE) and [PROVENANCE.tsv](PROVENANCE.tsv). diff --git a/research/bit-first-observer-compensation/REPLAY.sha256 b/research/bit-first-observer-compensation/REPLAY.sha256 new file mode 100644 index 0000000000..ffae8c22f5 --- /dev/null +++ b/research/bit-first-observer-compensation/REPLAY.sha256 @@ -0,0 +1,23 @@ +7a020af95126ff7371d361864ff0e381f40d10b72c516547a01c0b608aec3887 AUDIT.json +8e6e9130231ef98d8034ba58a371278e926d699855a58ffcd8e0131c2fc2113a SOURCES.tsv +b35f7def8a04075092357c690589752b9890bd716579b8aa1ad5e5802b3f636e SUMMARY.json +be8149fdd98025f2403c4373121585cf58fe2bd334e27005cba76955df17e70b audit.py +0cba78ea171cea0327bb59d95fd4e7ddb45ce004a7966de763e3f18346e1aea1 inputs/pr7209/RESULT.json +e153760831952878b5def1776811ea182ea6f3876f09262f7e81a10991ddbd94 inputs/pr7209/verify.py +14e52a8a25f8f47fa8a9b1429246fa73f047707b4cc51a575154b60788b9e688 inputs/pr7244/PROPOSED-CLAIM.json +b4f35a88da911a3b935aa3f4bbf3c921906d60df147e068bacb5b5ca66b0bfa0 inputs/pr7258/SUMMARY.json +a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b inputs/research/paired-query-only-bit/EFREE-RESULT.json +8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec inputs/research/paired-query-only-bit/independent/interval_gate.py +51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78 inputs/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz +2a6eac8cdfd1c7d3a6caafca1adf103ebf84b3af26be214b99911fc4155f474c predecessor/bit-price/verify.py +963e6412a7d3c6fdca55bfb5c7cddcf80c21f2a5ac99162a2c20ffb00bfe77e6 predecessor/round22/SOURCES.tsv +6c911eb044f9342459be2e21ef6c9c27d1c1fd47e58be87873c6e9656047c948 predecessor/round22/verify.py +a528875c1092556b60bb77af66ca85b2a8302ea12ae4e4b746891c37fc605dc2 predecessor/round23/SOURCES.tsv +b5b776fe7a5b9a99c256bf6a013831c9707ff54fb1df28f0867acc3a5b2e0ad2 predecessor/round23/verify.py +d60d52cfb3f4ee7db18fac70cf94e93bae94e22974fcbc59403b353541bdab15 predecessor/round24/SOURCES.tsv +80e4ca5de690c76b266888a9307874d07a4f90c11bba4e42f87ddb45f9221380 predecessor/round24/verify.py +ae5657f8b8fe37aedee5e1dd659fbcd81fe0bf09c0d17734aaf2d559643b0513 predecessor/round25/AUDIT.json +f7d91bad2f7fb645e7d931a9aaeb1e572ed864c7d6057eae53c2f6eefa05a7e9 predecessor/round25/SOURCES.tsv +c28d073ccd45991579384b1aa29cccc2fdf95c6edb0a492e8e203cb681aa486a predecessor/round25/audit.py +4fb801c8219cf4f356b9eab7108a8f2497cc3bc49b089d87086b8ba3c8b13a84 predecessor/round25/verify.py +e721f1071588253c1fdda346122ad5da8ede530217fac97b24de0ca65b2b74b7 verify.py diff --git a/research/bit-first-observer-compensation/SOURCES.json b/research/bit-first-observer-compensation/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/bit-first-observer-compensation/SOURCES.json @@ -0,0 +1,18 @@ +{ + "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" + } + ] +} diff --git a/research/bit-first-observer-compensation/SOURCES.tsv b/research/bit-first-observer-compensation/SOURCES.tsv new file mode 100644 index 0000000000..596f4e28fd --- /dev/null +++ b/research/bit-first-observer-compensation/SOURCES.tsv @@ -0,0 +1,21 @@ +research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz 51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz +research/paired-query-only-bit/independent/interval_gate.py 8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/research/paired-query-only-bit/independent/interval_gate.py +research/paired-query-only-bit/EFREE-RESULT.json a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/research/paired-query-only-bit/EFREE-RESULT.json +pr7209/verify.py e153760831952878b5def1776811ea182ea6f3876f09262f7e81a10991ddbd94 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/pr7209/verify.py +pr7209/RESULT.json 0cba78ea171cea0327bb59d95fd4e7ddb45ce004a7966de763e3f18346e1aea1 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/pr7209/RESULT.json +pr7244/PROPOSED-CLAIM.json 14e52a8a25f8f47fa8a9b1429246fa73f047707b4cc51a575154b60788b9e688 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/pr7244/PROPOSED-CLAIM.json +round22/verify.py 6c911eb044f9342459be2e21ef6c9c27d1c1fd47e58be87873c6e9656047c948 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round22/verify.py +round22/RESULT.json 6f4c3afc1185668de6e98ea1608170ae9db8ee5c2c5318b5d5a6577d609252e3 regenerated by predecessor/round22/verify.py +round22/SOURCES.tsv 963e6412a7d3c6fdca55bfb5c7cddcf80c21f2a5ac99162a2c20ffb00bfe77e6 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round22/SOURCES.tsv +round23/verify.py b5b776fe7a5b9a99c256bf6a013831c9707ff54fb1df28f0867acc3a5b2e0ad2 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round23/verify.py +round23/RESULT.json 16863072b372547b6a062210da4d338704ce680ec22cd5e4e6702560c93a1bf7 regenerated by predecessor/round23/verify.py +round23/SOURCES.tsv a528875c1092556b60bb77af66ca85b2a8302ea12ae4e4b746891c37fc605dc2 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round23/SOURCES.tsv +pr7258/SUMMARY.json b4f35a88da911a3b935aa3f4bbf3c921906d60df147e068bacb5b5ca66b0bfa0 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/inputs/pr7258/SUMMARY.json +round24/verify.py 80e4ca5de690c76b266888a9307874d07a4f90c11bba4e42f87ddb45f9221380 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round24/verify.py +round24/RESULT.json 1acd03fec0213cda8c44f4914c4c0b0c2e2124d7a0dc0586689e80bbc0fb8646 regenerated by predecessor/round24/verify.py +round24/SOURCES.tsv d60d52cfb3f4ee7db18fac70cf94e93bae94e22974fcbc59403b353541bdab15 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/round24/SOURCES.tsv +bit-price/RESULT.json 3583ea672516c4def2d3973fcc5fd75e8903c2ad9f6c7154df4df1fd1bb349c7 regenerated by predecessor/bit-price/verify.py +bit-price/verify.py 2a6eac8cdfd1c7d3a6caafca1adf103ebf84b3af26be214b99911fc4155f474c https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/predecessor/bit-price/verify.py +round25/verify.py 4fb801c8219cf4f356b9eab7108a8f2497cc3bc49b089d87086b8ba3c8b13a84 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/prior.py +round25/RESULT.json 42d7c43180690bcbd062fe011d3e4a0f12305d952e823afb34a1f76a4872b82b regenerated by predecessor/round25/verify.py +round25/SOURCES.tsv f7d91bad2f7fb645e7d931a9aaeb1e572ed864c7d6057eae53c2f6eefa05a7e9 https://github.com/ToikY/integer-mult-bounds/blob/a5de6fb272e58809ca95cc2c67919cab5e8b79bc/research/bit-late-exterior-compensation/SOURCES.tsv diff --git a/research/bit-first-observer-compensation/SUMMARY.json b/research/bit-first-observer-compensation/SUMMARY.json new file mode 100644 index 0000000000..89c8b8f4d9 --- /dev/null +++ b/research/bit-first-observer-compensation/SUMMARY.json @@ -0,0 +1,107 @@ +{ + "status": "NO VERIFIED GAIN", + "verified_kappa_gain": "0", + "comparator": "#7244 historical complete comparator and retained BIT premise", + "scope": [ + 60, + 120, + 2266, + 114, + 545 + ], + "scope_labels": [ + "paid_carriers", + "ordinary_slots", + "protected_old_paid_operands", + "exterior_outputs", + "terminal_inputs_deferred" + ], + "rank": [ + 148, + 0 + ], + "nullity": [ + 888, + 1036 + ], + "expanded_singleton_uppers": [ + [ + 0, + 0 + ], + [ + 0, + 0 + ] + ], + "prices": { + "10018846261809/2500000000000000": [ + { + "affordable_upper": false, + "h": 0, + "net_upper": [ + "-35440099400782202260934323046407771172587938313721781806401684833362292952668813/25000000000000000000000000000000000000000000000000000000000000000000000000000000", + "-7088019880156440452186864609281554234517587662744356361280336966672458588321253/5000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "required_expansions": 7, + "stock_upper": 14 + }, + { + "affordable_upper": false, + "h": 1, + "net_upper": [ + "-28793114166721223029740338245620974942029749494541456104883184874631504526472607/25000000000000000000000000000000000000000000000000000000000000000000000000000000", + "-28793114166721223029740338245620974942029749494541456104883184874631504515388981/25000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "required_expansions": 5, + "stock_upper": 16 + }, + { + "affordable_upper": false, + "h": 2, + "net_upper": [ + "-22146128932660243798546353444834178711471560675361130403364684915900716100276401/25000000000000000000000000000000000000000000000000000000000000000000000000000000", + "-22146128932660243798546353444834178711471560675361130403364684915900716089171697/25000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "required_expansions": 4, + "stock_upper": 18 + } + ], + "1002040748181/250000000000000": [ + { + "affordable_upper": false, + "h": 0, + "net_upper": [ + "-515812738550964390635991944267486647976367743110280059743788133088792174226427/312500000000000000000000000000000000000000000000000000000000000000000000000000", + "-41265019084077151250879355541398931838109419448822404779503050647103373926916459/25000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "required_expansions": 8, + "stock_upper": 14 + }, + { + "affordable_upper": false, + "h": 1, + "net_upper": [ + "-1081781653610730146400024779387469637919943565583825210895464333248143746199507/781250000000000000000000000000000000000000000000000000000000000000000000000000", + "-34617012915543364684800792940399028413438194098682406748654858663940599867165463/25000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "required_expansions": 6, + "stock_upper": 16 + }, + { + "affordable_upper": false, + "h": 2, + "net_upper": [ + "-1748062921688098632420139396212445311797935546783900544862916667548614113665893/1562500000000000000000000000000000000000000000000000000000000000000000000000000", + "-27969006747009578118722230339399124988766968748542408717806666680777825807414467/25000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "required_expansions": null, + "stock_upper": 18 + } + ] + }, + "result_bytes": 1256349, + "result_sha256": "6b8b6f0ebc9deee0492ebc99979d735fe3883d901cab897ee9401057fafc2f9a", + "historical_local_receipt_sha256": "52e6e98df27dda203699538fe2ae4177463d8c4f0f1963c38625a1eee8e21bca", + "independent_audit_sha256": "7a020af95126ff7371d361864ff0e381f40d10b72c516547a01c0b608aec3887" +} diff --git a/research/bit-first-observer-compensation/TASK.json b/research/bit-first-observer-compensation/TASK.json new file mode 100644 index 0000000000..ee76163ba6 --- /dev/null +++ b/research/bit-first-observer-compensation/TASK.json @@ -0,0 +1,77 @@ +{ + "schema_version": 1, + "task_id": "bit-helper-contract", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "bit-helper-contract", + "question": "Can a changed G20 helper path or independent-target split improve the complete BIT moment without losing its physical endpoint?", + "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", + "research/g20-helper-split/README.md", + "research/g20-conjugation-admission/README.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": "A full boundary contract and paid profile; unchanged scalar counts alone are insufficient. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.", + "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": "First read #5679/#5708 and their audits as pending component proposals. Choose one uncovered helper group/cut on an exact word; compare arbitrary-input native action, targets, owned storage, both orientations and full signed bill. Stop if the gain is only a scalar count or repaid by lost targets. Do not rerun the frozen #5609 common-frame domain without changing its hypothesis.", + "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": [ + "G20", + "helper split", + "5679", + "5708", + "independent target" + ], + "existing_checks": [ + { + "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": "changed", + "actual_scope": "The exact 60 first old observers of selected rank-seven BIT carriers, 120 touched-owner ordinary correction slots, and their marked recipient spans at fixed literal and owner-quiet clocks.", + "scope_change_reason": "The retained #7001 word and exact #7272 source audit allow a bounded first-observer correction census under the existing all-size BIT premise.", + "bottleneck_link": "The exact retained BIT invoice requires 7, 5 or 4 expanded singleton libraries at the fixed target under zero, one or two separately charged donor splits.", + "budget_minutes": 8, + "stop_rule": "Exhaust 60 carriers and 120 ordinary slots, check 2266 other nonterminal paid operands, 114 exterior outputs and ten singleton banks, then stop below the exact directed stock threshold. No physical prototype is warranted.", + "outcome": "negative-result", + "evidence": "PROOF.md, SUMMARY.json, AUDIT.json, PROVENANCE.tsv and the registered offline replay.", + "author": "ToikY", + "ai_assistance": "OpenAI Codex and subagents materially assisted proof, implementation, independent audit and packaging.", + "open_questions": [ + { + "question": "Can new timed source directions arrive through changed paid chart assignments or differently sourced old work?", + "why_it_matters": "The exhaustive first-observer bound leaves zero additional marked directions at all ten singleton banks, even with the leak equations waived.", + "first_step": "Enumerate the frozen paid ingress and compatible rank-seven target pairs and price all usable balanced chart circulations, including late balancing edges. If the entire family misses the threshold, inventory new typed source jobs and their displaced paid work.", + "blocked_by": "A changed route must clear the directed stock threshold before signed arbitrary-input action, ownership, restoration, precision, tape and complete paid-cost verification." + } + ] +} diff --git a/research/bit-first-observer-compensation/VERIFY.json b/research/bit-first-observer-compensation/VERIFY.json new file mode 100644 index 0000000000..40dd1bae5f --- /dev/null +++ b/research/bit-first-observer-compensation/VERIFY.json @@ -0,0 +1,20 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-B", + "{package}/replay.py", + "--controls" + ], + "timeout_seconds": 540, + "checks": "Authenticate bundled sources, regenerate the five predecessor receipts, reconstruct the 60 exact first observers, independently replay the rank and marked quotients, and reject changed input, duplicate source path, forged clock and forged expansion." + } + ] +} diff --git a/research/bit-first-observer-compensation/audit.py b/research/bit-first-observer-compensation/audit.py new file mode 100644 index 0000000000..0533d34a4b --- /dev/null +++ b/research/bit-first-observer-compensation/audit.py @@ -0,0 +1,233 @@ +"""Independent set-valued causal slots, exact column kernel and receiver rank gaps.""" +from collections import defaultdict +from fractions import Fraction +import gzip +from hashlib import sha256 +import json +from pathlib import Path +import sys + +root,receipt=map(Path,sys.argv[1:]) +r=json.loads(receipt.read_bytes()) +pins={} +for line in Path(__file__).with_name('SOURCES.tsv').read_text().splitlines(): + key,digest,_=line.split('\t') + assert key not in pins + pins[key]=digest +assert pins==r['pins'] + + +def read(key): + raw=(root/key).read_bytes() + assert sha256(raw).hexdigest()==pins[key] + return raw + + +def basis(rows): + pivots={} + for row in rows: + while row: + i=min(row) + if i not in pivots: + pivots[i]=row + break + row^=pivots[i] + return pivots + + +def agree(a,b): + x=basis(a) + y=basis(b) + assert len(x)==len(y)==len(basis([*x.values(),*y.values()])) + + +w=json.loads(gzip.decompress(read('research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz'))) +R22=json.loads(read('round22/RESULT.json')) +R24=json.loads(read('round24/RESULT.json')) +R25=json.loads(read('round25/RESULT.json')) +prior={a['event']:a for a in R25['carriers']} +marks=[p for p in R24['incidence'] if p['marked']] +mark_events=[p['event'] for p in marks] +variants=json.loads(read('pr7209/RESULT.json'))['bank_maps'] +singletons=[b['banks'][0] for b in R22['scope'][1]['endpoint_consistency']['blocks'] if len(b['banks'])==1] +actual={} +for carrier,record in prior.items(): + owner=record['owner'] + program=w['program'] + assert program[carrier]==['MOVE',owner,record['source_chart'],record['target_chart']] + e=next(k for k in range(carrier+1,len(program)) + if program[k][1]==owner or (program[k][0] in ('ADD','SWAP') and program[k][2]==owner)) + op,i,j,f=program[e] + assert op=='ADD' and j==owner and f==record['target_chart'] + actual[carrier]=[('paid',owner,record['source_chart'])] + actual[e]=[('ordinary',i,f),('ordinary',j,f)] +slots=defaultdict(list) +for i,s in enumerate(r['sources']): + assert s['index']==i + assert s['cut']==s['event']+(s['kind']=='ordinary') + slots[s['event']].append(s) +assert {e:[(a['kind'],a['owner'],a['chart']) for a in s] for e,s in slots.items()}==actual +assert len(actual)==120 and len(r['sources'])==180 +N=w['public'] +frames=w['start']+[None]*w['owned_fields'] +old=[frozenset([j]) for j in range(N)]+[frozenset()]*w['owned_fields'] +state=[frozenset()]*len(old) +observations=defaultdict(set) +terminal={} +terminal_markers={} +paid={} +source_bases=[] + + +def bind(event,slots): + chart=slots[0]['chart'] + assert all(frames[s['owner']]==chart for s in slots) + rows={i:(old[i],state[i]) for i,f in enumerate(frames) if f==chart} + raw=set(a for a,_ in rows.values()) + for _,mask in rows.values(): + for i in mask: + raw.update(source_bases[i]) + for s in slots: + given={x['owner']:(frozenset(x['old_row']),frozenset(x['earlier_slots'])) for x in s['source_rows']} + assert given==rows and s['index']==len(source_bases) + b=[frozenset(x) for x in s['causal_source_basis']] + agree(raw,b) + assert len(b)==len(basis(b)) + source_bases.append(b) + + +def observe(i,c): + if state[i]: + observations[frames[i]].add((c,i,state[i])) + + +for t,(op,i,*a) in enumerate(w['program']): + allowed=slots.get(t,[]) + if op=='MOVE': + f,g=a + assert frames[i]==f and f!=1 + if g==1: + terminal[t]=old[i] + terminal_markers[t]=(i,state[i]) + elif not allowed: + paid[t]=state[i] + if allowed: + bind(t,allowed) + s,=allowed + assert s['cut']==t and s['target_chart']==g + assert frozenset(s['old_row'])==old[i] + state[i]^=frozenset([s['index']]) + frames[i]=g + elif op=='ADD': + j,f=a + assert frames[i]==frames[j]==f + old[i]^=old[j] + state[i]^=state[j] + observe(i,t+1) + if allowed: + bind(t,allowed) + for s in allowed: + assert s['cut']==t+1 + k=s['owner'] + state[k]^=frozenset([s['index']]) + observe(k,t+1) + elif op=='SWAP': + j=a[0] + frames[i],frames[j]=frames[j],frames[i] + old[i],old[j]=old[j],old[i] + state[i],state[j]=state[j],state[i] + observe(j,t+1) + else: + assert op in ('INIT','CLEAR') and a[0]!=1 + assert frames[i]==(None if op=='INIT' else a[0]) + frames[i]=a[0] if op=='INIT' else None + old[i]=state[i]=frozenset() + observe(i,t+1) +assert frames==w['final']+[None]*w['owned_fields'] +assert old==[frozenset([j-111,j]) if 111<=j<222 else frozenset([j]) for j in range(N)]+[frozenset()]*w['owned_fields'] +ext={j:state[j] for j,f in enumerate(frames[:N]) if f!=1} +assert len(paid)==2266 and len(ext)==114 and len(terminal)==545 +assert {str(t):sorted(m) for t,m in paid.items() if m}==r['nonzero_protected_markers'] +assert {str(j):sorted(m) for j,m in ext.items() if m}==r['nonzero_exterior_markers'] + + +response=defaultdict(set) +for k,table in enumerate((paid,ext)): + for event,mask in table.items(): + for slot in mask: + response[slot].add((k,event)) +variables=[(i,v) for i,rows in enumerate(source_bases) for v in rows] +columns={} +null=[] +for j,(slot,v) in enumerate(variables): + column=frozenset((k,t,a) for k,t in response[slot] for a in v) + coeff=frozenset([j]) + while column: + p=min(column) + if p not in columns: + columns[p]=(column,coeff) + break + a,b=columns[p] + column^=a + coeff^=b + if not column: + null.append(coeff) +assert len(variables)==1036 and len(columns)==148 and len(null)==888 + + +def exposed(mask,nullbasis): + rows=set() + for v in nullbasis: + row=frozenset() + for k in v: + slot,a=variables[k] + if slot in mask: + row^=a + if row: + rows.add(row) + return rows + + +U=[v for t,v in terminal.items() if t not in mark_events] +W=[v for f,v in zip(frames,old) if f==1] +assert len(basis(U))==523 and len(basis(W))==len(basis(terminal.values()))==545 +assert len(basis(W+list(terminal.values())))==545 +window={p['event']:p['quiet_window'] for p in R24['incidence']} +price=next(x['price'] for x in R25['scopes'][0]['recipients'] if 'price' in x) +summary=[] +for mode,s in enumerate(r['scopes']): + chosen=null if not mode else [frozenset([j]) for j in range(len(variables))] + agree(chosen,[frozenset(v) for v in s['null_basis']]) + assert s['rank']==(148 if not mode else 0) and s['nullity']==len(chosen) + for cm,clock in enumerate(s['clocks']): + assert clock['price']==price + assert all(Fraction(a['net_upper'][1])<0 for b in price.values() for a in b) + assert clock['expanded_singleton_upper']==0 + for j,p in zip(singletons,clock['recipients'],strict=True): + mark=marks[j] + lim=mark['quiet_window'][1] if cm else mark['event'] + charts={mark['source_chart'],*mark['compatible_literal_charts']} + paths={(c,i,f,m) for f in charts for c,i,m in observations[f] if c<=lim} + for var in variants[j]['variants']: + for e in var['virtual_bank_events']: + owner,mm=terminal_markers[e] + if mm and (window[e][0] if cm else e)<=lim: + paths.add((e,owner,var['literal_chart'],mm)) + masks={v[3] for v in paths} + assert masks=={frozenset(a['slots']) for a in p['observed_markers']} + for a in p['observed_markers']: + c,i,f,_=a['witness'] + assert (c,i,f,frozenset(a['slots'])) in paths + raw=set().union(*(exposed(m,chosen) for m in masks)) + assert len(basis(raw))==p['exposed_response_rank'] + oldlib={frozenset(a['row']) for a in R22['scope'][1]['banks'][j]['source_witnesses']} + S=list(oldlib|raw) + lower=U+[terminal[mark['event']]] + # Compute the dimension gap by two sum ranks, independently of + # the marked coordinate map used by the primary implementation. + expansion=21-len(basis(S+W))+len(basis(S+lower)) + assert expansion==len(p['new_quotient_basis'])==0 + summary.append({'scope':s['scope'],'coefficient_rank':s['rank'],'kernel_dimension':s['nullity'], + 'recipient_modes':2,'expanded_singletons':0}) +print(json.dumps({'status':'PASS','causal_slots':180,'coefficients':len(variables),'protected_contacts':2266, + 'exterior_outputs':114,'scopes':summary},sort_keys=True)) diff --git a/research/bit-first-observer-compensation/inputs/pr7209/RESULT.json b/research/bit-first-observer-compensation/inputs/pr7209/RESULT.json new file mode 100644 index 0000000000..07664a3820 --- /dev/null +++ b/research/bit-first-observer-compensation/inputs/pr7209/RESULT.json @@ -0,0 +1,3539 @@ +{ + "bank_maps": [ + { + "event": 25557, + "pivot_quiet_window": [ + 25554, + 28568 + ], + "prefix_input": [ + 21, + 23, + 33, + 43, + 48, + 52, + 77, + 91, + 102, + 280, + 300, + 322, + 343, + 411, + 440, + 462, + 504, + 533, + 553 + ], + "role": 68, + "suffix_response": [ + 47, + 322, + 332, + 333, + 343, + 367, + 488, + 489, + 499, + 533 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1/2", + "1/2", + "0", + "1/2", + "0", + "0", + "1/2" + ], + "outside_dual": [ + 47 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25441, + 25504, + 25557, + 31953, + 31975 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 516, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "0", + "1", + "1", + "0", + "0", + "1" + ], + "outside_dual": [ + 47 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25542, + 25557, + 25577, + 31953, + 31975 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "1", + "-1", + "2", + "1", + "0", + "0", + "1" + ], + "outside_dual": [ + 47 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25450, + 25495, + 25557, + 31953, + 31975 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 588, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "-1", + "1", + "-1", + "0", + "0", + "0", + "0" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25533, + 25557, + 25567, + 31953, + 31975 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 47 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25557, + 31953, + 31975 + ] + } + ], + "viable": false + }, + { + "event": 25675, + "pivot_quiet_window": [ + 25672, + 28489 + ], + "prefix_input": [ + 19, + 22, + 44, + 46, + 54, + 69, + 84, + 92, + 97, + 277, + 328, + 346, + 394, + 426, + 442, + 452, + 521, + 541, + 551 + ], + "role": 75, + "suffix_response": [ + 78, + 233, + 294, + 301, + 307, + 413, + 414, + 538, + 541, + 567, + 600, + 632 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 607, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "1", + "0", + "0", + "-1", + "1" + ], + "outside_dual": [ + 26, + 78 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25660, + 25675, + 25685 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "0", + "-1", + "0", + "-1", + "1", + "-2" + ], + "outside_dual": [ + 78 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 21445, + 25623, + 25675, + 25729 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 566, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "1", + "0", + "0", + "-1", + "0", + "-1" + ], + "outside_dual": [ + 78 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25641, + 25669, + 25675 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "2", + "1", + "0", + "-1", + "-1", + "0" + ], + "outside_dual": [ + 78 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25596, + 25675, + 25701 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 78 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25675 + ] + } + ], + "viable": false + }, + { + "event": 25875, + "pivot_quiet_window": [ + 25872, + 28355 + ], + "prefix_input": [ + 8, + 10, + 46, + 60, + 69, + 72, + 107, + 110, + 365, + 392, + 400, + 472, + 478, + 563, + 617 + ], + "role": 65, + "suffix_response": [ + 46, + 290, + 324, + 328, + 329, + 330, + 338, + 365, + 377, + 438, + 528, + 537, + 559, + 594, + 606, + 617 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 513, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "1", + "-1", + "0", + "0", + "1", + "-1", + "0" + ], + "outside_dual": [ + 46 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 25860, + 25869, + 25875 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1", + "1", + "1", + "1", + "-1", + "1", + "-1" + ], + "outside_dual": [ + 46 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 25777, + 25821, + 25875 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 591, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "0", + "1", + "1", + "0", + "0", + "-1" + ], + "outside_dual": [ + 46 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 25875, + 25894, + 25904 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "1", + "-1", + "1", + "1", + "1", + "-1", + "-1" + ], + "outside_dual": [ + 46 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 25768, + 25831, + 25875 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 46 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 25875 + ] + } + ], + "viable": false + }, + { + "event": 25935, + "pivot_quiet_window": [ + 25932, + 28316 + ], + "prefix_input": [ + 23, + 33, + 43, + 48, + 52, + 61, + 68, + 77, + 91, + 280, + 300, + 322, + 343, + 367, + 387, + 411, + 440, + 499, + 504, + 553 + ], + "role": 102, + "suffix_response": [ + 281, + 450, + 467, + 503, + 504, + 533, + 564, + 585 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1", + "1", + "-1", + "-1", + "1", + "1", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25935, + 25979, + 26031 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 551, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "-1", + "0", + "0", + "0", + "0", + "1", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25913, + 25935, + 25944 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1", + "-1", + "1", + "1", + "-1", + "1", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25935, + 25988, + 26041 + ] + }, + { + "compulsory_suffix_group_span_rank": 3, + "literal_chart": 619, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "-1", + "-1", + "1", + "0", + "0" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25919, + 25935, + 25954 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 25935 + ] + } + ], + "viable": false + }, + { + "event": 25997, + "pivot_quiet_window": [ + 25991, + 28278 + ], + "prefix_input": [ + 17, + 27, + 36, + 56, + 62, + 72, + 80, + 89, + 266, + 288, + 307, + 353, + 370, + 399, + 417, + 436, + 496, + 522, + 538 + ], + "role": 80, + "suffix_response": [ + 266, + 294, + 307, + 353, + 496, + 508, + 522 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": 569, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "-1", + "0", + "0", + "-1", + "0", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 25963, + 25988, + 25997 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "0", + "-1", + "0", + "-1", + "1", + "2" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 25944, + 25997, + 26050 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": 609, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "-1", + "0", + "0", + "1", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 25979, + 25997, + 26006 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "-2", + "1", + "0", + "-1", + "-1", + "0" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 25919, + 25997, + 26025 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 25997 + ] + } + ], + "viable": false + }, + { + "event": 26114, + "pivot_quiet_window": [ + 26111, + 28197 + ], + "prefix_input": [ + 0, + 6, + 11, + 16, + 18, + 19, + 24, + 27, + 29, + 223, + 239, + 250, + 262, + 268, + 270, + 281, + 287, + 291, + 493, + 519, + 585, + 609 + ], + "role": 22, + "suffix_response": [ + 276, + 398, + 423, + 519, + 547, + 568 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": 3, + "literal_chart": 617, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "-1", + "1", + "1", + "0", + "0" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26079, + 26098, + 26114 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "1", + "-1", + "0", + "-1", + "-2", + "0", + "-1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26114, + 26124, + 26181 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 518, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "1", + "0", + "-1", + "0", + "-1", + "0", + "-1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26088, + 26108, + 26114 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "1", + "1", + "-2", + "1", + "0", + "0", + "-1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26114, + 26171, + 26225 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26114 + ] + } + ], + "viable": false + }, + { + "event": 26206, + "pivot_quiet_window": [ + 26203, + 28135 + ], + "prefix_input": [ + 12, + 13, + 54, + 56, + 62, + 104, + 105, + 255, + 257, + 347, + 352, + 371, + 467, + 469, + 564, + 618 + ], + "role": 67, + "suffix_response": [ + 338, + 352, + 377, + 382, + 485, + 528, + 564, + 618 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "1", + "1", + "-1", + "1", + "1", + "1", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26098, + 26152, + 26206 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 514, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "0", + "0", + "1", + "1", + "1", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26181, + 26206, + 26215 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "1", + "1", + "-1", + "-1", + "-1", + "-1", + "-1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26088, + 26142, + 26206 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 585, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "1", + "1", + "-1", + "0", + "0", + "0", + "0" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26191, + 26206, + 26225 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26206 + ] + } + ], + "viable": false + }, + { + "event": 26269, + "pivot_quiet_window": [ + 26266, + 28093 + ], + "prefix_input": [ + 10, + 47, + 48, + 53, + 55, + 59, + 64, + 68, + 104, + 249, + 333, + 345, + 350, + 362, + 376, + 390, + 466, + 516, + 546, + 562 + ], + "role": 104, + "suffix_response": [ + 466, + 479, + 616, + 619 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": 3, + "literal_chart": 632, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "0", + "-1", + "0", + "1", + "1", + "0" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26253, + 26269, + 26275 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "1", + "-1", + "-1", + "-1", + "1", + "1", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26269, + 26294, + 26378 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 538, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "1", + "-1", + "0", + "-1", + "0", + "0", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26235, + 26263, + 26269 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1", + "1", + "-1", + "1", + "1", + "1", + "-1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26269, + 26322, + 26350 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26269 + ] + } + ], + "viable": false + }, + { + "event": 26275, + "pivot_quiet_window": [ + 26272, + 28090 + ], + "prefix_input": [ + 1, + 2, + 4, + 7, + 9, + 10, + 11, + 13, + 225, + 227, + 232, + 241, + 247, + 248, + 252, + 256, + 561, + 579, + 597 + ], + "role": 13, + "suffix_response": [ + 35, + 105, + 247, + 248, + 252, + 303, + 304, + 305, + 408, + 431, + 468, + 469, + 510, + 554, + 579, + 597, + 620 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "0", + "0", + "0", + "1", + "0", + "0" + ], + "outside_dual": [ + 35 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26275, + 26285, + 26341 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 632, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "0", + "-1", + "0", + "1", + "1", + "0" + ], + "outside_dual": [ + 35, + 37 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26253, + 26269, + 26275 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "0", + "0", + "1", + "0", + "0", + "-1", + "0" + ], + "outside_dual": [ + 35 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26275, + 26332, + 26388 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 629, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "0", + "1", + "0", + "1", + "-1", + "0" + ], + "outside_dual": [ + 35 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26244, + 26263, + 26275 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 35 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26275 + ] + } + ], + "viable": false + }, + { + "event": 26322, + "pivot_quiet_window": [ + 26316, + 28061 + ], + "prefix_input": [ + 20, + 25, + 32, + 47, + 58, + 61, + 68, + 83, + 90, + 100, + 273, + 298, + 359, + 367, + 387, + 423, + 438, + 458, + 568, + 593, + 606 + ], + "role": 83, + "suffix_response": [ + 367, + 402, + 423, + 499, + 593, + 628 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 559, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "-1", + "0", + "0", + "1", + "1", + "0", + "0" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26285, + 26313, + 26322 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1", + "-1", + "1", + "1", + "1", + "-1", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26244, + 26322, + 26378 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 610, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "-1", + "0", + "0", + "1", + "-1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26303, + 26322, + 26332 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1", + "1", + "-1", + "1", + "1", + "1", + "-1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26269, + 26322, + 26350 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26322 + ] + } + ], + "viable": false + }, + { + "event": 26369, + "pivot_quiet_window": [ + 26363, + 28029 + ], + "prefix_input": [ + 16, + 29, + 37, + 46, + 54, + 62, + 72, + 81, + 88, + 101, + 263, + 309, + 328, + 346, + 370, + 399, + 420, + 433, + 461, + 483, + 589, + 610, + 624 + ], + "role": 79, + "suffix_response": [ + 39, + 94, + 260, + 312, + 313, + 356, + 363, + 446, + 447, + 483, + 501, + 529, + 536, + 558, + 575, + 610, + 624 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "1", + "-1", + "1", + "-1", + "1", + "-1", + "1" + ], + "outside_dual": [ + 39 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26263, + 26303, + 26369 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 567, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "-1", + "0", + "0", + "1", + "0", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26341, + 26369, + 26378 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1", + "-1", + "-1", + "1", + "1", + "1", + "1" + ], + "outside_dual": [ + 39 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26253, + 26313, + 26369 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 601, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "1", + "0", + "1", + "-1", + "0", + "-1", + "0" + ], + "outside_dual": [ + 39 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26350, + 26369, + 26388 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 39 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26369 + ] + } + ], + "viable": false + }, + { + "event": 26425, + "pivot_quiet_window": [ + 26419, + 27991 + ], + "prefix_input": [ + 2, + 47, + 48, + 50, + 60, + 61, + 63, + 65, + 109, + 333, + 337, + 363, + 366, + 372, + 379, + 476, + 486, + 558, + 599 + ], + "role": 108, + "suffix_response": [ + 78, + 233, + 301, + 307, + 413, + 414, + 474, + 538, + 567, + 599, + 600, + 632 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "0", + "1", + "0", + "-1", + "-1", + "2" + ], + "outside_dual": [ + 78 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26425, + 26468, + 26531 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": 532, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "0", + "0", + "0", + "0", + "0", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26397, + 26425, + 26434 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "0", + "1", + "0", + "-1", + "-1", + "-2" + ], + "outside_dual": [ + 78 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26425, + 26477, + 26522 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 631, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "0", + "1", + "0", + "-1", + "-1", + "0" + ], + "outside_dual": [ + 78 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26406, + 26425, + 26443 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 78 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26425 + ] + } + ], + "viable": false + }, + { + "event": 26434, + "pivot_quiet_window": [ + 26428, + 27985 + ], + "prefix_input": [ + 2, + 46, + 49, + 51, + 59, + 62, + 64, + 103, + 228, + 330, + 336, + 361, + 375, + 464, + 514, + 544, + 598 + ], + "role": 106, + "suffix_response": [ + 62, + 79, + 226, + 300, + 369, + 370, + 371, + 415, + 416, + 514, + 553, + 578, + 580, + 598 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "0", + "-1", + "0", + "1", + "-1", + "2" + ], + "outside_dual": [ + 62 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26434, + 26459, + 26540 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 532, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "0", + "0", + "0", + "0", + "0", + "1" + ], + "outside_dual": [ + 62 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26397, + 26425, + 26434 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "0", + "-1", + "0", + "1", + "-1", + "-2" + ], + "outside_dual": [ + 62 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26434, + 26487, + 26512 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 633, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "0", + "-1", + "0", + "1", + "-1", + "0" + ], + "outside_dual": [ + 62 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26416, + 26434, + 26443 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 62 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26434 + ] + } + ], + "viable": false + }, + { + "event": 26477, + "pivot_quiet_window": [ + 26471, + 27957 + ], + "prefix_input": [ + 30, + 44, + 47, + 52, + 61, + 80, + 82, + 325, + 332, + 342, + 418, + 421, + 509, + 540 + ], + "role": 101, + "suffix_response": [ + 61, + 366, + 367, + 368, + 444, + 460, + 509, + 540, + 611, + 612 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 624, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "1", + "0", + "1", + "0", + "-1", + "0", + "-1" + ], + "outside_dual": [ + 61 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26459, + 26477, + 26497 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "0", + "1", + "0", + "-1", + "-1", + "-2" + ], + "outside_dual": [ + 61 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26425, + 26477, + 26522 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 554, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "-1", + "0", + "0", + "0", + "0", + "-1", + "-1" + ], + "outside_dual": [ + 61 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26449, + 26477, + 26487 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-2", + "0", + "-1", + "0", + "1", + "-1", + "0" + ], + "outside_dual": [ + 61 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26416, + 26477, + 26531 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 61 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26477 + ] + } + ], + "viable": false + }, + { + "event": 26546, + "pivot_quiet_window": [ + 26543, + 27909 + ], + "prefix_input": [ + 0, + 6, + 9, + 14, + 15, + 20, + 21, + 23, + 26, + 224, + 238, + 246, + 258, + 260, + 272, + 274, + 279, + 285, + 482, + 501, + 531, + 603 + ], + "role": 28, + "suffix_response": [ + 95, + 224, + 283, + 448, + 449, + 501, + 591, + 603, + 608 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 623, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "1", + "0", + "1", + "0", + "-1", + "0", + "1" + ], + "outside_dual": [ + 90, + 95 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26512, + 26531, + 26546 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "1", + "0", + "0", + "0", + "0", + "0", + "1" + ], + "outside_dual": [ + 95 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26397, + 26449, + 26546 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 625, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "1", + "0", + "-1", + "0", + "1", + "0", + "1" + ], + "outside_dual": [ + 20, + 95 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26522, + 26540, + 26546 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "0", + "0", + "1", + "0", + "-1", + "0", + "0" + ], + "outside_dual": [ + 95 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26443, + 26497, + 26546 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 95 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26546 + ] + } + ], + "viable": false + }, + { + "event": 26596, + "pivot_quiet_window": [ + 26593, + 27877 + ], + "prefix_input": [ + 1, + 7, + 8, + 9, + 10, + 11, + 12, + 13, + 225, + 241, + 243, + 247, + 248, + 252, + 254, + 256, + 561, + 579, + 615 + ], + "role": 4, + "suffix_response": [ + 108, + 232, + 247, + 252, + 474, + 475, + 561, + 579, + 584, + 597, + 615 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 628, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "0", + "1", + "0", + "1", + "1", + "0" + ], + "outside_dual": [ + 108 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26562, + 26580, + 26596 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "0", + "0", + "0", + "0", + "1", + "0" + ], + "outside_dual": [ + 108 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 21445, + 26596, + 26605, + 26657 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 634, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "0", + "-1", + "0", + "-1", + "1", + "0" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26571, + 26590, + 26596 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "0", + "0", + "1", + "0", + "1", + "0", + "0" + ], + "outside_dual": [ + 108 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26596, + 26648, + 26701 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 108 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26596 + ] + } + ], + "viable": false + }, + { + "event": 26648, + "pivot_quiet_window": [ + 26645, + 27843 + ], + "prefix_input": [ + 0, + 6, + 9, + 15, + 21, + 23, + 25, + 26, + 28, + 224, + 238, + 246, + 260, + 274, + 279, + 283, + 285, + 289, + 482, + 501, + 531, + 591 + ], + "role": 20, + "suffix_response": [ + 100, + 224, + 272, + 458, + 459, + 501, + 591, + 596, + 603 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 615, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "1", + "-1", + "1", + "0", + "0" + ], + "outside_dual": [ + 100 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26615, + 26633, + 26648 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "0", + "0", + "1", + "0", + "1", + "0", + "0" + ], + "outside_dual": [ + 100 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26596, + 26648, + 26701 + ] + }, + { + "compulsory_suffix_group_span_rank": 4, + "literal_chart": 620, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "-1", + "-1", + "-1", + "0", + "0" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26624, + 26642, + 26648 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "0", + "1", + "0", + "-1", + "0", + "0", + "0" + ], + "outside_dual": [ + 100 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 21445, + 26552, + 26648, + 26657 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 100 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26648 + ] + } + ], + "viable": false + }, + { + "event": 26682, + "pivot_quiet_window": [ + 26676, + 27824 + ], + "prefix_input": [ + 36, + 41, + 48, + 58, + 63, + 68, + 75, + 84, + 317, + 360, + 373, + 388, + 408, + 425, + 490, + 500, + 510, + 539 + ], + "role": 93, + "suffix_response": [ + 32, + 297, + 298, + 384, + 413, + 444, + 460, + 500, + 510, + 539, + 560, + 569, + 587, + 588, + 629 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "0", + "1", + "2", + "1", + "1", + "0" + ], + "outside_dual": [ + 32 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26580, + 26624, + 26682 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 543, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "-1", + "0", + "1", + "0", + "1", + "0" + ], + "outside_dual": [ + 29, + 32 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 21445, + 26657, + 26682, + 26691 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "0", + "-2", + "-1", + "0", + "-1", + "1", + "0" + ], + "outside_dual": [ + 32 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26571, + 26633, + 26682 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 613, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "1", + "1", + "1", + "0", + "0" + ], + "outside_dual": [ + 32 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26663, + 26682, + 26701 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 32 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26682 + ] + } + ], + "viable": false + }, + { + "event": 26735, + "pivot_quiet_window": [ + 26729, + 27789 + ], + "prefix_input": [ + 10, + 46, + 57, + 60, + 65, + 69, + 72, + 107, + 355, + 365, + 377, + 392, + 400, + 472, + 528, + 563 + ], + "role": 110, + "suffix_response": [ + 281, + 450, + 462, + 467, + 478, + 503, + 533, + 563, + 564, + 585 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 630, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "0", + "0", + "1", + "0", + "-1", + "1", + "0" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26720, + 26735, + 26754 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1", + "1", + "1", + "-1", + "-1", + "1", + "1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26735, + 26788, + 26831 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": 537, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "1", + "-1", + "0", + "1", + "0", + "0", + "-1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26711, + 26735, + 26745 + ] + }, + { + "compulsory_suffix_group_span_rank": 2, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "1", + "-1", + "1", + "1", + "-1", + "1", + "-1" + ], + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26735, + 26782, + 26840 + ] + }, + { + "compulsory_suffix_group_span_rank": 1, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": null, + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26735 + ] + } + ], + "viable": false + }, + { + "event": 26788, + "pivot_quiet_window": [ + 26785, + 27751 + ], + "prefix_input": [ + 18, + 24, + 42, + 56, + 69, + 76, + 93, + 99, + 282, + 319, + 354, + 393, + 410, + 445, + 456, + 576, + 586, + 613 + ], + "role": 86, + "suffix_response": [ + 31, + 94, + 260, + 295, + 296, + 356, + 363, + 446, + 447, + 501, + 529, + 536, + 558, + 576 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1", + "1", + "1", + "-1", + "-1", + "1", + "1" + ], + "outside_dual": [ + 31 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21445, + 26735, + 26788, + 26831 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 606, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "1", + "0", + "0", + "1", + "1" + ], + "outside_dual": [ + 10, + 31 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26772, + 26788, + 26806 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "1", + "-1", + "-1", + "-1", + "-1", + "-1", + "-1", + "-1" + ], + "outside_dual": [ + 31 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26726, + 26788, + 26840 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 562, + "midpoint_kind": "literal", + "midpoint_normal": [ + "1", + "-1", + "0", + "0", + "-1", + "-1", + "0", + "0" + ], + "outside_dual": [ + 31 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26763, + 26788, + 26797 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 31 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26788 + ] + } + ], + "viable": false + }, + { + "event": 26806, + "pivot_quiet_window": [ + 26800, + 27742 + ], + "prefix_input": [ + 0, + 5, + 9, + 11, + 30, + 31, + 36, + 37, + 41, + 44, + 223, + 235, + 245, + 250, + 293, + 295, + 306, + 308, + 316, + 324, + 481, + 507, + 537, + 621 + ], + "role": 37, + "suffix_response": [ + 79, + 226, + 250, + 295, + 300, + 415, + 416, + 477, + 493, + 507, + 553, + 578, + 580, + 601 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 606, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "1", + "0", + "0", + "1", + "1" + ], + "outside_dual": [ + 13, + 39, + 79 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26772, + 26788, + 26806 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "0", + "1", + "0", + "0", + "0", + "0", + "1" + ], + "outside_dual": [ + 79 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26711, + 26806, + 26816 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 611, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "0", + "1", + "-1", + "0", + "0", + "-1", + "1" + ], + "outside_dual": [ + 13, + 34, + 79 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26782, + 26797, + 26806 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "0", + "0", + "1", + "0", + "0", + "1", + "0" + ], + "outside_dual": [ + 79 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26754, + 26806, + 26856 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 79 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26806 + ] + } + ], + "viable": false + }, + { + "event": 26856, + "pivot_quiet_window": [ + 26853, + 27707 + ], + "prefix_input": [ + 0, + 5, + 33, + 35, + 38, + 43, + 236, + 299, + 303, + 310, + 320, + 525, + 552 + ], + "role": 45, + "suffix_response": [ + 0, + 41, + 85, + 222, + 223, + 224, + 236, + 316, + 317, + 427, + 428, + 471, + 511, + 552, + 567, + 572, + 582, + 627 + ], + "variants": [ + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "1", + "0", + "0", + "1", + "0", + "0", + "0" + ], + "outside_dual": [ + 0 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26711, + 26763, + 26856 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 598, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "1", + "0", + "1", + "1", + "0", + "1", + "0" + ], + "outside_dual": [ + 0 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26822, + 26840, + 26856 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "new_join", + "midpoint_normal": [ + "0", + "0", + "0", + "1", + "0", + "0", + "1", + "0" + ], + "outside_dual": [ + 0 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26754, + 26806, + 26856 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": 603, + "midpoint_kind": "literal", + "midpoint_normal": [ + "0", + "1", + "0", + "-1", + "1", + "0", + "-1", + "0" + ], + "outside_dual": [ + 0 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 21349, + 26831, + 26850, + 26856 + ] + }, + { + "compulsory_suffix_group_span_rank": null, + "literal_chart": null, + "midpoint_kind": "generic", + "midpoint_normal": null, + "outside_dual": [ + 0 + ], + "paired_support": false, + "prefix_group_rank": 0, + "virtual_bank_events": [ + 26856 + ] + } + ], + "viable": false + } + ], + "generic_new_midpoint_classes": 22, + "literal_midpoint_classes": 44, + "main_banks": 22, + "new_individual_sites": 0, + "new_rank7_join_classes": 44, + "pending_maps": 0, + "pins": { + "research/paired-query-only-bit/EFREE-RESULT.json": "a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b", + "research/paired-query-only-bit/independent/interval_gate.py": "8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec", + "research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz": "51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78" + }, + "price": { + "10018846261809/2500000000000000": { + "all_added_setup_and_ordinary_work_granted_free": true, + "compatible_stock_upper": 0, + "needed": 21, + "net_upper": [ + "-116920885236312151966669733026671746943354960998634112774448066617923843166741497/25000000000000000000000000000000000000000000000000000000000000000000000000000000", + "-116920885236312151966669733026671746943354960998634112774448066617923843155818557/25000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "still_negative": true + }, + "1002040748181/250000000000000": { + "all_added_setup_and_ordinary_work_granted_free": true, + "compatible_stock_upper": 0, + "needed": 22, + "net_upper": [ + "-61379195196405433164387604068841135185593457417758238625015446846091359378000429/12500000000000000000000000000000000000000000000000000000000000000000000000000000", + "-122758390392810866328775208137682270371186914835516477250030893692182718744942513/25000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "still_negative": true + } + }, + "qualifying_local_pairing_rank": 0, + "scope": "Fixed literal normalized operations and bank graph with virtual rank-one plus rank-one subdivision. Grant all literal coframe clocks and all 185 compatible virtual pivots, including all rank-seven rational chart classes. Mandatory own paid pivot coefficient and outside cancellation. New charts cannot acquire new literal occupants in this model.", + "seconds_cap": 480, + "status": "EXHAUSTED_ONE_STOCK_MAP", + "stock_upper": 0, + "target_group_origins": 410, + "tested_bank_maps": 22, + "viable_banks": [], + "virtual_public_banks": 185 +} diff --git a/research/bit-first-observer-compensation/inputs/pr7209/verify.py b/research/bit-first-observer-compensation/inputs/pr7209/verify.py new file mode 100644 index 0000000000..f2460426f9 --- /dev/null +++ b/research/bit-first-observer-compensation/inputs/pr7209/verify.py @@ -0,0 +1,347 @@ +"""One global main-terminal stock map, granting all old and virtual clocks.""" +from collections import Counter,defaultdict +from fractions import Fraction as Q +from functools import cache +import gzip +from hashlib import sha256 +from importlib.util import module_from_spec,spec_from_file_location +import json +from pathlib import Path +import sys +from time import monotonic + +PINS={ + "research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz":"51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78", + "research/paired-query-only-bit/independent/interval_gate.py":"8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec", + "research/paired-query-only-bit/EFREE-RESULT.json":"a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b", +} + + +def read(root,key): + b=(root/key).read_bytes() + if sha256(b).hexdigest()!=PINS[key]: + raise ValueError(f"SHA-256 mismatch: {key}") + return b + + +def check_time(deadline): + if monotonic()>=deadline: + raise TimeoutError("one stock map exceeded budget") + + +def rref(vectors): + basis={} + for x in vectors: + v=list(x) + for p,u in sorted(basis.items()): + if v[p]: + c=v[p] + v=[a-c*b for a,b in zip(v,u,strict=True)] + p=next((i for i,a in enumerate(v) if a),None) + if p is None: + continue + u=[a/v[p] for a in v] + for j,b in list(basis.items()): + if b[p]: + basis[j]=[a-b[p]*z for a,z in zip(b,u,strict=True)] + basis[p]=u + return tuple(tuple(basis[p]) for p in sorted(basis)) + + +@cache +def join(a,b): + return rref(a+b) + + +def positions(bits): + out=[] + while bits: + p=bits&-bits + out.append(p.bit_length()-1) + bits^=p + return out + + +def sweep(w,ranks,pivots,deadline,reverse=False): + n=w["public"] + frames=(w["final"] if reverse else w["start"])+[None]*w["owned_fields"] + rows=[1<=222 and w["start"][x["final_role"]]==0) + assert major=={2:2,4:2,6:138,7:268} + out={} + for k in (Q("0.0040075385047236"),Q("0.004008162992724")): + base=g.moment(signed,k) + minority=(0,0) + for r,n in helper.items(): + if r<8: + minority=g.add(minority,g.smul(g.sub(g.exact(r),g.power(r,k)),copies*n)) + def terminal(a): + return g.smul(g.add(g.sub(g.power(a+1,k),g.exact(1)), + g.sub(g.power(8-a,k),g.power(8,k))),copies) + own=g.add(base,minority) + for a,n in major.items(): + if a<7: + own=g.add(own,g.smul(terminal(a),n)) + one=terminal(6) + needed=next(n for n in range(23) if g.add(own,g.smul(one,n))[0]>0) + assert g.add(own,g.smul(one,needed-1))[1]<0 + total=g.add(own,g.smul(one,stock)) + out[str(k)]={"compatible_stock_upper":stock,"needed":needed, + "net_upper":g.show(total),"still_negative":total[1]<0, + "all_added_setup_and_ordinary_work_granted_free":True} + return out + + +def run(root,seconds): + deadline=monotonic()+seconds + control() + w=json.loads(gzip.decompress(read(root,"research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz"))) + invoice=json.loads(read(root,"research/paired-query-only-bit/EFREE-RESULT.json")) + assert (w["public"],w["owned_fields"],len(w["program"]))==(659,237,34137) + raw_frames={int(f):v for f,v in w["frames"].items()} + ranks={f:x["dim"] for f,x in raw_frames.items()} + frames={f:rref(tuple(map(Q,row)) for row in x["B"]) for f,x in raw_frames.items()} + assert len(set(frames.values()))==len(frames)==636 + assert all(len(frames[f])==r for f,r in ranks.items()) and ranks[1]==8 + chart={space:f for f,space in frames.items() if ranks[f]==7} + ledger=terminal_ledger(w,ranks) + live=[x for x in ledger if x["paid_rank"]>=2] + source={} + owner={} + for x in live: + i=x["move_event"] + op,j,a,b=w["program"][i] + assert op=="MOVE" and (j,b)==(x["bank_owner_at_move"],1) + assert ranks[a]==x["before_rank"] and i not in source + source[i]=frames[a] + owner[i]=j + main=sorted(x["move_event"] for x in live if x["final_role"]<222) + assert len(live)==len(source)==185 and len(main)==22 + pre,pi,touch=sweep(w,ranks,set(source),deadline) + post,si,_=sweep(w,ranks,set(source),deadline,reverse=True) + group=sum(1<2 else 480 + assert 0= 16^768 of their multiplicities", + "specialized_owned_fields": "D = 19950^768 - W", + "specialized_initial_and_final": 0, + "owned_allocation_records_bound": "2*19950^768", + "product_raw_invocation_count": "sum(i=0..767, 19950^(767-i)*107352^i)", + "split_paid_calls_upper": "292512^768", + "product_or_uniform_word_materialized": false, + "rank_mass_surplus": "positive by separated t-moment advantage; no discarded target mass retained as credit", + "construction": "chronological product; specialize low complete targets to owned zero; retain all original paid calls; split paid calls on disjoint axes", + "uniform_compiler": { + "uniform_saving": "38525299/10000000000", + "gap": "1/10000000000", + "theta": "42/43", + "logarithm_power": 610, + "eta": { + "lower": "0.000000593894111688079899290956", + "upper": "0.000000593894111688079899290957" + }, + "ordinary_base_bound": { + "lower": "1677314.946209111847437090130884726124", + "upper": "1677314.946209111847437090130884726125" + }, + "previous_logarithm_power_fails": true, + "H": 293160000000000, + "N": "2^293160000000000", + "integer_test_exponent": 29316, + "preceding_integer_grid_fails": true, + "proof": "retained separated finite compiler and logarithmic majorant, with all new owned fields charged" + } + }, + "independent_finite_ratios": [ + { + "lower": "0.9999999874567925184826207876", + "upper": "0.9999999874567925184826207877" + }, + { + "lower": "0.8732851491950378396086248370", + "upper": "0.8732851491950378396086248371" + }, + { + "lower": "0.9493708822913205830769062941", + "upper": "0.9493708822913205830769062942" + } + ], + "independent_normalized_upper": { + "lower": "0.9999903669098213250012570639", + "upper": "0.9999903669098213250012570640" + }, + "event_counts": { + "ADD": 362, + "SWAP": 364, + "LOCAL": 36, + "IDLE_ONE": 32, + "QUERY": 4 + }, + "events": 798, + "discarded_source_stream": { + "ADD": 1682, + "SCALE": 100, + "LAMBDA": 82, + "IDLE_ONE": 68, + "SWAP": 91, + "QUERY": 4 + }, + "empty_body_targets": { + "count": 0, + "rank1_productive_credit": 0 + }, + "ordinary_basis_records": 1291152, + "ordinary_visible_records": 363507600, + "whole_job_route_count": 569592, + "whole_job_route_records": 740743004160, + "ordinary_record_allowance": 1000000000000, + "owned_bank_bound": 6878988, + "compiler_constants": { + "U_raw": "sum(i=0..767,19950^(767-i)*107352^i)", + "D": "19950^768-W", + "O": "6878988*U_raw+D", + "G": "1000000000000*U_raw+8*R+2*19950^768", + "E": "64*(Z+N+P+G+1)^3", + "B_constant": "P+E", + "C0": "32*N*B_constant^2" + }, + "ordinary_bootstrap": [ + { + "previous": "17/5000", + "covered": "19262649/5000000000", + "atom": "1/250", + "envelope": "4813399601/1250000000000", + "admitted": "38507/10000000", + "strict_debit": "24601/1250000000000" + }, + { + "previous": "38507/10000000", + "covered": "19262649/5000000000", + "atom": "1/250", + "envelope": "4815653101/1250000000000", + "admitted": "12039/3125000", + "strict_debit": "53101/1250000000000" + } + ], + "negative_controls": { + "missing_LOCAL": "reverse coefficient 0,0", + "missing_QUERY": "reverse coefficient 0,0", + "missing_IDLE_ONE": "reverse coefficient 0,1", + "missing_ADD": "reverse coefficient 0,1", + "missing_SWAP": "reverse coefficient 1,0", + "missing_second_native_in_pair": "reverse coefficient 19,19", + "division_by2_after_specialization": "integral A coefficient after lambda removal", + "QUERY_replaced_by_ADD_despite_q1_pass": "reverse coefficient 1,0", + "root_header_target_declared_identity": "reverse coefficient 19,19" + }, + "odd_port_determinant": { + "ring": "F2[q]/(q^2-1)", + "q_ne_1": true, + "single_layer_root_targets": 2109, + "single_layer_target_determinant": "q", + "allowed_D1_gate_determinants": "1", + "doubled_root_targets": 4218, + "doubled_target_determinant": "1", + "scope": "Fixed19q-targets per chain,111ports,existing scalar caller operations; no extra target or QSELF/owned operator. Not a general obstruction on BIT algorithms." + }, + "assumptions": [ + "native_all_columns", + "owned_erasure", + "compiler", + "precision_tape", + "analytic_recovery" + ], + "scope": "Paired E-free BIT specialization of#6980 with two actual native copies per stage; removes empty-body credit with unchanged complete signed moment crossing of#6834; inherited framework; no new kappa or native theorem reproof.", + "new_global_kappa_claim": false, + "seconds": 11.418902893999984 +} diff --git a/research/bit-first-observer-compensation/inputs/research/paired-query-only-bit/independent/interval_gate.py b/research/bit-first-observer-compensation/inputs/research/paired-query-only-bit/independent/interval_gate.py new file mode 100644 index 0000000000..6d5a751dde --- /dev/null +++ b/research/bit-first-observer-compensation/inputs/research/paired-query-only-bit/independent/interval_gate.py @@ -0,0 +1,127 @@ +#!/usr/bin/env python3 +"""Independent certified fixed-grid intervals (80 decimal places). +ln via 2 atanh after binary range reduction; exp(-x) via alternating +Taylor brackets. Uses only integer floor/ceiling, not Decimal transcendents. +""" +from fractions import Fraction as F +from functools import lru_cache +from pathlib import Path +import json,argparse +B=10**80 + +def ceildiv(a,b):return -((-a)//b) +def exact(q): + q=F(q);return q.numerator*B//q.denominator,ceildiv(q.numerator*B,q.denominator) +def add(a,b):return a[0]+b[0],a[1]+b[1] +def sub(a,b):return a[0]-b[1],a[1]-b[0] +def mul(a,b): + p=[a[i]*b[j] for i in (0,1) for j in (0,1)];return min(p)//B,ceildiv(max(p),B) +def div(a,b): + assert b[0]>0 + p=[F(a[i]*B,b[j]) for i in (0,1) for j in (0,1)] + return min(p).__floor__(),max(p).__ceil__() +def smul(a,q):return mul(a,exact(q)) +def atanh_log(y): + yi=exact(y);yy=mul(yi,yi);p=yi;s=(0,0) + for j in range(100):s=add(s,smul(p,F(2,2*j+1)));p=mul(p,yy) + # 0 <= tail <= 2 y^201/[201(1-y^2)] < 3*(1/3)^201. + return s[0],s[1]+ceildiv(3*B,3**201) +@lru_cache(None) +def log(r): + assert r>=1 + k=r.bit_length()-1;y=F(r-2**k,r+2**k) + a=atanh_log(y);b=atanh_log(F(1,3));return add(a,smul(b,k)) +def expminus(x): + assert 0<=x[0]<=x[1]0 and margins[str(hi)][1]<0 and margins[str(tested)][0]>0 + target=moment(T,tested);paid=moment(P,tested) + alpha=div(paid,target) + # Tail exponent = 1-tested+1/7; argument exp may not be negative. + # r^(1-tested+1/7)=r^(1-tested)* exp(log(r)/7). + def exppos(x): + assert 0<=x[0]<=x[1]0 and gap.numerator==1;step=gap.denominator + wins=lambda j:(step*j+1)**written<2**j + l,h=1,2 + while not wins(h):l,h=h,2*h + while h-l>1: + m=(l+h)//2 + if wins(m):h=m + else:l=m + assert wins(h) and not wins(h-1) + # Monotonicity: upper derivative bound on [0, cap]. + derivative=(0,0) + for rr in T.keys()|P.keys(): + c=T.get(rr,0)-P.get(rr,0);r=int(rr) + term=mul(power(r,cap if c>=0 else 0),log(r));derivative=add(derivative,smul(term,-c)) + assert derivative[1]<0 + result=dict(claim=str(claim),tested=str(tested),raw_bracket=[str(lo),str(hi)],moment_margins={k:show(v) for k,v in margins.items()},moment_margin_float={k:value(v) for k,v in margins.items()},derivative_upper=float(F(derivative[1],B)),alpha=value(alpha),gamma=value(gamma),delta=value(delta),minimum_log_power=lp,written_log_power=written,compiler_gap=str(gap),H=str(step*h),BIT_pin=str(cap),BIT_margin=str(cap-tested)) + # Outer formulas evaluated independently after algebraically substituting + # b=k+5g,a=k+4g,q=k+3g,epsilon=1-g,beta=1-3g. + k=claim;g=gap;b=k+5*g;a=k+4*g;q=k+3*g;ep=1-g;be=1-3*g;r0=g/10;stop=layout=g + sig=1-b;tau=1-a;internal=tau+(1-stop)*max(sig-tau,0);leaf=sig+stop*(1-sig);lam=1-(q+a)/2;xi=ep*(1+q)-F(3,32)+layout;key=be+1-ep + M=[ep*q,a,1-ep+q*be,1-ep+a*be,1-ep+be,F(3,32)+xi-ep,xi+F(1,2)-ep,ep,1-(ep+be+48-128+2)] + checks=[cap-a,b-a,q,b-q,a-q,stop,1-stop,(1-stop)*b-a,1-internal-q,1-leaf-q,lam-tau,lam-sig,lam-internal,1-q-lam,1-q-leaf,ep,1-ep,xi-F(1,2),ep-xi,be,ep-be,1-be,1-(2*xi-2)-r0-be,1-(2*xi-2)-be,1-ep-r0,1-ep,r0,1-key,1-be-2*(1-ep),128-48-be,layout,ep-a,F(1,32)-b,F(2**45-7**16),F(2),2-xi,F(5),1-be,1-be,1-ep,M[2]-M[0],g,k-F('.001730970419199163702738'),1-ep,F(11,2)]+[x-k for x in M] + functional=[1-be,be*(1-F(3,1000)),128-48-ep-be-1,be*(1-F(1,250))] + assert len(checks)==54 and len(functional)==4 and min(checks+functional)>0 + result['outer']=dict(strict_count=54,functional_count=4,minimum_margin=str(min(checks+functional)),BIT_just_below_effective_rejected=(a-F(1,10**12))-a<0) + # Input-lift is only needed on [1-tested_complex,1]. A stronger BIT + # pin is irrelevant to this interval; the source's crude BIT-wide bound + # is not imported beyond its valid range. + pos={7:1,3:1,5:1};neg={9:1,4:1,1:2};d1=(0,0);curvature=(0,0) + for hist,sign in ((pos,1),(neg,-1)): + for r,c in hist.items(): + d1=add(d1,smul(log(r),sign*c*r)) + curvature=add(curvature,smul(mul(log(r),log(r)),c*r)) + lift_cap=cap if cap<=F('.00376669') else tested + assert tested<=lift_cap and F(d1[1],B)+lift_cap*F(curvature[1],B)<0 + lifts={} + for price in (claim,tested): + lift=sub(moment(pos,price),moment(neg,price));assert lift[0]>0 + assert price*(-F(d1[1],B))-price*price*F(curvature[1],B)/2>0 + lifts[str(price)]=show(lift) + result['input_lift']=dict(margins=lifts,interval_kappa_cap=str(lift_cap),derivative_upper_on_required_interval=str(F(d1[1],B)+lift_cap*F(curvature[1],B)),source_BIT_wide_crude_bound_would_be=str(F(d1[1],B)+cap*F(curvature[1],B))) + return result +if __name__=='__main__': + p=argparse.ArgumentParser();p.add_argument('audit');p.add_argument('--claim',default='.00362852408');p.add_argument('--tested',default='.00362852408007');p.add_argument('--lower',default='.00362852408398727978896072723289');p.add_argument('--upper',default='.00362852408398727978896072723290');p.add_argument('--out',required=True);p.add_argument('--bit-pin',default='.00376669');a=p.parse_args() + r=gate(json.loads(Path(a.audit).read_text())['invoice'],a.claim,a.tested,a.lower,a.upper,a.bit_pin);Path(a.out).write_text(json.dumps(r,indent=2)+'\n');print(json.dumps(r,indent=2)) diff --git a/research/bit-first-observer-compensation/inputs/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz b/research/bit-first-observer-compensation/inputs/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz new file mode 100644 index 0000000000..b718d6b284 Binary files /dev/null and b/research/bit-first-observer-compensation/inputs/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz differ diff --git a/research/bit-first-observer-compensation/predecessor/bit-price/verify.py b/research/bit-first-observer-compensation/predecessor/bit-price/verify.py new file mode 100644 index 0000000000..65966652bc --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/bit-price/verify.py @@ -0,0 +1,77 @@ +"""Jointly price marked library expansions and separate BIT split charges.""" +from fractions import Fraction as Q +from hashlib import sha256 +import gzip +import json +from pathlib import Path +import runpy +import sys + + +PRICE = "pr7209/verify.py" +BIT_ROOT = "research/paired-query-only-bit" +GATE = f"{BIT_ROOT}/independent/interval_gate.py" +INVOICE = f"{BIT_ROOT}/EFREE-RESULT.json" +WORD = f"{BIT_ROOT}/retained/inputs/BIT-NATIVE-WORD.json.gz" +PINS = { + PRICE: "e153760831952878b5def1776811ea182ea6f3876f09262f7e81a10991ddbd94", + GATE: + "8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec", + INVOICE: + "a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b", + WORD: + "51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78", +} +INCIDENCE = "1acd03fec0213cda8c44f4914c4c0b0c2e2124d7a0dc0586689e80bbc0fb8646" + + +def auth(path, pin): + contents = path.read_bytes() + if sha256(contents).hexdigest() != pin: + raise ValueError(f"SHA-256 mismatch: {path.name}") + return contents + + +def main(root, incidence): + sources = {path: auth(root / path, pin) for path, pin in PINS.items()} + data = json.loads(auth(incidence, INCIDENCE)) + assert data["completed_incidence_ports"] == 185 and data["pending_incidence_ports"] == 0 + assert len(data["scopes"]) == 2 + for scope in data["scopes"]: + assert not scope["additional_useful_slots_with_old_paid_ingress"] + assert scope["t"]["rank"] == scope["s"]["rank"] == 1 + price = runpy.run_path(str(root / PRICE)) + gate = runpy.run_path(str(root / GATE)) + invoice = json.loads(sources[INVOICE]) + word = json.loads(gzip.decompress(sources[WORD])) + dims = {int(frame): info["dim"] for frame, info in word["frames"].items()} + ledger = price["terminal_ledger"](word, dims) + full = [price["prices"](root, invoice, word, dims, ledger, n) for n in range(23)] + output = {} + for key in (data["target"], data["trial"]): + exponent = Q(key) + charge = gate["smul"](gate["sub"](gate["exact"](2), gate["power"](2, exponent)), 36) + fee_lo, fee_hi = map(Q, gate["show"](charge)) + paid = [] + for h in range(3): + table = [] + for entry in full: + lo, hi = map(Q, entry[key]["net_upper"]) + table.append((lo - h * fee_hi, hi - h * fee_lo)) + n = next((j for j, bounds in enumerate(table) if bounds[1] > 0), None) + if n is None: + assert table[-1][1] < 0 + paid.append({"h": h, "unaffordable": True, "full_net_upper": str(table[-1][1])}) + else: + assert table[n - 1][1] < 0 < table[n][0] + paid.append({"h": h, "needed_marked_returns": n, + "needed_singleton_expansions": n - 12 - 2 * (1 + h), + "previous_net_upper": str(table[n - 1][1]), + "first_net_lower": str(table[n][0])}) + output[key] = paid + print(json.dumps(output, sort_keys=True, indent=2)) + + +if __name__ == "__main__": + assert __debug__ + main(Path(sys.argv[1]), Path(sys.argv[2])) diff --git a/research/bit-first-observer-compensation/predecessor/round22/SOURCES.tsv b/research/bit-first-observer-compensation/predecessor/round22/SOURCES.tsv new file mode 100644 index 0000000000..d12b980b7e --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/round22/SOURCES.tsv @@ -0,0 +1,6 @@ +research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz 51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78 https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz +research/paired-query-only-bit/independent/interval_gate.py 8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/independent/interval_gate.py +research/paired-query-only-bit/EFREE-RESULT.json a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/EFREE-RESULT.json +pr7209/verify.py e153760831952878b5def1776811ea182ea6f3876f09262f7e81a10991ddbd94 https://raw.githubusercontent.com/ToikY/integer-mult-bounds/77feabfe187c669545908f6225dfb7f711d7360c/research/bit-terminal-main-bank-stock/verify.py +pr7209/RESULT.json 0cba78ea171cea0327bb59d95fd4e7ddb45ce004a7966de763e3f18346e1aea1 https://raw.githubusercontent.com/ToikY/integer-mult-bounds/77feabfe187c669545908f6225dfb7f711d7360c/research/bit-terminal-main-bank-stock/RESULT.json +pr7244/PROPOSED-CLAIM.json 14e52a8a25f8f47fa8a9b1429246fa73f047707b4cc51a575154b60788b9e688 https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/4156504fa39efb51c550d218a9b94fe69dbce8f6/research/p104-two-cut-funded-split/PROPOSED-CLAIM.json diff --git a/research/bit-first-observer-compensation/predecessor/round22/verify.py b/research/bit-first-observer-compensation/predecessor/round22/verify.py new file mode 100644 index 0000000000..1a12b3b161 --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/round22/verify.py @@ -0,0 +1,398 @@ +"""Round 22 causal read-only prebirth stocks, exact F2 quotient and matroid gate.""" +from argparse import ArgumentParser +from collections import defaultdict, deque +import gzip +from hashlib import sha256 +from importlib.util import module_from_spec, spec_from_file_location +from itertools import product +import json +from pathlib import Path +from time import monotonic + + +NATIVE = "research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz" +INVOICE = "research/paired-query-only-bit/EFREE-RESULT.json" + + +def encoded(indices): + return sum(1 << i for i in indices) + + +def positions(value): + result = [] + while value: + bit = value & -value + result.append(bit.bit_length()-1) + value ^= bit + return result + + +def insert(basis, row, tag=0): + while row: + p = row.bit_length()-1 + if p not in basis: + basis[p] = row, tag + return True, tag + v, g = basis[p] + row ^= v + tag ^= g + return False, tag + + +def reduce(basis, row): + rem = tag = 0 + while row: + p = row.bit_length()-1 + if p in basis: + v, g = basis[p] + row ^= v + tag ^= g + else: + b = 1 << p + row ^= b + rem ^= b + return rem, tag + + +def rnk(rows): + basis = {} + for v in rows: + insert(basis, v) + return len(basis) + + +def intersection_projection(rows, terminal): + """Eliminate V's image outside W while retaining each literal row expression.""" + outside, quotient = {}, {} + for row in rows: + residual, _ = reduce(terminal, row) + independent, inside = insert(outside, residual, row) + if not independent: + rem, coeff = reduce(terminal, inside) + assert rem == 0 + insert(quotient, coeff, inside) + return len(rows)-len(outside), [quotient[k] for k in sorted(quotient)] + + +def transversal(bases): + """Matroid intersection. Return maximum independent representatives and Rado witness.""" + nodes = [(i, v, r) for i, part in enumerate(bases) for v, r in part] + by_part = defaultdict(list) + for e, (i, _, _) in enumerate(nodes): + by_part[i].append(e) + current = set() + while True: + represented = {nodes[e][0] for e in current} + linear = {} + for e in sorted(current): + assert insert(linear, nodes[e][1], 1 << e)[0] + pred = {e: None for e, (i, _, _) in enumerate(nodes) if i not in represented} + queue = deque(pred) + sink = None + while queue: + e = queue.popleft() + if e in current: + nxt = (f for f in by_part[nodes[e][0]] if f != e) + else: + rem, support = reduce(linear, nodes[e][1]) + if rem: + sink = e + break + nxt = positions(support) + for f in nxt: + if f not in pred: + pred[f] = e + queue.append(f) + if sink is None: + restricted = sorted((set(range(len(bases))) - represented) | + {nodes[e][0] for e in current if e in pred}) + restricted_rank = rnk(v for i in restricted for v, _ in bases[i]) + assert len(current) == len(bases)-len(restricted)+restricted_rank + return [nodes[e] for e in sorted(current)], restricted, restricted_rank + e = sink + before = len(current) + while e is not None: + current.symmetric_difference_update([e]) + e = pred[e] + assert len(current) == before+1 + assert len({nodes[e][0] for e in current}) == len(current) + assert rnk(nodes[e][1] for e in current) == len(current) + + +def endpoint_gate(bases, deadline): + """Exhaust every option within disjoint support blocks of the same map.""" + n = len(bases) + neighbors = [set([i]) for i in range(n)] + choices = [] + for i, part in enumerate(bases): + span = [0] + for v, _ in part: + span += [v ^ w for w in span] + for j in positions(v): + neighbors[i].add(j) + neighbors[j].add(i) + assert len(span) == len(set(span)) and 1 << i in span + choices.append(sorted(span)) + found = set() + blocks = [] + for i in range(n): + if i in found: + continue + block = {i} + todo = [i] + while todo: + new = neighbors[todo.pop()] - block + block.update(new) + todo.extend(sorted(new)) + found.update(block) + blocks.append(sorted(block)) + + reports = [] + for block in blocks: + tested = feasible = best_nz = best_rank = 0 + witness = tuple(0 for _ in block) + for delta in product(*(choices[i] for i in block)): + tested += 1 + if monotonic() >= deadline: + raise TimeoutError("same table endpoint consistency checks exceeded cap") + final = [(1 << i) ^ v for i, v in zip(block, delta)] + if rnk(final) != len(block): + continue + feasible += 1 + best_nz = max(best_nz, sum(bool(v) for v in delta)) + independent = rnk(delta) + if independent > best_rank: + best_rank = independent + witness = delta + assert feasible >= 1 and best_rank <= best_nz + reports.append({"banks": block, "tested_choices": tested, + "endpoint_preserving_choices": feasible, + "maximum_nonzero_changes": best_nz, + "maximum_independent_return_directions": best_rank, + "rank_attaining_deltas": [positions(v) for v in witness]}) + return {"blocks": reports, "endpoint_preserving_nonzero_upper": sum(b["maximum_nonzero_changes"] for b in reports), + "endpoint_preserving_independent_upper": sum(b["maximum_independent_return_directions"] for b in reports), + "singleton_own_pivot_only": sum(len(b["banks"]) == 1 for b in reports), + "own_pivot_only_delta_spaces": sum(len(part) == 1 for part in bases)} + + +def controls(): + # One initial greedy choice must be replaced to admit the second bank. + a = transversal([[(1, 1), (2, 2)], [(1, 1)]]) + assert len(a[0]) == 2 and (0, 2, 2) in a[0] + a = transversal([[(1, 1)], [(1, 1)], [], [(2, 2)]]) + assert len(a[0]) == 2 and len(a[1]) == 3 and a[2] == 1 + # Two raw outside-contaminated sources can yield one pure terminal direction. + w = {} + insert(w, 1, 0) + insert(w, 2, 1) + assert intersection_projection([5, 6], w) == (1, [(1, 3)]) + assert intersection_projection([5], w) == (0, []) + # Two rows differing by an unchanged arrival have the same quotient. + assert reduce(w, 3) == reduce(w, 2) == (0, 1) + # A bare own-pivot direction cancels the original row under additive replacement. + endpoint = endpoint_gate([[(1, 1)], [(2, 2), (1, 1)]], monotonic()+1) + assert endpoint["endpoint_preserving_independent_upper"] == 1 + assert endpoint["endpoint_preserving_nonzero_upper"] == 1 + # Invertible endpoint can permit two off-diagonal-looking changes only when + # their diagonal/cross-slot combination preserves the full row rank. + endpoint = endpoint_gate([[(1, 1), (2, 2)], [(1, 1), (2, 2)]], monotonic()+1) + assert endpoint["endpoint_preserving_independent_upper"] == 2 + + +def timeline(w, deadline): + n = w["public"] + q = w["start"]+[None]*w["owned_fields"] + x = [1 << j for j in range(n)]+[0]*w["owned_fields"] + chart = defaultdict(dict) + moves = {} + touch = defaultdict(list) + + def observe(j, cut, kind): + if x[j]: + chart[q[j]].setdefault((j, x[j]), (cut, kind)) + + for j in range(n): + observe(j, 0, "initial") + for t, (op, j, *a) in enumerate(w["program"]): + if t % 1024 == 0 and monotonic() >= deadline: + raise TimeoutError("one 22-bank prebirth map exceeded its cap") + touch[j].append(t) + if op == "MOVE": + f, g = a + assert q[j] == f and f != 1 + moves[t] = (j, f, g, x[j]) + q[j] = g + elif op == "ADD": + k, f = a + assert q[j] == q[k] == f + touch[k].append(t) + x[j] ^= x[k] + elif op == "SWAP": + k, = a + touch[k].append(t) + q[j], q[k] = q[k], q[j] + x[j], x[k] = x[k], x[j] + observe(k, t+1, op) + elif op == "INIT": + assert q[j] is None and a[0] != 1 + q[j], x[j] = a[0], 0 + else: + assert op == "CLEAR" and q[j] == a[0] != 1 + q[j], x[j] = None, 0 + observe(j, t+1, op) + endpoint = [1 << j for j in range(n)]+[0]*w["owned_fields"] + for j in range(111): + endpoint[111+j] ^= 1 << j + assert x == endpoint and q == w["final"]+[None]*w["owned_fields"] + assert len(moves) == 2871 + windows = {} + for t, (j, _, _, _) in moves.items(): + k = touch[j].index(t) + windows[t] = [touch[j][k-1]+1 if k else 0, + touch[j][k+1] if k+1 < len(touch[j]) else len(w["program"])] + return chart, moves, windows, endpoint + + +def library(mark, observations, moves, windows, retime): + t = mark["event"] + owner, source, target, original = moves[t] + assert target == 1 and original == encoded(mark["prefix_input"]) + assert mark["pivot_quiet_window"] == windows[t] + horizon = windows[t][1] if retime else t + seen = {} + routes = set() + + def add_chart(f): + for (j, row), (cut, kind) in observations.get(f, {}).items(): + if cut <= horizon and (f, j, row) != (source, owner, original): + witness = ("physical", f, cut, j, kind) + seen.setdefault(row, witness) + routes.add(witness) + + add_chart(source) + for variant in mark["variants"]: + f = variant["literal_chart"] + if f is not None: + add_chart(f) + for e in variant["virtual_bank_events"]: + if e == t: + continue + j, g, last, row = moves[e] + assert last == 1 + available = windows[e][0] if retime else e+1 + if available <= horizon: + witness = ("virtual", g, available, j, e) + seen.setdefault(row, witness) + routes.add(witness) + return seen, len(routes), horizon + + +def raw_basis(rows): + basis = {} + for row in rows: + insert(basis, row) + return [value for value, _ in basis.values()] + + +def scope(marks, observations, moves, windows, terminal, retime, deadline): + bank_rows, bases = [], [] + for mark in marks: + source, count, horizon = library(mark, observations, moves, windows, retime) + rows = raw_basis(sorted(source)) + inside, projected = intersection_projection(rows, terminal) + bases.append(projected) + digest = sha256(json.dumps(sorted((v, w) for v, w in source.items()), separators=(",", ":")).encode()).hexdigest() + # Physical caches are observations at specific clocks. Virtual entries + # are old paid input rows with an exact compatible midpoint certificate. + bank_rows.append({"event": mark["event"], "deadline_cut": horizon, + "observed_coefficient_rows": len(source), "route_observations": count, + "source_rank": len(rows), "source_intersection_terminal_rank": inside, + "projected_rank": len(projected), "source_provenance_sha256": digest, + "source_witnesses": [{"row": positions(v), "path": list(w)} + for v, w in sorted(source.items())], + "quotient_basis": [positions(c) for c, _ in projected]}) + if monotonic() >= deadline: + raise TimeoutError("one 22-bank prebirth map exceeded its cap") + assignment, restricted, subrank = transversal(bases) + endpoint = endpoint_gate(bases, deadline) + return {"scope": "quiet-window union" if retime else "literal birth clock", + "banks": bank_rows, "compatible_stock_upper": len(assignment), + "independent_assignment": [{"bank": i, "event": marks[i]["event"], + "quotient": positions(v), "terminal_row": positions(r)} + for i, v, r in assignment], + "rado_restricted_banks": restricted, "rado_restricted_rank": subrank, + "rado_exact_upper": len(marks)-len(restricted)+subrank, + "endpoint_consistency": endpoint, + "unresolved_target_clearing_assignments_within_scope": 0 if endpoint["endpoint_preserving_independent_upper"] < 21 else 22} + + +def main(root, seconds): + deadline = monotonic()+seconds + controls() + pins = {} + for line in Path(__file__).with_name("SOURCES.tsv").read_text().splitlines(): + name, digest, _ = line.split("\t") + if name in pins: + raise ValueError(f"duplicate source path {name}") + pins[name] = digest + + def read(name): + data = (root/name).read_bytes() + if sha256(data).hexdigest() != pins[name]: + raise ValueError(f"SHA-256 mismatch: {name}") + return data + + for key in pins: + read(key) + peer = json.loads(read("pr7244/PROPOSED-CLAIM.json")) + assert peer["kappa"] == "455671545979/125000000000000" + assert peer["complex_BIT_premise"] == "376669/100000000" + w = json.loads(gzip.decompress(read(NATIVE))) + invoice = json.loads(read(INVOICE)) + maps = json.loads(read("pr7209/RESULT.json"))["bank_maps"] + assert len(maps) == 22 + dims = {int(i): s["dim"] for i, s in w["frames"].items()} + assert [i for i in dims if dims[i] == 8] == [1] and 1 not in w["start"] + chart, moves, windows, endpoint = timeline(w, deadline) + arrivals = {e: row for e, (_, _, g, row) in moves.items() if g == 1} + chosen = [m["event"] for m in maps] + assert len(arrivals) == 545 and len(set(chosen)) == 22 + basis = {} + for t, row in arrivals.items(): + if t not in chosen: + assert insert(basis, row)[0] + assert len(basis) == 523 + for j, t in enumerate(chosen): + assert dims[moves[t][1]] == 6 + assert insert(basis, arrivals[t], 1 << j)[0] + assert len(basis) == 545 + assert all(not reduce(basis, row)[0] for f, row in zip(w["final"], endpoint) if f == 1) + assert rnk(row for f, row in zip(w["final"], endpoint) if f == 1) == 545 + literal = scope(maps, chart, moves, windows, basis, False, deadline) + quiet = scope(maps, chart, moves, windows, basis, True, deadline) + assert literal["compatible_stock_upper"] <= quiet["compatible_stock_upper"] + spec = spec_from_file_location("prior", root/"pr7209/verify.py") + p = module_from_spec(spec) + spec.loader.exec_module(p) + ledger = p.terminal_ledger(w, dims) + for s in (literal, quiet): + s["raw_quotient_price"] = p.prices(root, invoice, w, dims, ledger, s["compatible_stock_upper"]) + endpoint = s["endpoint_consistency"] + s["endpoint_preserving_price"] = p.prices(root, invoice, w, dims, ledger, endpoint["endpoint_preserving_independent_upper"]) + s["endpoint_preserving_nonzero_price"] = p.prices(root, invoice, w, dims, ledger, endpoint["endpoint_preserving_nonzero_upper"]) + return {"status": "NO VERIFIED GAIN", "seconds_cap": seconds, "pins": pins, + "target": "10018846261809/2500000000000000", "retained_BIT_premise": peer["complex_BIT_premise"], + "banks": len(maps), "pending_census_cases": 0, "new_sites": 0, + "unchanged_terminal_rank": 523, "required_terminal_rank": 545, + "scope": [literal, quiet]} + + +if __name__ == "__main__": + parser = ArgumentParser(description=__doc__) + parser.add_argument("root", type=Path) + parser.add_argument("--seconds", type=int, default=480) + args = parser.parse_args() + if not 1 <= args.seconds <= 480: + parser.error("--seconds must be in 1..480") + print(json.dumps(main(args.root, args.seconds), sort_keys=True, indent=2)) diff --git a/research/bit-first-observer-compensation/predecessor/round23/SOURCES.tsv b/research/bit-first-observer-compensation/predecessor/round23/SOURCES.tsv new file mode 100644 index 0000000000..850072eb41 --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/round23/SOURCES.tsv @@ -0,0 +1,9 @@ +research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz 51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78 https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz +research/paired-query-only-bit/independent/interval_gate.py 8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/independent/interval_gate.py +research/paired-query-only-bit/EFREE-RESULT.json a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/EFREE-RESULT.json +pr7209/verify.py e153760831952878b5def1776811ea182ea6f3876f09262f7e81a10991ddbd94 https://raw.githubusercontent.com/ToikY/integer-mult-bounds/77feabfe187c669545908f6225dfb7f711d7360c/research/bit-terminal-main-bank-stock/verify.py +pr7209/RESULT.json 0cba78ea171cea0327bb59d95fd4e7ddb45ce004a7966de763e3f18346e1aea1 https://raw.githubusercontent.com/ToikY/integer-mult-bounds/77feabfe187c669545908f6225dfb7f711d7360c/research/bit-terminal-main-bank-stock/RESULT.json +pr7244/PROPOSED-CLAIM.json 14e52a8a25f8f47fa8a9b1429246fa73f047707b4cc51a575154b60788b9e688 https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/4156504fa39efb51c550d218a9b94fe69dbce8f6/research/p104-two-cut-funded-split/PROPOSED-CLAIM.json +round22/verify.py 6c911eb044f9342459be2e21ef6c9c27d1c1fd47e58be87873c6e9656047c948 local-only sealed Round 22 bit/verify.py +round22/RESULT.json 6f4c3afc1185668de6e98ea1608170ae9db8ee5c2c5318b5d5a6577d609252e3 local-only sealed Round 22 bit/RESULT.json +round22/SOURCES.tsv 963e6412a7d3c6fdca55bfb5c7cddcf80c21f2a5ac99162a2c20ffb00bfe77e6 local-only sealed Round 22 bit/SOURCES.tsv diff --git a/research/bit-first-observer-compensation/predecessor/round23/verify.py b/research/bit-first-observer-compensation/predecessor/round23/verify.py new file mode 100644 index 0000000000..97b5b52e37 --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/round23/verify.py @@ -0,0 +1,272 @@ +"""Census of 523 unchanged-geometry BIT terminal donor ports.""" +from argparse import ArgumentParser +from collections import Counter, defaultdict +from fractions import Fraction +import gzip +from hashlib import sha256 +from importlib.util import module_from_spec, spec_from_file_location +import json +from pathlib import Path +from time import monotonic + + +NATIVE = 'research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz' +INVOICE = 'research/paired-query-only-bit/EFREE-RESULT.json' + + +def import_file(name, path): + spec = spec_from_file_location(name, path) + module = module_from_spec(spec) + spec.loader.exec_module(module) + return module + + +def read_pinned(root): + pins = {} + for line in Path(__file__).with_name('SOURCES.tsv').read_text().splitlines(): + name, digest, _ = line.split('\t') + if name in pins: + raise ValueError(f'duplicate dependency path: {name}') + pins[name] = digest + result = {} + for path, digest in pins.items(): + blob = (root/path).read_bytes() + if sha256(blob).hexdigest() != digest: + raise ValueError(f'SHA-256 mismatch: {path}') + result[path] = blob + return pins, result + + +def timeline(w, deadline): + n = w['public'] + frames = w['start'] + [None]*w['owned_fields'] + rows = [1 << i for i in range(n)] + [0]*w['owned_fields'] + observed = defaultdict(dict) + touches = defaultdict(list) + arrivals = {} + + def record(j, cut, op): + if rows[j]: + observed[frames[j]].setdefault((j, rows[j]), (cut, op)) + + for i in range(n): + record(i, 0, 'initial') + for t, (op, i, *args) in enumerate(w['program']): + if t % 1024 == 0 and monotonic() >= deadline: + raise TimeoutError('523-port donor census exceeded cap') + touches[i].append(t) + if op == 'MOVE': + f, g = args + assert frames[i] == f and f != 1 + if g == 1: + peers = {rows[j]: ('live', f, t, j) for j, chart in enumerate(frames) + if j != i and chart == f and rows[j]} + arrivals[t] = i, f, rows[i], peers + frames[i] = g + elif op == 'ADD': + j, f = args + assert frames[i] == frames[j] == f + touches[j].append(t) + rows[i] ^= rows[j] + elif op == 'SWAP': + j, = args + touches[j].append(t) + frames[i], frames[j] = frames[j], frames[i] + rows[i], rows[j] = rows[j], rows[i] + record(j, t+1, op) + else: + assert op in ('INIT', 'CLEAR') and args[0] != 1 + assert frames[i] == (None if op == 'INIT' else args[0]) + frames[i] = args[0] if op == 'INIT' else None + rows[i] = 0 + record(i, t+1, op) + want = [1 << i for i in range(n)] + [0]*w['owned_fields'] + for i in range(111): + want[111+i] ^= 1 << i + assert rows == want and frames == w['final'] + [None]*w['owned_fields'] + assert len(arrivals) == 545 + ends = {} + for t, (i, _, _, _) in arrivals.items(): + uses = touches[i] + j = uses.index(t) + ends[t] = uses[j+1] if j+1 < len(uses) else len(w['program']) + return arrivals, observed, ends, [row for f, row in zip(frames, rows) if f == 1] + + +def components(bases): + parent = list(range(len(bases))) + + def root(i): + while parent[i] != i: + parent[i] = parent[parent[i]] + i = parent[i] + return i + + for i, space in enumerate(bases): + for x, _ in space: + while x: + b = x & -x + j = b.bit_length()-1 + parent[root(j)] = root(i) + x ^= b + groups = defaultdict(list) + for i in range(len(bases)): + groups[root(i)].append(i) + return sorted(groups.values()) + + +def cap(support, shift, old_stock=12): + assert support <= shift <= 22 + return min(22, old_stock + support + shift) + + +def charged_refinements(root, price, word, dims, invoice): + """A separate full-volume positive-rank split for every new donor.""" + interval = import_file('interval', root/'research/paired-query-only-bit/independent/interval_gate.py') + ledger = price.terminal_ledger(word,dims) + copies = len(invoice['native_instances']) + assert copies == 36 + result = [] + for h in range(5): + stock = min(22,14+2*h) + relaxed = price.prices(root,invoice,word,dims,ledger,stock) + row = {'new_charged_donors': h, 'stock_upper': stock, 'also_bounds_all_larger_h': h == 4, + 'directed': {}} + for key, rec in relaxed.items(): + k = Fraction(key) + charge = interval.smul(interval.sub(interval.exact(2),interval.power(2,k)),copies) + lower, upper = map(Fraction,rec['net_upper']) + c0,c1 = map(Fraction,interval.show(charge)) + assert 0 < c0 <= c1 + net = lower-h*c1, upper-h*c0 + assert net[1] < 0 + row['directed'][key] = {'minimum_split_tariff_interval': [str(c0),str(c1)], + 'unbilled_net_upper_interval': [str(lower),str(upper)], + 'net_upper_after_split_lower_tariff': list(map(str,net))} + result.append(row) + return result + + +def run(root, seconds): + deadline = monotonic()+seconds + pins, data = read_pinned(root) + prev = import_file('round22', root/'round22/verify.py') + price = import_file('pr7209', root/'pr7209/verify.py') + assert cap(0, 0) == 12 and cap(4, 4) == 20 and cap(5, 5) == 22 + control = prev.transversal([[(1, 0), (2, 0)], [(1, 0)]]) + assert len(control[0]) == 2 + # An alternative leaving W cannot carry a valid new terminal payload. + example = {} + prev.insert(example, 1, 1) + assert prev.intersection_projection([2], example) == (0, []) + assert prev.intersection_projection([2, 3], example) == (1, [(1, 1)]) + word = json.loads(gzip.decompress(data[NATIVE])) + assert 1 not in word['start'] + dims = {int(f): x['dim'] for f, x in word['frames'].items()} + assert [f for f in dims if dims[f] == 8] == [1] + invoice = json.loads(data[INVOICE]) + peer = json.loads(data['pr7244/PROPOSED-CLAIM.json']) + assert peer['complex_BIT_premise'] == '376669/100000000' + marks = [x['event'] for x in json.loads(data['pr7209/RESULT.json'])['bank_maps']] + prev_result = json.loads(data['round22/RESULT.json']) + quiet = prev_result['scope'][1] + assert [v['event'] for v in quiet['banks']] == marks + old_gate = quiet['endpoint_consistency'] + assert old_gate['endpoint_preserving_independent_upper'] == 12 + singletons = [b['banks'][0] for b in old_gate['blocks'] if len(b['banks']) == 1] + assert len(singletons) == 10 + singleton_mask = prev.encoded(singletons) + arrivals, observed, ends, required = timeline(word, deadline) + donors = sorted(set(arrivals)-set(marks)) + assert len(donors) == 523 + order = donors+marks + marked_offset = len(donors) + W = {} + for i, t in enumerate(order): + assert prev.insert(W, arrivals[t][2], 1 << i)[0] + assert len(W) == prev.rnk(required) == 545 + assert all(not prev.reduce(W, x)[0] for x in required) + marked_spaces = [] + for i, entry in enumerate(quiet['banks']): + raw = prev.raw_basis(prev.encoded(x['row']) for x in entry['source_witnesses']) + _, space = prev.intersection_projection(raw, W) + assert prev.rnk(v >> marked_offset for v, _ in space) == entry['projected_rank'] + marked_spaces.append(space) + all_scopes = [] + for retime in (False, True): + donor_maps = [] + donor_spaces = [] + eligible = [] + full_bases = [] + single_bases = [] + donor_sets = [] + for i, t in enumerate(donors): + j, f, old, live = arrivals[t] + candidates = dict(live) + if retime: + for (owner, row), (cut, op) in observed[f].items(): + if cut <= ends[t] and (owner, row) != (j, old): + candidates.setdefault(row, ('cached', f, cut, owner, op)) + raw = prev.raw_basis(sorted(candidates)) + inside, space = prev.intersection_projection(raw, W) + assert inside == len(space) + donor_spaces.append(space) + coord_space = [(v, row) for v, row in space if v != 1 << i] + # A pure cancellation is infeasible alone. If a bank has more + # choices, its whole span is still a safe upper for its projection. + if coord_space: + eligible.append(i) + mark_b = {} + sing_b = {} + for v, row in space: + proj = v >> marked_offset + prev.insert(mark_b, proj, row) + prev.insert(sing_b, proj & singleton_mask, row) + full_bases.append(list(mark_b.values())) + single_bases.append(list(sing_b.values())) + if mark_b: + donor_sets.append(i) + donor_maps.append({'event': t, 'owner': j, 'source_chart': f, + 'horizon': ends[t] if retime else t, + 'old_row': prev.positions(old), + 'source_rows': [{'row': prev.positions(x), 'witness': path} + for x, path in sorted(candidates.items())], + 'V_intersection_W_rank': inside, + 'projection_marked_basis': [prev.positions(v) for v, _ in mark_b.values()], + 'projection_singleton_basis': [prev.positions(v) for v, _ in sing_b.values()], + 'full_terminal_basis': [prev.positions(v) for v, _ in space]}) + if monotonic() >= deadline: + raise TimeoutError('523-port donor census exceeded cap') + matches = [] + for choices in (full_bases, single_bases): + assignment, restricted, restricted_rank = prev.transversal(choices) + matches.append({'rank': len(assignment), + 'assignments': [{'donor_index': i, 'event': donors[i], 'projection': prev.positions(v), + 'delta': prev.positions(x)} for i, v, x in assignment], + 'rado_restricted': restricted, 'rado_restricted_rank': restricted_rank}) + t, s = (m['rank'] for m in matches) + group = components(donor_spaces+marked_spaces) + caps = cap(s,t) + all_scopes.append({'scope': 'same-chart historical/quiet cache' if retime else 'same-cut physical peers', + 'donors': donor_maps, 'possibly_changed_donors': len(eligible), + 'donors_with_nonzero_old_marked_projection': len(donor_sets), + 'marked_quotient_rank': matches[0], 'isolated_singleton_projection_rank': matches[1], + 'terminal_support_component_sizes': dict(sorted(Counter(map(len,group)).items())), + 'maximum_component': max(map(len,group)), + 'components_with_marks': [[order[k] for k in g] for g in group if any(k>=523 for k in g)], + 'raw_stock_upper': caps, + 'price_upper': price.prices(root, invoice, word, dims, price.terminal_ledger(word,dims),caps)}) + return {'status':'NO VERIFIED GAIN','pins':pins,'seconds_cap':seconds,'completed_donor_slots':523, + 'pending_donor_slots':0,'new_sites':0,'quiet_singleton_mark_positions':singletons, + 'target':'10018846261809/2500000000000000','scopes':all_scopes, + 'one_separately_charged_split_per_additional_donor': charged_refinements(root,price,word,dims,invoice)} + + +if __name__ == '__main__': + p = ArgumentParser(description=__doc__) + p.add_argument('input_root',type=Path) + p.add_argument('--seconds',type=int,default=480) + args = p.parse_args() + if not 1 <= args.seconds <= 480: + p.error('--seconds must be in 1..480') + print(json.dumps(run(args.input_root,args.seconds),sort_keys=True,indent=2)) diff --git a/research/bit-first-observer-compensation/predecessor/round24/SOURCES.tsv b/research/bit-first-observer-compensation/predecessor/round24/SOURCES.tsv new file mode 100644 index 0000000000..d637b693dc --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/round24/SOURCES.tsv @@ -0,0 +1,13 @@ +research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz 51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78 https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz +research/paired-query-only-bit/independent/interval_gate.py 8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/independent/interval_gate.py +research/paired-query-only-bit/EFREE-RESULT.json a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/EFREE-RESULT.json +pr7209/verify.py e153760831952878b5def1776811ea182ea6f3876f09262f7e81a10991ddbd94 https://raw.githubusercontent.com/ToikY/integer-mult-bounds/77feabfe187c669545908f6225dfb7f711d7360c/research/bit-terminal-main-bank-stock/verify.py +pr7209/RESULT.json 0cba78ea171cea0327bb59d95fd4e7ddb45ce004a7966de763e3f18346e1aea1 https://raw.githubusercontent.com/ToikY/integer-mult-bounds/77feabfe187c669545908f6225dfb7f711d7360c/research/bit-terminal-main-bank-stock/RESULT.json +pr7244/PROPOSED-CLAIM.json 14e52a8a25f8f47fa8a9b1429246fa73f047707b4cc51a575154b60788b9e688 https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/4156504fa39efb51c550d218a9b94fe69dbce8f6/research/p104-two-cut-funded-split/PROPOSED-CLAIM.json +round22/verify.py 6c911eb044f9342459be2e21ef6c9c27d1c1fd47e58be87873c6e9656047c948 local-only sealed Round 22 bit/verify.py +round22/RESULT.json 6f4c3afc1185668de6e98ea1608170ae9db8ee5c2c5318b5d5a6577d609252e3 local-only sealed Round 22 bit/RESULT.json +round22/SOURCES.tsv 963e6412a7d3c6fdca55bfb5c7cddcf80c21f2a5ac99162a2c20ffb00bfe77e6 local-only sealed Round 22 bit/SOURCES.tsv +round23/verify.py b5b776fe7a5b9a99c256bf6a013831c9707ff54fb1df28f0867acc3a5b2e0ad2 local sealed Round 23 bit/verify.py +round23/RESULT.json 16863072b372547b6a062210da4d338704ce680ec22cd5e4e6702560c93a1bf7 local sealed Round 23 bit/RESULT.json +round23/SOURCES.tsv a528875c1092556b60bb77af66ca85b2a8302ea12ae4e4b746891c37fc605dc2 local sealed Round 23 bit/SOURCES.tsv +pr7258/SUMMARY.json b4f35a88da911a3b935aa3f4bbf3c921906d60df147e068bacb5b5ca66b0bfa0 https://raw.githubusercontent.com/ToikY/integer-mult-bounds/90a63fbefcf79c3e0c0453ef0741dff8517b6167/research/bit-fixed-payload-quotient-bound/SUMMARY.json diff --git a/research/bit-first-observer-compensation/predecessor/round24/verify.py b/research/bit-first-observer-compensation/predecessor/round24/verify.py new file mode 100644 index 0000000000..74ec88d93e --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/round24/verify.py @@ -0,0 +1,264 @@ +"""One exact 185-port BIT incidence census for old funded rank-seven ingress.""" +from argparse import ArgumentParser +from collections import defaultdict +from fractions import Fraction +import gzip +from hashlib import sha256 +from importlib.util import module_from_spec, spec_from_file_location +import json +from math import lcm +from pathlib import Path +from time import monotonic + +NATIVE = 'research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz' +INVOICE = 'research/paired-query-only-bit/EFREE-RESULT.json' +TARGET = '10018846261809/2500000000000000' +TRIAL = '1002040748181/250000000000000' + + +def load_code(name, path): + s = spec_from_file_location(name,path) + m = module_from_spec(s) + s.loader.exec_module(m) + return m + + +def read(root): + pins, source = {}, {} + for line in Path(__file__).with_name('SOURCES.tsv').read_text().splitlines(): + name,digest,_ = line.split('\t') + if name in pins: + raise ValueError(f'duplicate dependency path: {name}') + pins[name] = digest + data = (root/name).read_bytes() + if sha256(data).hexdigest() != digest: + raise ValueError(f'SHA-256 mismatch: {name}') + source[name] = data + return pins,source + + +def primitive(row): + scale = lcm(*(x.denominator for x in row)) + return tuple(int(x*scale) for x in row) + + +def contains(rows, normal): + return all(sum(a*b for a,b in zip(row,normal,strict=True)) == 0 for row in rows) + + +def paid_timeline(w, deadline): + n = w['public'] + chart = w['start']+[None]*w['owned_fields'] + rows = [1<= deadline: + raise TimeoutError('185-port paid incidence exceeded cap') + touches[i].append(t) + if op == 'MOVE': + f,g = args + assert chart[i] == f and f != 1 + moves[t] = i,f,g,rows[i] + chart[i] = g + elif op == 'ADD': + j,f = args + assert chart[i] == chart[j] == f + touches[j].append(t) + rows[i] ^= rows[j] + elif op == 'SWAP': + j, = args + touches[j].append(t) + chart[i],chart[j] = chart[j],chart[i] + rows[i],rows[j] = rows[j],rows[i] + observe(j,t+1,op) + else: + assert op in ('INIT','CLEAR') and args[0] != 1 + assert chart[i] == (None if op == 'INIT' else args[0]) + chart[i],rows[i] = (args[0] if op == 'INIT' else None),0 + observe(i,t+1,op) + want = [1<>523 + lin.insert(marked,outside,row) + lin.insert(singleton,outside&mask,row) + return list(marked.values()),list(singleton.values()) + + +def rank_receipt(parts,events,lin): + assigned,subset,rank = lin.transversal(parts) + return {'rank':len(assigned),'rado_subset':subset,'rado_subset_rank':rank, + 'directions':[{'port':events[i],'projection':lin.positions(v),'source_row':lin.positions(row)} + for i,v,row in assigned]} + + +def bill(root,pricing,word,dims,invoice,t,s): + g = load_code('price_intervals',root/'research/paired-query-only-bit/independent/interval_gate.py') + ledger = pricing.terminal_ledger(word,dims) + copies = len(invoice['native_instances']) + assert copies == 36 + upper,need = [],[] + for h in range(6): + stock = min(22,12+min(22,t+h)+min(10,s+h)) + raw = pricing.prices(root,invoice,word,dims,ledger,stock) + full = pricing.prices(root,invoice,word,dims,ledger,22) + prices,requirements = {},{} + for key in (TARGET,TRIAL): + charge = g.smul(g.sub(g.exact(2),g.power(2,Fraction(key))),copies) + c0,c1 = map(Fraction,g.show(charge)) + p0,p1 = map(Fraction,raw[key]['net_upper']) + f0,f1 = map(Fraction,full[key]['net_upper']) + assert 0= 0: + requirements[key] = max(0,raw[key]['needed']-12-2*(t+h)) + upper.append({'additional_separately_charged_donors':h,'stock_upper':stock, + 'also_covers_more_charged_donors':h==5,'directed':prices}) + if requirements: + need.append({'additional_separately_charged_donors':h, + 'minimum_changed_singleton_marked_libraries':requirements}) + assert upper[-1]['stock_upper']==22 + return upper,need + + +def run(root,seconds): + deadline = monotonic()+seconds + pins,data = read(root) + lin = load_code('round22',root/'round22/verify.py') + pricing = load_code('pr7209',root/'pr7209/verify.py') + assert contains([(1,0)],(0,1)) and not contains([(1,1)],(0,1)) + prior = json.loads(data['round23/RESULT.json']) + local22 = json.loads(data['round22/RESULT.json']) + public22 = json.loads(data['pr7258/SUMMARY.json']) + peer = json.loads(data['pr7244/PROPOSED-CLAIM.json']) + assert prior['target'] == public22['target'] == TARGET + assert peer['complex_BIT_premise'] == public22['retained_BIT_premise'] == '376669/100000000' + assert public22['receipt_sha256'] == sha256(data['round22/RESULT.json']).hexdigest() + assert public22['scopes'][1]['endpoint_preserving_independent_stock'] == 12 + mark_maps = json.loads(data['pr7209/RESULT.json'])['bank_maps'] + marks = [m['event'] for m in mark_maps] + word = json.loads(gzip.decompress(data[NATIVE])) + invoice = json.loads(data[INVOICE]) + assert 1 not in word['start'] + dims = {int(f):x['dim'] for f,x in word['frames'].items()} + rows = {int(f):[primitive(tuple(Fraction(v) for v in r)) for r in x['B']] for f,x in word['frames'].items()} + normal = {f:primitive(tuple(Fraction(v) for v in pricing.normal(pricing.rref([tuple(map(Fraction,r)) for r in rows[f]])))) + for f in rows if dims[f]==7} + assert len(normal)==120 and [f for f in dims if dims[f]==8]==[1] + paid,window,history,required = paid_timeline(word,deadline) + terminal = {t:v for t,(_,_,g,v) in paid.items() if g==1} + donors = sorted(set(terminal)-set(marks)) + cohort = [t for t in sorted(terminal) if dims[paid[t][1]]<=6] + assert len(terminal)==545 and len(donors)==523 and len(cohort)==185 + assert set(marks)<=set(cohort) + W = {} + for i,t in enumerate(donors+marks): + assert lin.insert(W,terminal[t],1<= deadline: + raise TimeoutError('185-port paid incidence exceeded cap') + i,f,g,old = paid[t] + assert g==1 + mids = [mid for mid,n in normal.items() if contains(rows[f],n)] + if t in marks: + known = [v['literal_chart'] for v in mark_maps[marks.index(t)]['variants'] if v['literal_chart'] is not None] + assert sorted(mids)==sorted(known) + incidence[t] = {'event':t,'owner':i,'source_chart':f,'source_rank':dims[f], + 'paid_rank':8-dims[f],'quiet_window':window[t], 'marked':t in marks, + 'old_row':lin.positions(old),'compatible_literal_charts':mids, 'clocks':[]} + scopes = [] + for retime in (False,True): + all_m,all_s = [],[] + funded_useful, any_useful = [],[] + for t in sorted(terminal): + raw = baseline.get(t,set()) + funded = set() + grant = set() + if t in incidence: + cut = window[t][1] if retime else t + choices = [] + for mid in incidence[t]['compatible_literal_charts']: + paid_rows = [(e,i,f,row) for e,i,f,row in incoming[mid] if e=0 for x in bills) and len(funded_useful)>=2, + 'aggregate_stricter_survives': any(Fraction(x['directed'][TRIAL]['charged_net_upper'][1])>=0 for x in bills) and len(funded_useful)>=3}) + return {'status':'NO VERIFIED GAIN','pins':pins,'target':TARGET,'trial':TRIAL,'seconds_cap':seconds, + 'paid_moves':len(paid),'terminal_arrivals':len(terminal),'completed_incidence_ports':len(cohort), + 'pending_incidence_ports':0,'marked_ports_held_fixed':22,'unmarked_incidence_ports':163, + 'new_sites':0,'scopes':scopes,'incidence':list(incidence.values())} + + +if __name__=='__main__': + cli = ArgumentParser(description=__doc__) + cli.add_argument('input_root',type=Path) + cli.add_argument('--seconds',type=int,default=480) + args = cli.parse_args() + if not 1<=args.seconds<=480: + cli.error('--seconds must be in 1..480') + print(json.dumps(run(args.input_root,args.seconds),sort_keys=True,indent=2)) diff --git a/research/bit-first-observer-compensation/predecessor/round25/AUDIT.json b/research/bit-first-observer-compensation/predecessor/round25/AUDIT.json new file mode 100644 index 0000000000..e79e71a271 --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/round25/AUDIT.json @@ -0,0 +1 @@ +{"carrier_impulses": 60, "exterior_outputs": 114, "protected_paid_contacts": 2266, "scopes": [{"exterior_rank": 88, "joint_rank": 88, "paid_only_rank": 24, "singleton_expansions": 0, "source_scope": "literal other-owner source rows", "variables": 88, "zero_leak_kernel_dimension": 0}, {"exterior_rank": 88, "joint_rank": 88, "paid_only_rank": 24, "singleton_expansions": 0, "source_scope": "causal earlier-carrier closure", "variables": 88, "zero_leak_kernel_dimension": 0}, {"exterior_rank": 148, "joint_rank": 148, "paid_only_rank": 36, "singleton_expansions": 0, "source_scope": "arbitrary current coframed replacement", "variables": 148, "zero_leak_kernel_dimension": 0}], "status": "PASS"} diff --git a/research/bit-first-observer-compensation/predecessor/round25/SOURCES.tsv b/research/bit-first-observer-compensation/predecessor/round25/SOURCES.tsv new file mode 100644 index 0000000000..9bd36d3284 --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/round25/SOURCES.tsv @@ -0,0 +1,18 @@ +research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz 51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78 https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz +research/paired-query-only-bit/independent/interval_gate.py 8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/independent/interval_gate.py +research/paired-query-only-bit/EFREE-RESULT.json a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/e54523517d0f03e58352e647c403a5af3e525a57/research/paired-query-only-bit/EFREE-RESULT.json +pr7209/verify.py e153760831952878b5def1776811ea182ea6f3876f09262f7e81a10991ddbd94 https://raw.githubusercontent.com/ToikY/integer-mult-bounds/77feabfe187c669545908f6225dfb7f711d7360c/research/bit-terminal-main-bank-stock/verify.py +pr7209/RESULT.json 0cba78ea171cea0327bb59d95fd4e7ddb45ce004a7966de763e3f18346e1aea1 https://raw.githubusercontent.com/ToikY/integer-mult-bounds/77feabfe187c669545908f6225dfb7f711d7360c/research/bit-terminal-main-bank-stock/RESULT.json +pr7244/PROPOSED-CLAIM.json 14e52a8a25f8f47fa8a9b1429246fa73f047707b4cc51a575154b60788b9e688 https://raw.githubusercontent.com/CrocSwap/integer-mult-bounds/4156504fa39efb51c550d218a9b94fe69dbce8f6/research/p104-two-cut-funded-split/PROPOSED-CLAIM.json +round22/verify.py 6c911eb044f9342459be2e21ef6c9c27d1c1fd47e58be87873c6e9656047c948 local-only sealed Round 22 bit/verify.py +round22/RESULT.json 6f4c3afc1185668de6e98ea1608170ae9db8ee5c2c5318b5d5a6577d609252e3 local-only sealed Round 22 bit/RESULT.json +round22/SOURCES.tsv 963e6412a7d3c6fdca55bfb5c7cddcf80c21f2a5ac99162a2c20ffb00bfe77e6 local-only sealed Round 22 bit/SOURCES.tsv +round23/verify.py b5b776fe7a5b9a99c256bf6a013831c9707ff54fb1df28f0867acc3a5b2e0ad2 local sealed Round 23 bit/verify.py +round23/RESULT.json 16863072b372547b6a062210da4d338704ce680ec22cd5e4e6702560c93a1bf7 local sealed Round 23 bit/RESULT.json +round23/SOURCES.tsv a528875c1092556b60bb77af66ca85b2a8302ea12ae4e4b746891c37fc605dc2 local sealed Round 23 bit/SOURCES.tsv +pr7258/SUMMARY.json b4f35a88da911a3b935aa3f4bbf3c921906d60df147e068bacb5b5ca66b0bfa0 https://raw.githubusercontent.com/ToikY/integer-mult-bounds/90a63fbefcf79c3e0c0453ef0741dff8517b6167/research/bit-fixed-payload-quotient-bound/SUMMARY.json +round24/verify.py 80e4ca5de690c76b266888a9307874d07a4f90c11bba4e42f87ddb45f9221380 local sealed Round 24 bit/verify.py +round24/RESULT.json 1acd03fec0213cda8c44f4914c4c0b0c2e2124d7a0dc0586689e80bbc0fb8646 local sealed Round 24 bit/RESULT.json +round24/SOURCES.tsv d60d52cfb3f4ee7db18fac70cf94e93bae94e22974fcbc59403b353541bdab15 local sealed Round 24 bit/SOURCES.tsv +bit-price/RESULT.json 3583ea672516c4def2d3973fcc5fd75e8903c2ad9f6c7154df4df1fd1bb349c7 local sealed Round 24 bit-price/RESULT.json +bit-price/verify.py 2a6eac8cdfd1c7d3a6caafca1adf103ebf84b3af26be214b99911fc4155f474c local sealed Round 24 bit-price/verify.py diff --git a/research/bit-first-observer-compensation/predecessor/round25/audit.py b/research/bit-first-observer-compensation/predecessor/round25/audit.py new file mode 100644 index 0000000000..a2195bedb8 --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/round25/audit.py @@ -0,0 +1,191 @@ +"""Independent single-carrier impulse replay and column-rank proof.""" +from fractions import Fraction +import gzip +from hashlib import sha256 +import json +from pathlib import Path +import sys + +root,receipt=map(Path,sys.argv[1:]) +r=json.loads(receipt.read_bytes()) +pins={} +for line in Path(__file__).with_name('SOURCES.tsv').read_text().splitlines(): + path,digest,_=line.split('\t') + assert path not in pins + pins[path]=digest +assert pins==r['pins'] + + +def read(path): + raw=(root/path).read_bytes() + assert sha256(raw).hexdigest()==pins[path] + return raw + + +def span(seq): + pivot={} + for v in seq: + while v: + i=min(v) + if i not in pivot: + pivot[i]=v + break + v^=pivot[i] + return pivot + + +def agree(actual,given): + a=span(actual) + b=span(given) + assert len(a)==len(b)==len(span([*a.values(),*b.values()])) + + +w=json.loads(gzip.decompress(read('research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz'))) +R24=json.loads(read('round24/RESULT.json')) +R22=json.loads(read('round22/RESULT.json')) +price=json.loads(read('bit-price/RESULT.json')) +singletons=[b['banks'][0] for b in R22['scope'][1]['endpoint_consistency']['blocks'] if len(b['banks'])==1] +marked=[x for x in R24['incidence'] if x['marked']] +spec={v['event']:(v['owner'],v['source_chart'],c['chart'],frozenset(v['row']),j) + for j in singletons for c in marked[j]['clocks'][1]['compatible_charts'] for v in c['paid_ingress']} +carriers={a['event']:a for a in r['carriers']} +events=sorted(spec) +assert list(carriers)==events and len(events)==60 +for e,(owner,source,target,row,j) in spec.items(): + a=carriers[e] + assert (a['owner'],a['source_chart'],a['target_chart'],frozenset(a['old_row']),a['recipient'])==(owner,source,target,row,j) + assert a['index']==events.index(e) and a['after_cut']==e+1 +n=w['public'] +size=n+w['owned_fields'] +state=[frozenset([i]) for i in range(n)]+[frozenset()]*w['owned_fields'] +frames=w['start']+[None]*w['owned_fields'] +protected,terminal={},{} +source_rows={} +for t,item in enumerate(w['program']): + op,i=item[:2] + if op=='MOVE': + a,b=item[2:] + assert frames[i]==a and a!=1 + if t in spec: + assert spec[t][:4]==(i,a,b,state[i]) + source_rows[t]={j:state[j] for j,f in enumerate(frames) if j!=i and f==a} + assert source_rows[t]=={x['owner']:frozenset(x['row']) for x in carriers[t]['live_other_coframed_sources']} + elif b!=1: + protected[t]=i + if b==1: + terminal[t]=i + frames[i]=b + elif op=='ADD': + j,a=item[2:] + assert frames[i]==frames[j]==a + state[i]^=state[j] + elif op=='SWAP': + j=item[2] + state[i],state[j]=state[j],state[i] + frames[i],frames[j]=frames[j],frames[i] + else: + assert op in ('INIT','CLEAR') and item[2]!=1 + assert frames[i]==(None if op=='INIT' else item[2]) + frames[i]=item[2] if op=='INIT' else None + state[i]=frozenset() +assert frames==w['final']+[None]*w['owned_fields'] +assert state==[frozenset([i-111,i]) if 111<=i<222 else frozenset([i]) for i in range(n)]+[frozenset()]*w['owned_fields'] +outside=[j for j,f in enumerate(frames[:n]) if f!=1] +assert len(outside)==r['protected_exterior_output_count']==114 +assert len(protected)==r['protected_paid_contact_count']==2266 +assert len(terminal)==r['terminal_arrival_inputs_deferred']==545 + + +def impulse(e): + v=[0]*size + p=[] + peer_changes={} + for t,item in enumerate(w['program']): + op,j=item[:2] + if op=='MOVE': + if t in protected and v[j]: + p.append(t) + if t in spec: + peer_changes[t]=[k for k in source_rows[t] if v[k]] + if t==e: + v[j]^=1 + elif op=='ADD': + v[j]^=v[item[2]] + elif op=='SWAP': + k=item[2] + v[j],v[k]=v[k],v[j] + else: + v[j]=0 + return p,[j for j in outside if v[j]],peer_changes + + +paid_marks={} +exterior_marks={} +paid_columns=[] +exterior_columns=[] +carriers_with_other_old_rows=0 +for k,e in enumerate(events): + p,q,peers=impulse(e) + assert not any(peers.values()) + for j in p: + paid_marks.setdefault(j,[]).append(k) + for j in q: + exterior_marks.setdefault(j,[]).append(k) + paid_columns.append(frozenset(p)) + exterior_columns.append(frozenset(q)) + carriers_with_other_old_rows+=bool(span(source_rows[e].values())) +assert {str(k):v for k,v in paid_marks.items()}==r['nonzero_protected_contact_markers'] +assert {str(k):v for k,v in exterior_marks.items()}==r['nonzero_exterior_markers'] +assert all(not peer['earlier_carriers'] for a in carriers.values() for peer in a['live_other_coframed_sources']) +assert carriers_with_other_old_rows==60 +summary=[] +for s in r['scopes']: + p,q,joint,witness=[],[],[],[] + variables=0 + subset=set(s['exterior_basis_roles']) + for k,(e,rows) in enumerate(zip(events,s['carrier_source_bases'],strict=True)): + assert e==rows['event'] + terms=[frozenset(v) for v in rows['rows']] + other=list(source_rows[e].values()) + if s['source_scope']=='arbitrary current coframed replacement': + other.append(spec[e][3]) + agree(other,terms) + assert len(span(terms))==len(terms) + variables+=len(terms) + for delta in terms: + x=frozenset((0,t,a) for t in paid_columns[k] for a in delta) + y=frozenset((1,t,a) for t in exterior_columns[k] for a in delta) + p.append(x) + q.append(y) + joint.append(x|y) + witness.append(frozenset(k for k in y if k[1] in subset)) + expected=148 if s['source_scope']=='arbitrary current coframed replacement' else 88 + assert variables==s['variables']==expected + assert len(span(p))==s['protected_only_coefficient_rank'] + assert len(span(q))==s['exterior_only_coefficient_rank']==expected + assert len(span(joint))==s['equation_rank']==expected + assert len(span(witness))==expected + assert len(span(frozenset(v) for v in exterior_marks.values()))==s['exterior_scalar_marker_rank']==20 + assert len(subset)==20 and subset<=set(outside) + assert s['joint_kernel_dimension']==0 and not s['kernel_coefficients'] and not s['joint_live_carrier_events'] + for d in s['recipients']: + if 'bank_index' in d: + j=d['bank_index'] + old=R22['scope'][1]['banks'][j] + assert old['quotient_basis']==[[j]] + assert not d['nonzero_joint_response_rows'] and not d['new_quotient_basis'] + else: + assert d['expanded_singleton_upper']==d['independent_recipient_direction_upper']==0 + for trial,entries in d['price'].items(): + for item,threshold in zip(entries,price[trial],strict=True): + h=item['h'] + old=R24['scopes'][1]['paid_refinement_price'][h]['directed'][trial] + assert item['stock_upper']==14+2*h + assert item['net_upper']==old['charged_net_upper'] and Fraction(item['net_upper'][1])<0 + assert item['required_expansions']==threshold.get('needed_singleton_expansions') + assert not item['affordable_upper'] + summary.append({'source_scope':s['source_scope'],'variables':variables,'joint_rank':len(span(joint)), + 'exterior_rank':len(span(q)),'paid_only_rank':len(span(p)), + 'zero_leak_kernel_dimension':variables-len(span(joint)), 'singleton_expansions':0}) +print(json.dumps({'status':'PASS','carrier_impulses':len(events),'protected_paid_contacts':len(protected), + 'exterior_outputs':len(outside),'scopes':summary},sort_keys=True)) diff --git a/research/bit-first-observer-compensation/predecessor/round25/verify.py b/research/bit-first-observer-compensation/predecessor/round25/verify.py new file mode 100644 index 0000000000..c43102089e --- /dev/null +++ b/research/bit-first-observer-compensation/predecessor/round25/verify.py @@ -0,0 +1,310 @@ +"""Joint 60-carrier literal BIT perturbation and endpoint quotient gate.""" +from argparse import ArgumentParser +from collections import defaultdict +from fractions import Fraction +import gzip +from hashlib import sha256 +from importlib.util import module_from_spec,spec_from_file_location +import json +from pathlib import Path +from time import monotonic + +NATIVE='research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz' +INVOICE='research/paired-query-only-bit/EFREE-RESULT.json' +TARGET='10018846261809/2500000000000000' +TRIAL='1002040748181/250000000000000' + + +def load(name,path): + s=spec_from_file_location(name,path) + m=module_from_spec(s) + s.loader.exec_module(m) + return m + + +def read(root): + data,pins={},{} + for line in Path(__file__).with_name('SOURCES.tsv').read_text().splitlines(): + name,digest,_=line.split('\t') + if name in pins: + raise ValueError(f'duplicate dependency path: {name}') + blob=(root/name).read_bytes() + if sha256(blob).hexdigest()!=digest: + raise ValueError(f'SHA-256 mismatch: {name}') + data[name],pins[name]=blob,digest + return data,pins + + +def xor(values): + q=0 + for v in values: + q^=v + return q + + +def record_timeline(word,carriers,watch,virtual,deadline): + n=word['public'] + chart=word['start']+[None]*word['owned_fields'] + old=[1<=deadline: + raise TimeoutError('60-carrier cap expired') + if op=='MOVE': + f,g=a + assert chart[i]==f and f!=1 + if g==1: + terminal[t]=old[i] + for j,mode,mid in virtual.get(t,()): + if mark[i]: + seen[mode][j].setdefault(mark[i],('virtual',t,i,mid)) + elif t not in carriers: + protected[t]=mark[i] + if t in carriers: + e=carriers[t] + assert (e['owner'],e['source_chart'],e['target_chart'],e['old_row'])==(i,f,g,old[i]) + sources[t]=[(k,old[k],mark[k]) for k,c in enumerate(chart) if k!=i and c==f] + mark[i]^=1<=0 and not entry.get('unaffordable',False)}) + return result + + +def run(root,seconds): + deadline=monotonic()+seconds + data,pins=read(root) + lin=load('round22',root/'round22/verify.py') + pricing=load('pr7209',root/'pr7209/verify.py') + controls(lin) + r24=json.loads(data['round24/RESULT.json']) + r22=json.loads(data['round22/RESULT.json']) + tariff=json.loads(data['bit-price/RESULT.json']) + assert [x.get('needed_singleton_expansions') for x in tariff[TARGET]]==[7,5,4] + assert [x.get('needed_singleton_expansions') for x in tariff[TRIAL]]==[8,6,None] + peer=json.loads(data['pr7244/PROPOSED-CLAIM.json']) + assert peer['complex_BIT_premise']=='376669/100000000' + assert r24['scopes'][1]['t']['rank']==r24['scopes'][1]['s']['rank']==1 + marked=[p for p in r24['incidence'] if p['marked']] + marks=[p['event'] for p in marked] + port_window={p['event']:p['quiet_window'] for p in r24['incidence']} + markmap=json.loads(data['pr7209/RESULT.json'])['bank_maps'] + assert [p['event'] for p in markmap]==marks + r22map=r22['scope'][1]['banks'] + singleton=[b['banks'][0] for b in r22['scope'][1]['endpoint_consistency']['blocks'] if len(b['banks'])==1] + assert singleton==[0,1,2,3,4,5,6,10,14,17] + carriers,watch,virtual={},defaultdict(list),defaultdict(set) + for j in singleton: + p=marked[j] + bounds=p['event'],p['quiet_window'][1] + for f in set([p['source_chart'],*p['compatible_literal_charts']]): + watch[f].append((j,bounds)) + for c in p['clocks'][1]['compatible_charts']: + for e in c['paid_ingress']: + t=e['event'] + assert t not in carriers + carriers[t]={'event':t,'after_cut':e['after_cut'],'owner':e['owner'],'source_chart':e['source_chart'], + 'target_chart':c['chart'],'old_row':lin.encoded(e['row']),'recipient':j} + # Also grant changed literal terminal operands along every compatible + # old virtual prefix from the fixed-library predecessor. + for v in markmap[j]['variants']: + for e in v['virtual_bank_events']: + for mode,lim in enumerate(bounds): + eligible=e<=lim if mode==0 else port_window[e][0]<=lim + if eligible: + virtual[e].add((j,mode,v['literal_chart'])) + events=sorted(carriers) + for i,t in enumerate(events): + carriers[t]['index']=i + assert len(events)==60 and len({e['target_chart'] for e in carriers.values()})==20 + word=json.loads(gzip.decompress(data[NATIVE])) + invoice=json.loads(data[INVOICE]) + dims={int(f):v['dim'] for f,v in word['frames'].items()} + source,protected,exterior,terminal,required,seen=record_timeline(word,carriers,watch,virtual,deadline) + donors=sorted(set(terminal)-set(marks)) + assert len(donors)==523 + W={} + for i,t in enumerate(donors+marks): + assert lin.insert(W,terminal[t],1<>523)&~(1<=deadline: + raise TimeoutError('first-read compensation census exceeded cap') + slots=at.get(t,()) + if op=='MOVE': + x,y=args + assert f[i]==x and x!=1 + if y==1: + terminal[t]=old[i] + if a[i]: + for j,mode,mid in virtual.get(t,()): + seen[mode][j].setdefault(a[i],(t,i,mid,'virtual pre-MOVE')) + elif not slots: + paid[t]=a[i] + if slots: + (slot,)=slots + assert (slot['kind'],slot['owner'],slot['chart'],slot['target_chart'],slot['old_row'])==('paid',i,x,y,old[i]) + bind(slots) + a[i]^=1<>523)&~(1<=deadline: + raise TimeoutError('first-read compensation census exceeded cap') + variables,equations,rank,null,solutions=engine.kernel(spaces,contacts,lin) + clocks=[] + for mode in range(2): + recipients=[] + for j in singleton: + old={lin.encoded(v['row']) for v in r22['scope'][1]['banks'][j]['source_witnesses']} + exposed,q=direction_basis(seen[mode][j],solutions,old,W,j,lin) + recipients.append({'bank_index':j,'event':marks[j], + 'observed_markers':[{'slots':lin.positions(m),'witness':p} for m,p in sorted(seen[mode][j].items())], + 'exposed_response_rank':lin.rnk(exposed), + 'new_quotient_basis':[lin.positions(v) for v,_ in q.values()]}) + count=sum(bool(x['new_quotient_basis']) for x in recipients) + clocks.append({'clock':'quiet' if mode else 'literal','recipients':recipients, + 'expanded_singleton_upper':count,'price':engine.price(root,p7209,word,dims,invoice,count,tariff)}) + scopes.append({'scope':scope,'source_variables':len(variables),'equation_rows':len(equations), + 'rank':rank,'nullity':len(null),'null_basis':[lin.positions(x) for x in null], + 'live_slots':[i for i in range(len(slots)) if any(d[i] for d in solutions)],'clocks':clocks}) + return {'status':'NO VERIFIED GAIN','pins':pins,'seconds_cap':seconds,'target':TARGET, + 'paid_carriers':60,'ordinary_observer_clocks':60,'ordinary_slots':120,'pending_slots':0, + 'terminal_inputs_deferred':545,'protected_old_paid_operands':2266,'exterior_outputs':114, + 'new_sites':0,'sources':available_receipts,'scopes':scopes, + 'nonzero_protected_markers':{t:lin.positions(m) for t,m in paid.items() if m}, + 'nonzero_exterior_markers':{j:lin.positions(m) for j,m in ext.items() if m}} + + +if __name__=='__main__': + p=ArgumentParser(description=__doc__) + p.add_argument('input_root',type=Path) + p.add_argument('--seconds',type=int,default=480) + a=p.parse_args() + if not 1<=a.seconds<=480: + p.error('--seconds must be in 1..480') + print(json.dumps(run(a.input_root,a.seconds),sort_keys=True,indent=2)) diff --git a/research/historical-selected-replay-gap/README.md b/research/historical-selected-replay-gap/README.md index 55d8cc3b49..36d9a873ca 100644 --- a/research/historical-selected-replay-gap/README.md +++ b/research/historical-selected-replay-gap/README.md @@ -69,7 +69,11 @@ python3 -B scripts/research_package.py --package research/historical-selected-re The direct command prints `PASS_HISTORICAL_SELECTED_REPLAY_GAP`. A registered replay prints `PASS_REGISTERED_RESEARCH_PACKAGE`. Both require Git history -containing the two inspected commits. +containing the two inspected commits and the source and manifest objects at +`2485805a6d47f36ea83ddde6327d453ac82d44dc`. The verifier uses a temporary +sparse checkout of that commit, checks the declared source digests there, and +uses its planner and manifest inventory. The recorded rejections and selection +therefore remain reproducible after later changes to the live Makefile or CI guide. ## Open next questions diff --git a/research/historical-selected-replay-gap/SOURCES.json b/research/historical-selected-replay-gap/SOURCES.json index c1010eec95..62bb8b3950 100644 --- a/research/historical-selected-replay-gap/SOURCES.json +++ b/research/historical-selected-replay-gap/SOURCES.json @@ -4,13 +4,13 @@ "files": [ { "path": "Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "0d683a06b9e7ee162496108ce9a7c5d2ee94fccf", "sha256": "4f2d4f2dcd15139ec82658a975f85ed300897385f85799218539f4c8d60567da" }, { "path": "certificates/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "eccafa830c16170c36faf93045ddf1f638f7bcd4", "sha256": "4c0b9d37e1034b2076e30a70f8e514416298c462d9ee98bc87fe6556b14df786" }, @@ -22,7 +22,7 @@ }, { "path": "docs/ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "63ba3e9aa8bdc5e942b56e34244b92b16f854085", "sha256": "c7d3027e9ad8bcbff68f07aa9576b30fb2f3c76c44d876d40c7fdbf4a3e2228a" }, @@ -34,163 +34,163 @@ }, { "path": "research/clifford-state-performance/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "6f98a0061a5104dfab82c9e806f819b41811f684", "sha256": "396d0f08df24952248140d5c65c51b8c902ef1c580892ff7ea182890530f67ee" }, { "path": "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "5e0f92af463ec12c5e1dcc3effd44081a88af647", "sha256": "07a9daeaf2bda308a92e9a4684f13d5fc766c7772d74801fceb7f4599fdab226" }, { "path": "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "9e13266bf85e627f1b7dc225e9530ea69fd2c7f0", "sha256": "421e1211fb1897c45621dc6801c276e53f2e6f335583c9c9049e535f87c0a3b1" }, { "path": "research/community-batch932-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "cc4d03eb59b9ab3f952735f7e88ff18c2d15d7af", "sha256": "184629cac91a5cfaca50330a88596008b824221433867dcf8117539c913c284a" }, { "path": "research/community-batch970-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8b9f4111badf7de5d97684799560b55110e9da79", "sha256": "23188ed920e38a54006cb883e181585620821c63bf7e8b5e05d32719417cc37e" }, { "path": "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "a5300d4e7a5381a3f443fc54c768ca6f0f236d68", "sha256": "3c820fb30e1b4d9bcfc6a7ab524375e5b2abd66b940af2c509146104f0bcd79c" }, { "path": "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "d7ff6d777b01d69b6ce84caf25d3b7e4a4d2f211", "sha256": "6b185a9902652f893f3ebd8ada92d2f11b6de6533a9a4d11718a8a4496101128" }, { "path": "research/community-hyperplane599-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "546f37d326d10a99910ae8f908e71ef768524d98", "sha256": "65099d764bfcc39bda5e4d9966783611b094c3522dbdd1435cd498d657a8ef8e" }, { "path": "research/community-k492-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "e538481e4cb16ed936d3195f2dfb5b5a9ca0a76b", "sha256": "2c0f4fa5bc150d05658af2e7c54c4d2c337dd52b7efd3d69530ae73bcbdf452a" }, { "path": "research/community-reconciliation92-audit/MANIFEST.json", - "usage": "input", + "usage": "provenance", "git_blob": "2a2e93685173d5f13cbb5abe740f5d90352e0228", "sha256": "5f501f3c118131e7d069f30ad77186eb2ad6961f9680a0ef105f4514ed41808a" }, { "path": "research/partial-swap-digest/baseline.py", - "usage": "input", + "usage": "provenance", "git_blob": "a2f0190704db83bd8ef48e46e723c49b925804fe", "sha256": "81e9af92cdf38243a540cdcff2062778e449467848d444da37a9553c12ca4c34" }, { "path": "research/r420-two-sided-basis/SOURCES.json", - "usage": "input", + "usage": "provenance", "git_blob": "5d718e11e62f4bcadecf1e02d6b61f87dbe190b0", "sha256": "d9810b0d139c5a1211fd2c1f0d142187cc1fca30026e1e7bc4f9ecfacf1596d1" }, { "path": "research/skip-clones/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8d1bb3b9c8189e35e5d8bfdfa632d7473e8be0d5", "sha256": "0b68e63e35a97ce6b0cdb6e291b88ebaa8f2dd4afb70b2498f10ee89428258dc" }, { "path": "research/split-skip/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "2ab610b6ea2edd2865fda793ef2168b0c76afb4f", "sha256": "7c2b4646a3ecfef6f881da5c43e4bd0fa9a4d1b00548b8ab458d897e16735134" }, { "path": "scripts/historical-ci-inputs/Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "aff68409021c9d401a6f8013b9dfd7dbcc30f2a8", "sha256": "ea8830dd79da493e2d75baf753d733ff7efbcf2b4794afe41fae0ac8f3055646" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "65db599ab0b1dea0312c4ca048e0bd0f44c3736f", "sha256": "96ea543e6c707424afe247e77bd86c82152f90fc76a0773c4232145da5cdf8d1" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "34820a8f24678f918f4d0e7a35380d8013fc3495", "sha256": "628391b6abfbc8674ceec1751867a4392f2cc0b5b66886243e139af86cf355ac" }, { "path": "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "c755b76e0d44ba4917aa94440ebe54daefce5b2a", "sha256": "d7fd929726b326aeeaf0a3996475adec88eee9aac09ae0bebeeaa0bc1fc8f199" }, { "path": "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "7f3c012504187917a728b9fe87043f0fc8cd006a", "sha256": "a854022e0e1d5d4db4d60e586be3ea56005013ef14a1fc06d02bc06e8529c4b0" }, { "path": "scripts/historical-ci-inputs/partial-swap-context.json", - "usage": "input", + "usage": "provenance", "git_blob": "ad65114886bf34a4fd27e79f3be502389e689faa", "sha256": "833a9642f33aeab2ffea17ec9c6b82e0a953f90192b2c82e10bef21538dccba9" }, { "path": "scripts/historical-ci-inputs/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "52075f2463f60af5e16571347f24274fce73a1ea", "sha256": "f3c4be597b2f2136da4ae2cc80c7454f63c90aa01f84e5b8131cee4dd55de815" }, { "path": "scripts/partial_swap/shared.py", - "usage": "input", + "usage": "provenance", "git_blob": "44a0e454c70f9c4b98e258b8443612e6a119904b", "sha256": "5a0646a50b9f3e8ea55168620a78e8853b0ab810517cefc8cfb8696aedee278a" }, { "path": "scripts/replay_historical_check.py", - "usage": "input", + "usage": "provenance", "git_blob": "1e92fff2782970ef71378f594f2350d245a4db26", "sha256": "5467619c78183d3adc82b0cb55af28e5c1a01fca2b0588677816244b53e2bafd" }, { "path": "scripts/research_package.py", - "usage": "input", + "usage": "provenance", "git_blob": "091b4c8f58bac9a9580d76025b887dc5c873d05f", "sha256": "e1256016e7f51827d04fa2179255989f639ae1d97afaa9c16265f85a0c6abd70" }, { "path": "scripts/run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "a96ab35b315ce492e7fbbfd6c5ae211aa066b541", "sha256": "49eb56dd0fc0d8d8ffdb209970a7adf2176223580646f575d5c22e59543b381c" }, { "path": "scripts/verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "6882a4700e410dec569b51ae2eaf1a19cc019195", "sha256": "d6b305eac5b9bdb8172c469ad30a1655a60fa0aceac8b1bf610e1b73f51babd8" }, { "path": "tests/test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "343b24abf6719b81805eba5a84c74e57634c8288", "sha256": "3a5470d0b139828b90e19bf9583ddeafcd69f8e34f2824664eb3a2958a52e34d" } diff --git a/research/historical-selected-replay-gap/VERIFY.json b/research/historical-selected-replay-gap/VERIFY.json index 98553e72ed..ab7efa3471 100644 --- a/research/historical-selected-replay-gap/VERIFY.json +++ b/research/historical-selected-replay-gap/VERIFY.json @@ -4,36 +4,7 @@ "python": "3.12", "requirements": [], "inputs": [ - "Makefile", - "certificates/partial-swap-network.json", - "docs/ci-verification.md", - "research/clifford-state-performance/SOURCE.json", - "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "research/community-batch932-audit/CONTENT-COVERAGE.json", - "research/community-batch970-audit/CONTENT-COVERAGE.json", - "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "research/community-hyperplane599-audit/SOURCE.json", - "research/community-k492-audit/SOURCE.json", - "research/community-reconciliation92-audit/MANIFEST.json", - "research/partial-swap-digest/baseline.py", - "research/r420-two-sided-basis/SOURCES.json", - "research/skip-clones/SOURCE.json", - "research/split-skip/SOURCE.json", - "scripts/historical-ci-inputs/Makefile", - "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "scripts/historical-ci-inputs/partial-swap-context.json", - "scripts/historical-ci-inputs/partial-swap-network.json", - "scripts/partial_swap/shared.py", - "scripts/replay_historical_check.py", - "scripts/research_package.py", - "scripts/run_isolated_tests.py", - "scripts/verify_selected_result.py", - "tests/test_isolated_test_runner.py" + "scripts/research_package.py" ], "commands": [ { diff --git a/research/historical-selected-replay-gap/verify.py b/research/historical-selected-replay-gap/verify.py index 83b995941a..9d266c5a4e 100644 --- a/research/historical-selected-replay-gap/verify.py +++ b/research/historical-selected-replay-gap/verify.py @@ -6,8 +6,10 @@ """ import hashlib import importlib.util +import json import subprocess import sys +import tempfile from pathlib import Path ROOT = Path(__file__).resolve().parents[2] @@ -61,31 +63,47 @@ def require(ok, message): raise SystemExit(message) -def load_checker(): - path = ROOT / "scripts/replay_historical_check.py" - spec = importlib.util.spec_from_file_location("historical_selected_replay_gap_checker", path) +def load_module(path): + spec = importlib.util.spec_from_file_location(path.stem, path) module = importlib.util.module_from_spec(spec) spec.loader.exec_module(module) return module +def checkout_snapshot(snapshot, sources, runner, env): + paths = [runner.canonical_relative_path(row["path"]) for row in sources["files"]] + git = ["git", "-c", "maintenance.auto=false", "-c", "gc.auto=0", + "-c", "core.autocrlf=false"] + subprocess.run([*git, "clone", "--quiet", "--shared", "--no-tags", "--no-checkout", + "--", str(ROOT), str(snapshot)], cwd=ROOT, env=env, check=True) + subprocess.run([*git, "update-ref", "--no-deref", "HEAD", INSPECTED], + cwd=snapshot, env=env, check=True) + # The pinned planner reads omitted manifests from the sparse HEAD/index. + patterns = "".join(f"/{path.as_posix()}\n" for path in paths) + subprocess.run([*git, "sparse-checkout", "set", "--no-cone", "--stdin"], + cwd=snapshot, env=env, input=patterns.encode("utf-8"), check=True) + subprocess.run([*git, "read-tree", "-mu", "HEAD"], cwd=snapshot, env=env, check=True) + for path, row in zip(paths, sources["files"], strict=True): + require(hashlib.sha256((snapshot / path).read_bytes()).hexdigest() == row["sha256"], + "historical checkout source digest changed: " + path.as_posix()) + + def entries(checker): for name, config in checker.CONFIG.items(): for entry in [config, *config.get("additional_inputs", [])]: yield name, entry -def reject(checker, entry): +def reject(root, checker, entry): try: - checker.authenticated_input(ROOT, entry) + checker.authenticated_input(root, entry) except ValueError as exc: return str(exc) raise SystemExit("historical input was admitted: " + entry["path"]) -def main(): - require(not sys.flags.optimize, "assertions must stay enabled") - checker = load_checker() +def check_snapshot(root, env): + checker = load_module(root / "scripts/replay_historical_check.py") selected = [entry for name, entry in entries(checker) if name == "tooling-ledger" and entry["path"] == SELECTED_PATH] require(len(selected) == 1, "selected-result checker overlay is not unique") @@ -94,7 +112,7 @@ def main(): require(entry["accepted_live_sha256"] == [SELECTED_ACCEPTED], "accepted selected-checker successors changed") frozen = (checker.INPUTS / entry["input"]).read_bytes() - live = (ROOT / SELECTED_PATH).read_bytes() + live = (root / SELECTED_PATH).read_bytes() require(hashlib.sha256(frozen).hexdigest() == SELECTED_PIN, "frozen selected checker bytes changed") require(hashlib.sha256(live).hexdigest() == SELECTED_LIVE, "live selected checker digest changed") require(SELECTED_LIVE not in (SELECTED_PIN, SELECTED_ACCEPTED), "live checker was already admitted") @@ -102,7 +120,7 @@ def main(): # live successor, not a broken comparison. require(SELECTED_PIN in (SELECTED_PIN, *entry["accepted_live_sha256"]), "pin membership control failed") - require(reject(checker, entry) == REJECTIONS[SELECTED_PATH][1], + require(reject(root, checker, entry) == REJECTIONS[SELECTED_PATH][1], "selected checker rejection text changed") counts = {path: 0 for path in REJECTIONS} @@ -110,7 +128,7 @@ def main(): for _name, item in entries(checker): if item["path"] not in REJECTIONS: continue - message = reject(checker, item) + message = reject(root, checker, item) counts[item["path"]] += 1 messages.setdefault(item["path"], message) for path, (count, message) in REJECTIONS.items(): @@ -118,20 +136,31 @@ def main(): require(messages[path] == message, "rejection text changed for " + path) require(sum(counts.values()) == 19, "rejection total changed") ci = [item for _name, item in entries(checker) if item["path"] == CI_PATH] - require(len(ci) == 1 and hashlib.sha256((ROOT / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, + require(len(ci) == 1 and hashlib.sha256((root / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, "selected CI note digest changed") diff = subprocess.check_output( - ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=ROOT, text=True) + ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=root, env=env, text=True) changed = sorted(name for name in diff.splitlines() if name) require(changed == CHANGED, "inspected commit diff changed") - sys.path.insert(0, str(ROOT / "scripts")) - from research_package import plan_details - details = plan_details(ROOT, set(changed)) + planner = load_module(root / "scripts/research_package.py") + details = planner.plan_details(root, set(changed)) require([row["package"] for row in details] == PLAN_PACKAGES, "helper plan selection changed") matched = {name for row in details for names in row["causes"].values() for name in names} require(sorted(set(changed) - matched) == UNMATCHED, "unmatched plan paths changed") - require(plan_details(ROOT, set()) == [], "empty change set selected a package") + require(planner.plan_details(root, set()) == [], "empty change set selected a package") + + +def main(): + require(not sys.flags.optimize, "assertions must stay enabled") + sources = json.loads(Path(__file__).with_name("SOURCES.json").read_bytes()) + require(sources["base_commit"] == INSPECTED, "historical checkout base changed") + runner = load_module(ROOT / "scripts/research_package.py") + env = runner.git_source_env() + with tempfile.TemporaryDirectory(prefix="historical-selected-replay-") as temporary: + snapshot = Path(temporary) / "snapshot" + checkout_snapshot(snapshot, sources, runner, env) + check_snapshot(snapshot, env) print("PASS_HISTORICAL_SELECTED_REPLAY_GAP") print("selected_checker_live=" + SELECTED_LIVE) print("rejections=19 distinct_paths=7 plan_packages=9")