diff --git a/research/native-frame-carrying-swaps/LICENSE b/research/native-frame-carrying-swaps/LICENSE new file mode 100644 index 0000000000..261eeb9e9f --- /dev/null +++ b/research/native-frame-carrying-swaps/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/native-frame-carrying-swaps/NOTICE b/research/native-frame-carrying-swaps/NOTICE new file mode 100644 index 0000000000..faa0f8ce7f --- /dev/null +++ b/research/native-frame-carrying-swaps/NOTICE @@ -0,0 +1,7 @@ +Cao Yifan / intqwq: authenticated joint-helper/native-map round-three word, canonical research/kappa-round3-warp-20261022, commit 624de9dc66858af0945e5f8a0942488d62280d43; PR4610 lineage. +Cinna Davis: PR4694 center-free/cache kernel and arbitrary-input raw dual, PR4698 cold-helper basis/conditional consumer; PR4440/4441/4447/4470 lineage. +Dugongue: present ground-chart helper pre-compensation and explicit invertible coded offer, with substantial OpenAI Codex assistance. +Retains native, E8, scalar, Clifford, compiler, precision, outer and contributor notices in the cited upstream sources; zxv, Jacob Alan Sussman, DaysSky, Nick Petalas and Ryanson Jonathan retain predecessor credit. +Apache-2.0. No independent human or formal proof-kernel review is claimed. + +Rohan Arun: PR1931 involutive source reflection and source-restored shear; Ali Romman: PR1862 broader source-code/repair family. Current 632-owner port and dyadic completion prepared by Dugongue with substantial OpenAI Codex assistance. Apache-2.0. diff --git a/research/native-frame-carrying-swaps/README.md b/research/native-frame-carrying-swaps/README.md new file mode 100644 index 0000000000..208814ef24 --- /dev/null +++ b/research/native-frame-carrying-swaps/README.md @@ -0,0 +1,40 @@ +# Frame-carrying weighted swaps in the native round-three word + +This package constructs 534 direct weighted field swaps per orientation from consecutive three-ADD words. Of these, 43 enter with unequal frames. It preserves both specified normalized shears on all 632 independent inputs, including all 408 arbitrary helper inputs, final frames and the cleared owned cell. The recursive paid profile remains `{1:2201, 2:412, 3:510, 4:127, 5:40, 8:8}` in each orientation. **No improved κ is established.** + +## Sufficient algebraic identity and construction + +Let d and s be distinct fields over the rationals and a be nonzero. Chronologically execute d ← d + a s, s ← s − d/a, d ← d + a s. Substitution gives the intermediate pair (d₀ + a s₀, −d₀/a), then the final pair (a s₀, −d₀/a). Thus a direct field exchange followed by these two scalar multipliers has exactly the same linear map for every input, including arbitrary dirty helper values. No assumption of zero operands is used. + +If the input frame assignments are (f, g), the exchange carries them to (g, f). Scalar multiplication commutes with the linear frame transforms, so it can be performed in each carried frame. Unlike three scalar contacts at one shared frame, the exchange itself requires no common containing frame. This assertion concerns the abstract field interface: it is not a free physical tape operation. + +`construct(program)` removes inherited climb events, recognizes exactly these consecutive rational three-ADD patterns, and carries the frames through each swap. At every retained contact or native warp it inserts the required strictly nested transport; it restores every terminal frame. The verifier rejects a construction if any required transport is not nested. Hence this is a sufficient source-specific construction, not a claim that arbitrary programs can be transformed without extra cost. + +The replay proceeds chronologically, enforcing frame equality at each scalar contact and native-warp boundary. A direct swap simultaneously exchanges the two sparse independent-input rows and their frame labels, with exact rational multipliers. Composition of the local identities proves normalized endpoint equality; the executable replay checks every row against both the original word and the specified forward/backward shear. Paid center and climb ranks are counted explicitly. The symbolic native operators and their physical correctness remain inherited source premises. + +## Reproduction + +Python 3.12, standard library only; Linux and Windows paths are resolved relative to this file. + +```sh +python3.12 -I -B research/native-frame-carrying-swaps/verify.py +python3.12 -I -O -B research/native-frame-carrying-swaps/verify.py +python3.12 -B scripts/research_package.py --package research/native-frame-carrying-swaps +python3.12 -B scripts/check_research_commit.py --package research/native-frame-carrying-swaps +``` + +Default verification is read-only and compares fresh results with RESULT.json. `--write` explicitly regenerates that receipt. The `construct` function returns the full rewritten program for downstream experiments; no unpublished optimizer is needed. Sign mutation must fail endpoint comparison; omitting unequal frame carry must fail chronological frame validation. Normal and optimized interpreters enforce explicit exceptions, not assertions. + +The constructor and its chronological replay are separately written but share retained row primitives with the baseline interpreter. This is not a second independent physical interpreter. No fresh Lean/kernel audit, full multiplier replay, hosted CI or human review is claimed. No physical tape-pass saving, scalar cost saving, higher κ or selected-frontier update follows from the unchanged recursive profile. Physical exchange, scale and subsequent transport costs still need a complete implementation and accounting. + +## Scope and overlap + +The three-transvection signed exchange identity is classical. The contribution is its explicit frame-carrying realization on the pinned current native word, with source-bound all-input replay and a reusable changed optimization representation. It does not replace the involutive-dual result in PR #4948 or claim a new caller. PR #4950 discusses coordinate swaps in a different BIT group-algebra model; our operation exchanges whole owner fields and carries their representation labels. No exhaustive novelty claim is made. Prior-session overlap coverage through PR #4955 was targeted; Discussion coverage remains incomplete. At release canonical main was refreshed to b91956876e5b4122fd89179f1b57557ff8378f15; relevant guidance, catalogue and selected record were unchanged from the campaign base. + +## Open next questions + +Can a joint frame/scalar schedule exploit the changed representation to reduce the complete paid bill? Begin with `construct(program)` output and price every transport and physical field movement. This matters because removing forced shared-frame contacts opens feasible representations but the present one has exactly the old paid profile. The blocker is a favorable complete budget, not endpoint correctness. See TASK.json for the structured obligation; bounded unsuccessful searches are not an impossibility proof. + +## Attribution + +Cao Yifan supplied the round-three native source beyond PR #4610. Cinna Davis supplied the retained scalar/helper and selected-result lineage, including PRs #4440 and #4470. Dugongue supplied the transported-frame and retained replay work, including PRs #4935 and #4948. The native/compiler lineage retains zxv and the mixed-target lineage retains Jacob Alan Sussman, together with all source authors listed in NOTICE. RETAINED-SOURCE.md records the exact predecessor. Existing local transvection lemmas motivated the algebraic representation; they were not newly kernel-checked or required as external dependencies. Prepared by Dugongue with substantial OpenAI Codex assistance, solo. Apache-2.0; inherited notices retained. diff --git a/research/native-frame-carrying-swaps/RESULT.json b/research/native-frame-carrying-swaps/RESULT.json new file mode 100644 index 0000000000..d700df66fc --- /dev/null +++ b/research/native-frame-carrying-swaps/RESULT.json @@ -0,0 +1,34 @@ +{ + "source_payload_sha256": "cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd", + "scope": "Exact normalized all-input and chronological-frame control. Inherited native physical maps remain source premises; no new kappa.", + "forward": { + "frame_carry_mutation_rejected": true, + "swaps": 534, + "unequal_input_frames": 43, + "paid": { + "1": 2201, + "3": 510, + "2": 412, + "4": 127, + "8": 8, + "5": 40 + }, + "rows_checked": 632, + "wrong_sign_rejected": true + }, + "backward": { + "frame_carry_mutation_rejected": true, + "swaps": 534, + "unequal_input_frames": 43, + "paid": { + "1": 2201, + "3": 510, + "2": 412, + "4": 127, + "8": 8, + "5": 40 + }, + "rows_checked": 632, + "wrong_sign_rejected": true + } +} diff --git a/research/native-frame-carrying-swaps/RETAINED-SOURCE.md b/research/native-frame-carrying-swaps/RETAINED-SOURCE.md new file mode 100644 index 0000000000..da9d0b957f --- /dev/null +++ b/research/native-frame-carrying-swaps/RETAINED-SOURCE.md @@ -0,0 +1,3 @@ +# Retained source bytes + +The four retained files are byte-identical to `research/native-involutive-dual/` at commit `86e474038e05f99a76d41f71d81946ad2327e4a4` (PR #4948, Dugongue with OpenAI Codex assistance). They are committed in this branch before the new construction so cold clones need no unmerged source objects. The native word is Cao Yifan’s round-three construction beyond PR #4610, retaining Cinna Davis and the upstream source lineage. This is source retention, not a new physical-map audit. LICENSE and NOTICE are unchanged. diff --git a/research/native-frame-carrying-swaps/SOURCE-WORD.json.gz b/research/native-frame-carrying-swaps/SOURCE-WORD.json.gz new file mode 100644 index 0000000000..46d929df83 Binary files /dev/null and b/research/native-frame-carrying-swaps/SOURCE-WORD.json.gz differ diff --git a/research/native-frame-carrying-swaps/SOURCES.json b/research/native-frame-carrying-swaps/SOURCES.json new file mode 100644 index 0000000000..490050623c --- /dev/null +++ b/research/native-frame-carrying-swaps/SOURCES.json @@ -0,0 +1,46 @@ +{ + "schema_version": 1, + "base_commit": "b91956876e5b4122fd89179f1b57557ff8378f15", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "c35482cd9035843b15a634cc8276a7e1e40e8395", + "sha256": "6fe0a099b89aa2aed796a13c3a21dafc63f3388ebf397464e44e0451893b9375" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "f126dd2e2dad2b669e75d1d0d0bd05c600725602", + "sha256": "f7a48bfa2659b88378282a8eee7d9fe52cdf505594124c4d1686b58510fffd72" + }, + { + "path": "research/native-frame-carrying-swaps/native_core.py", + "pin": "head:95441b4f2757ae6095f88ea10ebce329d27d5003:research/native-frame-carrying-swaps/native_core.py", + "usage": "provenance", + "git_blob": "72bbd2fecb2134967e6cd6e2a7cfddfe9fd4ad2b", + "sha256": "c510b8c171a57a92b2cfe2ad516cde00fa8a1148b457bb8de2197635e37f3296" + }, + { + "path": "research/native-frame-carrying-swaps/SOURCE-WORD.json.gz", + "pin": "head:95441b4f2757ae6095f88ea10ebce329d27d5003:research/native-frame-carrying-swaps/SOURCE-WORD.json.gz", + "usage": "provenance", + "git_blob": "46d929df83817b85a5387bcdb9745e0627d6366e", + "sha256": "7679daa4ec6a40f56fc7f0202379a6f454310e94945aba4f48beaaaafb838d05" + }, + { + "path": "research/native-frame-carrying-swaps/LICENSE", + "pin": "head:95441b4f2757ae6095f88ea10ebce329d27d5003:research/native-frame-carrying-swaps/LICENSE", + "usage": "provenance", + "git_blob": "261eeb9e9f8b2b4b0d119366dda99c6fd7d35c64", + "sha256": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4" + }, + { + "path": "research/native-frame-carrying-swaps/NOTICE", + "pin": "head:95441b4f2757ae6095f88ea10ebce329d27d5003:research/native-frame-carrying-swaps/NOTICE", + "usage": "provenance", + "git_blob": "faa0f8ce7f3dfb9b7095302d60a37469cea91da4", + "sha256": "57d5bcf4f205d6d4c16eb81f37c5a1ab0c99185de26978cab99f0ce82b3147f0" + } + ] +} diff --git a/research/native-frame-carrying-swaps/TASK.json b/research/native-frame-carrying-swaps/TASK.json new file mode 100644 index 0000000000..f7288b596f --- /dev/null +++ b/research/native-frame-carrying-swaps/TASK.json @@ -0,0 +1,95 @@ +{ + "schema_version": 1, + "task_id": "joint-query-controller", + "priority_revision": 7, + "base_commit": "b91956876e5b4122fd89179f1b57557ff8378f15", + "original_card": { + "id": "joint-query-controller", + "question": "Can the installed QQ16 caller win a complete matched protocol bill, or can a changed demand eliminate actual paid work?", + "starting_points": [ + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "research/qq16-caller-install/README.md" + ], + "methods": [ + "Derive the matched whole-caller physical bill for installed and baseline protocols.", + "Change the actual demanded observations and prove a cheaper legal producer/consumer contract." + ], + "acceptance_gate": "Name the changed premise of the fixed F0/B1 observation obstruction. Show exactly which query is recovered, legal native reads and restoration, and a full favorable budget including cover maps, helpers and endpoints. Local inverse identities alone do not close the global controller. 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_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read #4166 COST.md and ADMISSION.json. An actual caller connection is now proposed. Its native-component profile loses; parent park/restore versus external-call costs remain unresolved. Retain the producer and recovery lineage rather than rebuild it.", + "scope": "Source-binding orientation only; no scientific replay, theorem acceptance or supplier admission. Budget any heavy replay separately." + }, + "first_experiment": "At the actual installed cut, compare matched complete parent park/restore and external input/return protocols at the same bank/packet geometry, including every later root call and service cost. Alternatively pin both bridge observations and derive a genuinely smaller source-compatible demand. Stop if the complete necessary inequality fails or an essential cost is unknown; no larger decoder scan from a local tape-action saving.", + "bottleneck_link": "The native local words exist; retained query information and its physical access are the missing link to a composed recursive interface.", + "allowed_variations": [ + "One paid query, one changed first pair, or one precisely specified affine helper state.", + "A counterexample or lower bound for that exact proposed repair.", + "One unresolved obligation of a newer local decoder, with exact source heads and a distinct claim/domain." + ], + "scope_change_triggers": [ + "Retaining the fixed first pair and ordinary schedule while allowing only homogeneous selected-only control, already excluded by the witness.", + "Treating cover-map counts as zero-cost physical address operations.", + "Recreating the pending complete local decoder or early-record/output-bank coalescing already under investigation without a distinct audit or changed premise.", + "Treating a completed-output defect inequality as a producer-interior, dirty-range or physical-cost certificate.", + "Recreating completed-output recovery or caller wiring already supplied by #4166 without new independent coverage.", + "Dropping retained later root calls or claiming native-profile dominance from the isolated publication saving." + ], + "overlap_terms": [ + "QQ16", + "joint-query", + "changing-chart controller", + "selected observation", + "1969", + "2540", + "early record", + "output-bank retention", + "complete native decoder", + "2965", + "producer defect", + "dirty-helper range", + "F17 consumer", + "4166", + "qq16-caller-install" + ], + "existing_checks": [ + { + "scope": "PR #4166: author-checked installed producer/service/return/bridge connection; native-component comparison loses.", + "evidence": "research/qq16-caller-install/README.md", + "remaining": "Complete matched physical protocol bill, or changed source-compatible demand/circuit; no affordable supplier yet.", + "status": "author-checked", + "source_commit": "0b082d22a0e9a442d264ab0633e35ef26c790630", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Frame-carrying weighted-swap construction on the pinned round-three word; no improved kappa.", + "scope_change_reason": "The full improvement remains unproved; deliver the exact positive rewrite and reusable checker.", + "bottleneck_link": "Removes forced equal-frame contacts at 534 weighted swaps, exposing a changed transport search space.", + "budget_minutes": 60, + "stop_rule": "Finish the bounded construction and package its verification; no claim of a complete favorable budget.", + "outcome": "partial", + "evidence": "Both 632-row endpoints, 408 helper identities, terminal frames, owned clear, unchanged paid profile, sign and frame-carry rejection controls.", + "author": "Dugongue", + "ai_assistance": "Substantial OpenAI Codex assistance, one agent only; no subagents, Jev, Lean or GPU.", + "open_questions": [ + { + "question": "Can joint frame and scalar scheduling after these swaps lower the complete recursive bill?", + "why_it_matters": "The current construction preserves the paid profile and therefore does not improve kappa.", + "first_step": "Use construct(program) output as a new search representation, price every remaining transport and physical field movement.", + "blocked_by": "No favorable complete budget or physical tape implementation has been proved." + } + ], + "freshness": { + "canonical_main": "b91956876e5b4122fd89179f1b57557ff8378f15", + "guidance": "No change to AGENTS, autoresearch, CONTRIBUTING, priorities, catalogue or selected result since cef4b52.", + "overlap": "Prior session checked recent PRs through #4955; incomplete Discussion coverage. No exhaustive novelty claim." + } +} diff --git a/research/native-frame-carrying-swaps/VERIFY.json b/research/native-frame-carrying-swaps/VERIFY.json new file mode 100644 index 0000000000..997a68d092 --- /dev/null +++ b/research/native-frame-carrying-swaps/VERIFY.json @@ -0,0 +1,30 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Exact endpoints, frames, profile and sign/frame mutations." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Same checks with assertions disabled." + } + ] +} diff --git a/research/native-frame-carrying-swaps/native_core.py b/research/native-frame-carrying-swaps/native_core.py new file mode 100644 index 0000000000..72bbd2fecb --- /dev/null +++ b/research/native-frame-carrying-swaps/native_core.py @@ -0,0 +1,73 @@ +"""Exact source-bound coded-supplier replay core. Apache-2.0; Codex assistance. +Frozen source: Cao Yifan #4610 and retained Cinna Davis/Dugongue lineage. +""" +from pathlib import Path +from fractions import Fraction as Q +from collections import Counter +from hashlib import sha256 +import gzip,json,copy,importlib.util,sys +HERE=Path(__file__).resolve().parent +SOURCE_SHA='cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd' +def need(c,m): + if not c:raise ValueError(m) +def identity(i):return {(i,()):Q(1)} +def add(dst,src,a): + for k,v in tuple(src.items()): + z=dst.get(k,Q(0))+a*v + if z:dst[k]=z + else:dst.pop(k,None) +def warp(row,op,back): + s=(1 if op>0 else -1)*(abs(op)+(1000000 if back else 0));out={} + for (v,w),a in row.items(): + ww=w[1:]if w and w[0]==-s else(s,)+w;out[v,ww]=out.get((v,ww),Q(0))+a + return {k:a for k,a in out.items()if a} +def expected(i,back): + r=identity(i) + if back and i<112:add(r,identity(i+112),-1) + if not back and 112<=i<224:add(r,identity(i-112),1) + return r + +def replay(c,program,back=False,check_frames=True): + rows={i:identity(i)for i in range(632)};rows[632]={};cur=c['start'][:]+[None];paid=Counter();maxnorm=Q(1) + for e in program: + if e[0]=='scalar': + g,f=e[1:];r=g[1][1]+(632 if g[1][0]=='C'else 0) + if g[0]=='clear':need(r==632,'Borrowed erasure');rows[r]={};cur[r]=f + else: + if check_frames:need(cur[r]==f,'Scalar target frame') + if g[0]in('add','copy'): + v=g[2][1]+(632 if g[2][0]=='C'else 0) + if check_frames:need(cur[v]==f,'Scalar source frame') + if g[0]=='copy':need(r==632,'Borrowed overwrite');rows[r]=rows[v].copy() + else:need(r!=v,'Self add');add(rows[r],rows[v],Q(g[3],g[4])) + elif g[0]=='scale':rows[r]={k:Q(g[2],g[3])*v for k,v in rows[r].items()} + else:raise ValueError('Scalar opcode') + maxnorm=max(maxnorm,sum(map(abs,rows[r].values()),Q(0))) + elif e[0]=='warp': + _,r,op,x,y=e;r=r[1]+(632 if r[0]=='C'else 0) + if check_frames:need(cur[r]==x,'Warp source frame') + rows[r]=warp(rows[r],op,back);cur[r]=y + elif e[0]=='climb': + _,_,r,x,y,k=e + if check_frames:need(cur[r]==x,'Climb source frame') + need(k==len(c['frames'][y])-len(c['frames'][x])and k>0,'Ascending paid rank');cur[r]=y;paid[k]+=1 + elif e[0]=='center': + _,r,x,y,k=e;r+=632 + if check_frames:need(cur[r]==x,'Center source frame') + need(k==abs(len(c['frames'][y])-len(c['frames'][x])),'Center paid rank');cur[r]=y;paid[k]+=1 + else:need(e[0]in('phase','adapter','residual_adapter'),'Unknown opcode') + need(cur[:632]==c['final'],'Final frames');need(not rows[632],'Owned field cleared') + return rows,paid,maxnorm + +def clear_centers(program):return [['scalar',['clear',['C',e[1]]],e[3]]if e[0]=='center'else copy.deepcopy(e)for e in program] +def error_kernel(a): + rows,paid,_=replay(a['canonical'],clear_centers(a['programs']['forward']));E=[] + for i in range(632): + err=rows[i].copy();add(err,expected(i,False),-1) + for (j,w),v in sorted(err.items()): + need(112<=i<224 and(j<112 or j>=224),'Strict triangular error block');need(not w,'Constant owner kernel') + need(a['canonical']['final'][j]==1,'Repair source final full frame');need(j<112 or a['canonical']['start'][j]==0,'Pre-repair source initial ground') + E.append((i,j,v)) + need(len(E)==12532,'Frozen error term count') + return E + diff --git a/research/native-frame-carrying-swaps/verify.py b/research/native-frame-carrying-swaps/verify.py new file mode 100644 index 0000000000..88aa08b7d5 --- /dev/null +++ b/research/native-frame-carrying-swaps/verify.py @@ -0,0 +1,95 @@ +from pathlib import Path +from fractions import Fraction as Q +from collections import Counter +import sys,json,gzip,hashlib,copy +P=Path(__file__).resolve().parent +S=P +if hashlib.sha256((S/'native_core.py').read_bytes()).hexdigest() != 'c510b8c171a57a92b2cfe2ad516cde00fa8a1148b457bb8de2197635e37f3296': raise ValueError('Retained core hash') +sys.path.insert(0,str(S));import native_core as V +raw=gzip.decompress((S/'SOURCE-WORD.json.gz').read_bytes()) +V.need(hashlib.sha256(raw).hexdigest()==V.SOURCE_SHA,'Frozen source payload') +a=json.loads(raw);c=a['canonical'] +def space(b): + s={0} + for v in b:s|={x^v for x in tuple(s)} + return s +spaces=list(map(space,c['frames'])) + +def construct(program): + p=[copy.deepcopy(e)for e in program if e[0]!='climb'];cur=c['start'][:];out=[];count=0;i=0;unequal=0 + def climb(r,f): + old=cur[r] + if old!=f: + V.need(spaces[old]