Research note: restored DATA-shear boundaries for PR #521's native BIT query (exact query costs, no new κ)

research/native-fusion-restored-shear/CLAIM.md

@@ -0,0 +1,72 @@
+# Local sprint claim
+
+- Track: recursive interfaces; OS assignment seed **57**.
+- Base: `66849e1475c930fd7732b1a0067ffee7e1e95f60`.
+- Object: the unfinished private-state boundary of Karl Appel / applecrusher's
+  PR #521, head `a190fdb39f31647fc6f651625353710624627348`.
+- Hypothesis: a restored DATA shear can eliminate the full-volume private BIT
+  row, but cannot retain the one-query price of the unfinished dirty module.
+- Method: exact Laurent-polynomial operator classification; exhaustive rank-one
+  XOR charts on three and four rows; prime-power ADDRESS and dirty BIT controls.
+- Deliverable: a scoped two-query restored-shear construction, complete local
+  child/tape recurrence, and either a query lower bound or a counterexample.
+  No new multiplication kappa or full interchange supplier is claimed.
+- Expected finish: 2026-10-13 01:15 America/Chicago (06:15 UTC).
+- Posting: local only; no GitHub write access. Anonymous issue search found
+  only #650 (Discussions), not a sprint coordination issue.
+
+## Candidate selection and overlap check
+
+Three narrow candidates were considered, in this order:
+
+1. Complete PR #521's unipotent BIT module at a restored DATA boundary.
+2. Carry a terminal Clifford frame across adjacent recursive invocations.
+3. Reuse dirty-helper preconditioning across successive source-stable calls.
+
+`57 mod 3 = 0` selects candidate 1. Candidates 2 and 3 have substantial overlap
+with the selected cold-helper lineage and PR #390's preconditioning interface.
+The initial anonymous inventory contained 478 open PRs; a second updated-PR
+snapshot was checked immediately before this claim. No matching restored-shear
+completion was found. PR #521 is recorded as unreviewed in the base ledger;
+this work does not certify its full packet.
+
+Related work is expressly retained: PR #521 provides the ADDRESS word and
+dirty-module representation; the in-tree `bit-three-register-lower-bound`
+package and its PR #288 predecessor provide the scalar-projector/group-algebra
+model. Our target is one off-diagonal restored shear, not their three full
+diagonal interchanges. PR #83 rules out improvements from switching among a
+fixed menu of complete recursion profiles; we do not repeat that search. The
+rejected cross-family split-residual interface is not reopened.
+
+This is one local claim. A final result update will be added once.
+
+## Result update (local only)
+
+Completed: three exact restored-DATA-shear implementations, with 2 / 4 / 1
+ordinary recursive children for, respectively, no private row, a restored
+dirty private row under triangular charts, and an owned disposable row.
+The first two have sharp query lower bounds in their explicitly stated
+models. The owned-row program pays a full source copy and final clear.
+Complete typed recurrences include every child, affine event, XOR, copy,
+clear, routing and inherited tape work. No new kappa is claimed.
+
+Evidence: 60,880 ordered signed projector pairs; all 4,681 native-chart words
+through length four; 776 orbit BIT columns per program; a separate sparse-set
+replay of all 729 addresses and 2,916 basis columns per program; 17,496
+full-domain endpoint/inverse cases; 17 meaningful negative controls. The
+universal claims have written proofs and are not inferred from finite replay.
+
+Reproduce: `python3 -I -B research/native-fusion-restored-shear/check.py --check`
+(expected first line `PASS_RESTORED_SHEAR_INTERFACES`).
+
+The final anonymous metadata refresh was 2026-10-13T03:20:29.895709+00:00. PR #521 remains
+at `a190fdb39f31647fc6f651625353710624627348`. The 100 most recently updated
+open PRs were rechecked against the initial 478-PR inventory; no matching
+restored-shear contribution was found. Concurrent #663 at
+`e0e546fd01b396478c68b6b6c5a16d87515983ba` audits a nonlinear dirty commutator;
+#665 at `d0e4f1eb295e5cce508dc76c6937290a9175e42b` prices a complex spectral
+encoding. Neither treats this fixed-permutation BIT shear or its workspace
+tradeoff, and neither is a dependency. The issue search still found only
+#650, with no coordination thread. This records the required claim update
+locally; no issue, comment, claim or PR was posted. The branch and format-patch
+are identified in the lane handback for the owner's submission decision.

