Research: sharp odd-dihedral joint tariffs with dirty workspace

research/odd-dihedral-joint-tariff/OVERLAP.json

@@ -0,0 +1,171 @@
+{
+  "status": "POSSIBLE_OVERLAP_NOT_A_NOVELTY_CERTIFICATE",
+  "searched_at": "2026-10-14T15:18:21.577400+00:00",
+  "terms": [
+    "odd period",
+    "odd dihedral",
+    "antipodal",
+    "finite-dihedral"
+  ],
+  "entry_coverage": {
+    "open_prs": {
+      "fetched_at": "2026-10-14T14:59:01.036857+00:00",
+      "complete_pagination": true,
+      "records": 601
+    },
+    "discussions": {
+      "fetched_at": "2026-10-14T15:00:56.703857+00:00",
+      "complete_pagination": true,
+      "records": 578
+    }
+  },
+  "final_coverage": {
+    "open_prs": {
+      "fetched_at": "2026-10-14T15:16:16.140418+00:00",
+      "complete_pagination": true,
+      "records": 535
+    },
+    "discussions": {
+      "fetched_at": "2026-10-14T15:18:21.498074+00:00",
+      "complete_pagination": true,
+      "records": 592
+    }
+  },
+  "warnings": [],
+  "limits": "Remote PR scope is open PRs including drafts. Closed work is searched through local READMEs, TASK metadata and ledger only. No code diffs or arbitrary package files are searched. Recheck relevant heads before submission.",
+  "matches_total": 12,
+  "relevant_matches": [
+    {
+      "kind": "pr",
+      "number": 1941,
+      "title": "Research: sharp even finite-dihedral tariffs with dirty workspace",
+      "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/1941",
+      "head": "5938ce3e91bbb8b5c2227af7976d444b2fbac7d4",
+      "updated_at": "2026-10-14T14:33:00Z",
+      "draft": false,
+      "state": "open",
+      "matched_terms": [
+        "odd period",
+        "finite-dihedral"
+      ],
+      "score": 4,
+      "excerpt": "at is new\n\nThis closes the explicitly open **finite-torsion** question in #1911 (`712593f8`): its infinite-dihedral Laurent invariant does not descend through `r^n=1`. The new finite cut invariant does. In particular #1821's D16 central pair retains its 16-call minimum with arbitrarily many dirty roles, and the theorem covers all even periods and heterogeneous endpoints.\n\nThe all-register **D8 central-target** special case was already proved by steph4n-gh in #1573; it is credited, not claimed an"
+    },
+    {
+      "number": 1955,
+      "title": "CLAIM: sharp odd finite-dihedral joint tariffs with dirty workspace",
+      "kind": "discussion",
+      "url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1955",
+      "updated_at": "2026-10-14T15:03:43Z",
+      "matched_terms": [
+        "finite-dihedral"
+      ],
+      "score": 3,
+      "excerpt": "CLAIM \u2014 odd finite-dihedral joint tariffs; bit-mechanisms / bit-new-register-model, scope refined. OS nonce 721bc4f2e2d9f3c304d6dab0f34c1803; priority revision 3; exact base 0b1cccf86e2f5132ed286a26ef0a681a495740ea; selected-record SHA256 10b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32.\n\nQuestion: for every odd rotation period n=2m+1>=3, arbitrary heterogeneous diagonal targets r^k_i x^e_i in formal F2[D_{2n}], and any finite restored dirty workspace, do reflection-only rank-one"
+    },
+    {
+      "kind": "pr",
+      "number": 1911,
+      "title": "Research: sharp infinite-dihedral reflection bills with arbitrary dirty registers",
+      "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/1911",
+      "head": "712593f82739203639d0a169b88c6bcac6f0590c",
+      "updated_at": "2026-10-14T13:44:11Z",
+      "draft": false,
+      "state": "open",
+      "matched_terms": [
+        "finite-dihedral"
+      ],
+      "score": 3,
+      "excerpt": "e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32`.\n- Source byte/blob pins: `research/infinite-dihedral-register-bound/SOURCES.json`.\n- Coordination: https://github.com/CrocSwap/integer-mult-bounds/discussions/1884\n\nClosest inspected predecessors are #1573 (already proves all-register finite D8 central targets), #1478 (D8, two/three registers), #1821 (D16, two registers), #1733 (four-register rational two-relation ansatz), and #1822 (Q8). Exact heads are recorded in README and were r"
+    },
+    {
+      "number": 1167,
+      "title": "Larger \u03ba: proposals that change the current cost structure",
+      "kind": "discussion-comment",
+      "url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1167#discussioncomment-18926680",
+      "updated_at": "2026-10-14T15:01:20Z",
+      "matched_terms": [
+        "odd period",
+        "finite-dihedral"
+      ],
+      "score": 2,
+      "excerpt": "pen PRs and 575 Discussions, complete pagination and no warnings. It surfaced PR #1941, whose sharp finite-dihedral tariff covers every even rotation order and explicitly excludes odd periods. This package is the odd order-five `D10` inverse-rotation slice. No exact D10/order-five target claim appeared. The D-infinity and D8/D16/S3 precedents are distinguished in the package.\n\n**Remaining obligations:** registered Python 3.12 replay and hosted CI; no native supplier/compiler, physical interface "
+    },
+    {
+      "number": 1884,
+      "title": "Ten-instance independent research session: interface and verifier audits",
+      "kind": "discussion",
+      "url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1884",
+      "updated_at": "2026-10-14T14:18:49Z",
+      "matched_terms": [
+        "finite-dihedral"
+      ],
+      "score": 1,
+      "excerpt": "-writer domain (`6b222d01fee072bcd3a680e6a96ae7d22e13bcac`).\n- **bit-new-register-model:** formal infinite-dihedral F2 group algebra, paid reflections only, arbitrary finite dirty-workspace register count; investigate a sharp per-reflection lower bound for diagonal translation powers. Distinct from finite D8/D16/Q8 cases (#1573/#1821/#1822).\n- **complex-rank-shape-decoder:** P112 rank-one terms with at least one actual support confined to a canonical tetrad block, arbitrary opposite support/term"
+    },
+    {
+      "number": 1929,
+      "title": "Round 2: ten independently seeded parallel research instances",
+      "kind": "discussion-comment",
+      "url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1929#discussioncomment-18925900",
+      "updated_at": "2026-10-14T14:17:48Z",
+      "matched_terms": [
+        "finite-dihedral"
+      ],
+      "score": 1,
+      "excerpt": "us endpoints with arbitrary workspace, not another finite-domain search. Expected artifact research/finite-dihedral-cut-bound with written theorem, independently implemented verifier, source pins, complete paid formal budget and controls. Claim expires 2026-10-14T16:30:00Z. Prepared for Adam Gall with substantial OpenAI Codex assistance."
+    },
+    {
+      "number": 1929,
+      "title": "Round 2: ten independently seeded parallel research instances",
+      "kind": "discussion-comment",
+      "url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1929#discussioncomment-18926159",
+      "updated_at": "2026-10-14T14:33:31Z",
+      "matched_terms": [
+        "finite-dihedral"
+      ],
+      "score": 1,
+      "excerpt": "929#discussioncomment-18925900 (seed63537661f5ee8acaa486b70f82726911).\n\nEstablished: for every even finite-dihedral period n and every finite dirty-register count, arbitrary heterogeneous targets r^k x^e have sharp simultaneous reflection tariffs sum dist_n(k+e) x calls and sum dist_n(k) y calls. Two shifted finite permutation representations and balanced address-cut rank prove the all-length result; full formal coordinate words attain it. This resolves the finite-torsion next question of PR1911"
+    },
+    {
+      "number": 1929,
+      "title": "Round 2: ten independently seeded parallel research instances",
+      "kind": "discussion-comment",
+      "url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1929#discussioncomment-18926555",
+      "updated_at": "2026-10-14T14:55:04Z",
+      "matched_terms": [
+        "finite-dihedral"
+      ],
+      "score": 1,
+      "excerpt": "ttps://github.com/CrocSwap/integer-mult-bounds/pull/1941) | Sharp per-letter tariffs for every even finite-dihedral period and heterogeneous targets with arbitrary restored dirty workspace. |\n| 03 | `4e1451a884a6979cb599a332ccc7ad40` | [#1940](https://github.com/CrocSwap/integer-mult-bounds/pull/1940) | Chronological P104 schedule attains PR1125's known32-path bound:416reads and24additional arrays, with conditional tail invoice. |\n| 04 | `3cc9f4c8f3719f13f4ae6bf28c9ba982` | [#1936](https://githu"
+    },
+    {
+      "number": 1884,
+      "title": "Ten-instance independent research session: interface and verifier audits",
+      "kind": "discussion-comment",
+      "url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1884#discussioncomment-18925359",
+      "updated_at": "2026-10-14T13:48:38Z",
+      "matched_terms": [
+        "finite-dihedral"
+      ],
+      "score": 1,
+      "excerpt": " tetrad-local masked decoder COPY112 floor.\n- #1910: selected k8 omission observability.\n- #1911: infinite-dihedral reflection bills with dirty workspace.\n- #1912: selected generated-identity field-coverage audit (no defect found).\n- #1913: fixed-frame two-writer helper absorption obstruction.\n- #1915: generic dirty-connector rigidity under paid frames.\n- #1917: cross-fed handoff versus strengthened closed-call baseline.\n- #1918: exact composed scalar centre-source rank for one selected pair.\n\nE"
+    },
+    {
+      "kind": "pr",
+      "number": 1953,
+      "title": "Research: D10 inverse rotations retain four-call minimum",
+      "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/1953",
+      "head": "4f3bdf7c3bdd7033180c9d8c41245023cc402bc6",
+      "updated_at": "2026-10-14T14:59:43Z",
+      "draft": false,
+      "state": "open",
+      "matched_terms": [
+        "odd period"
+      ],
+      "score": 1,
+      "excerpt": "iscussion #1929\ncomment 18925900, proves tariffs for every even rotation order and expressly\nleaves odd periods out. This package treats odd rotation order five and the\ninverse-rotation pair. The final overlap refresh at 2026-10-14 14:56:57 UTC\ncovered 601 open PRs and 575 Discussions with complete pagination and no\nwarnings; no D10 target claim was found. Prepared with\nsubstantial OpenAI Codex assistance. No independent human review is claimed.\n"
+    }
+  ],
+  "scope_delta": "Odd rather than even period; all heterogeneous formal endpoints and any finite dirty workspace. New regular-action cut supplies the missing joint charge. PR1953 is a credited finite special case, not an unclaimed instance."
+}