research/native-fusion-restored-shear/EXPECTED.json

@@ -0,0 +1,229 @@
+{
+  "address": {
+    "basis_columns_including_two_address_spectators": 96,
+    "orbits": [
+      {
+        "initial_scale": 1,
+        "length": 3,
+        "modulus": 3
+      },
+      {
+        "initial_scale": 1,
+        "length": 9,
+        "modulus": 9
+      },
+      {
+        "initial_scale": 1,
+        "length": 27,
+        "modulus": 27
+      },
+      {
+        "initial_scale": 1,
+        "length": 11,
+        "modulus": 11
+      },
+      {
+        "initial_scale": 1,
+        "length": 121,
+        "modulus": 121
+      },
+      {
+        "initial_scale": 3,
+        "length": 3,
+        "modulus": 9
+      },
+      {
+        "initial_scale": 3,
+        "length": 9,
+        "modulus": 27
+      },
+      {
+        "initial_scale": 11,
+        "length": 11,
+        "modulus": 121
+      }
+    ],
+    "rational_and_modular_domains": [
+      "Q",
+      3,
+      9,
+      27,
+      11,
+      121
+    ]
+  },
+  "algebra": {
+    "native_chart_layers": [
+      {
+        "queries": 0,
+        "solutions": 0,
+        "words": 1
+      },
+      {
+        "queries": 1,
+        "solutions": 0,
+        "words": 8
+      },
+      {
+        "queries": 2,
+        "solutions": 0,
+        "words": 64
+      },
+      {
+        "queries": 3,
+        "solutions": 0,
+        "words": 512
+      },
+      {
+        "queries": 4,
+        "solutions": 24,
+        "words": 4096
+      }
+    ],
+    "projector_pairs": [
+      {
+        "fixed_data_shear_solutions_with_both_private_diagonals_one": 0,
+        "nonzero_rank_one_nilpotent_targets": 3,
+        "ordered_signed_pairs": 144,
+        "projectors": 6,
+        "rows": 2,
+        "solutions": 12,
+        "solutions_by_left_right_sign": {
+          "-1,1": 6,
+          "1,-1": 6
+        },
+        "solutions_per_target": 4
+      },
+      {
+        "fixed_data_shear_solutions_with_both_private_diagonals_one": 0,
+        "nonzero_rank_one_nilpotent_targets": 21,
+        "ordered_signed_pairs": 3136,
+        "projectors": 28,
+        "rows": 3,
+        "solutions": 168,
+        "solutions_by_left_right_sign": {
+          "-1,1": 84,
+          "1,-1": 84
+        },
+        "solutions_per_target": 8
+      },
+      {
+        "fixed_data_shear_solutions_with_both_private_diagonals_one": 0,
+        "nonzero_rank_one_nilpotent_targets": 105,
+        "ordered_signed_pairs": 57600,
+        "projectors": 120,
+        "rows": 4,
+        "solutions": 1680,
+        "solutions_by_left_right_sign": {
+          "-1,1": 840,
+          "1,-1": 840
+        },
+        "solutions_per_target": 16
+      }
+    ]
+  },
+  "controls": {
+    "count": 17,
+    "rejected": [
+      "no_private:omit_query_0",
+      "no_private:omit_query_2",
+      "dirty_private:omit_query_1",
+      "dirty_private:omit_query_3",
+      "dirty_private:omit_query_5",
+      "dirty_private:omit_query_7",
+      "clean_private:omit_query_2",
+      "no_private:use_forward_as_inverse",
+      "no_private:omit_xor_1",
+      "no_private:omit_xor_3",
+      "clean_private:claim_arbitrary_dirty_restoration",
+      "clean_private:omit_copy_0",
+      "clean_private:omit_clear_4",
+      "clean_private:reuse_unfinished_module_inverse_after_clear",
+      "address:omit_ordinary_child_keep_affine_wrappers",
+      "address:change_5_over_4_to_1",
+      "classification:extending_opposite_sign_rule_to_order_two"
+    ]
+  },
+  "endpoints": {
+    "basis_columns_per_program": 776,
+    "clean_private_contract": "private input may be discarded; DATA and spectator input columns preserved as specified",
+    "fixed_point_assignments_across_three_programs": 48,
+    "invoices": {
+      "clean_private": {
+        "clear_scans": 1,
+        "copy_scans": 1,
+        "ordered_affine_events": 6,
+        "ordinary_children": 1,
+        "xor_scans": 2
+      },
+      "dirty_private": {
+        "clear_scans": 0,
+        "copy_scans": 0,
+        "ordered_affine_events": 24,
+        "ordinary_children": 4,
+        "xor_scans": 5
+      },
+      "no_private": {
+        "clear_scans": 0,
+        "copy_scans": 0,
+        "ordered_affine_events": 12,
+        "ordinary_children": 2,
+        "xor_scans": 2
+      }
+    },
+    "orbits": [
+      {
+        "dirty_basis_columns": 12,
+        "initial_scale": 1,
+        "modulus": 3
+      },
+      {
+        "dirty_basis_columns": 36,
+        "initial_scale": 1,
+        "modulus": 9
+      },
+      {
+        "dirty_basis_columns": 108,
+        "initial_scale": 1,
+        "modulus": 27
+      },
+      {
+        "dirty_basis_columns": 44,
+        "initial_scale": 1,
+        "modulus": 11
+      },
+      {
+        "dirty_basis_columns": 484,
+        "initial_scale": 1,
+        "modulus": 121
+      },
+      {
+        "dirty_basis_columns": 12,
+        "initial_scale": 3,
+        "modulus": 9
+      },
+      {
+        "dirty_basis_columns": 36,
+        "initial_scale": 3,
+        "modulus": 27
+      },
+      {
+        "dirty_basis_columns": 44,
+        "initial_scale": 11,
+        "modulus": 121
+      }
+    ]
+  },
+  "full_domain": {
+    "endpoint_and_completed_inverse_cases": 17496,
+    "fixed_addresses": 243,
+    "full_address_count": 729,
+    "input_basis_columns_per_program": {
+      "clean_private": 2916,
+      "dirty_private": 2916,
+      "no_private": 2916
+    },
+    "method": "individual sparse-set BIT columns on the complete six-field address domain",
+    "modulus": 3
+  }
+}

research/native-fusion-restored-shear/NOTICE.md

@@ -0,0 +1,39 @@
+# Attribution, license, and scope
+
+New prose and checker code in this packet are contributed under the
+repository's Apache-2.0 license. The repository's LICENSE and NOTICE remain
+unchanged. Submitted by @commdata2338. Prepared with substantial AI assistance:
+OpenAI Codex (GPT-6-Astra) wrote the analysis, proof and checker, and
+Claude Code (Claude Opus 5.5) packaged the submission. No independent
+human peer review is claimed.
+
+- **Karl Appel / applecrusher, PR #521**, head
+  `a190fdb39f31647fc6f651625353710624627348`: the rank-one unipotent ADDRESS
+  map, its seven-event lowering, the reflected-query comparison, and the
+  dirty shared-chart operator. The ADDRESS word in PROGRAM.json is an
+  attributed transcription. The completed shear contracts, two-query
+  classification, cost comparison and fresh checker are this contribution.
+- **OpenAI #109 / the imported upstream framework**: ordered-affine streams,
+  complete-range ordinary ADDRESS interchange, tape/stack and head-return
+  contracts. The two original sources at revision
+  `5996e33ecad6a0ccd578aec58831457829d75575` match the files in this base;
+  exact URLs and SHA-256 values are recorded in SOURCES.json. Their licenses
+  and repository notices are retained, and their interfaces remain premises.
+- **eumemic, PR #288**, head
+  `475a088b5862f75f0b10596cfd6842d19531a5ec`, and **Ali Romman, PR #468**,
+  the in-tree `research/bit-three-register-lower-bound` package: the binary
+  scalar-projector/group-algebra model used for other interchange targets.
+  This packet credits that model and does not repeat the nine-call search.
+- **Joseph Demarest, PR #83**, head
+  `183077b7b3ae12e96eb3a87c1dc08023e6494dca`: the scoped fixed-menu adaptive
+  recursion barrier, inspected when selecting this task. We do not claim
+  that rescheduling complete supplier profiles changes their best exponent.
+- The selected #626/#622/#623 construction, #543 bit supplier, and cumulative
+  community authors retain their attribution. Their selected artifacts are
+  neither changed nor re-certified by this local note.
+
+No priority claim is made for the elementary compute/uncompute identities,
+matrix determinant lemma, or Laurent-polynomial methods. The useful output
+is the pinned component's explicit restored-boundary alternatives, their
+precise model restrictions and paid recurrence, and exact reproducible
+evidence for review.