Research construction: seven grid-preserving JP8 circuits save 104 primitives per orientation (no new kappa)

research/jp8-grid-bounded-synthesis/CLAIM.json

@@ -0,0 +1,59 @@
+{
+  "track": "Complex supplier",
+  "seed": 33,
+  "randomness": "Python secrets.randbelow(100), OS randomness",
+  "base_commit": "f567884aeb8851b6e794af1184119a3bfbe1e631",
+  "claimed_at": "2026-10-13T09:18:03.350173+00:00",
+  "finish_by": "2026-10-13T10:03:54Z",
+  "coordination": "No pinned issue returned by GitHub GraphQL; local claim per sprint instructions. No issue created.",
+  "candidates": [
+    {
+      "task": "General signed shift/add synthesis for JP8 dyadic coefficients, constrained by local fractional grid and original numerator envelope",
+      "decision": "selected; odd seed chooses JP8, seed 33 rotates coefficient ordering"
+    },
+    {
+      "task": "CK cleanup scale relocation",
+      "decision": "not selected: completed class search in PR750; no new mechanism identified"
+    },
+    {
+      "task": "SW4 full pair/triple read exchanges",
+      "decision": "not selected: overlapping PR876 and fixed-frame exclusions PR864"
+    }
+  ],
+  "scope": "Pinned historical PR626 JP8 scalar additions with reduced denominator <=16 and absolute numerator <=127. Synthesize coefficient work in one scratch register using source copy, signed source additions, doubling, exact halving and negation. Scratch always clears at each macro boundary. Grid denominator is at most the coefficient denominator, magnitude at most its original numerator. Exhaustive shortest-path search over the resulting finite signed integer graph; compare copy/binary and four Horner comparators. No frame, paid-profile, selected frontier or upstream changes.",
+  "deliverable": "Exact finite circuits or a scoped negative result with complete graph coverage, independently implemented verification, source pins, controls and reproducible command. No kappa claim.",
+  "related_prs": [
+    696,
+    734,
+    837,
+    866,
+    811,
+    860,
+    750,
+    876,
+    864
+  ],
+  "overlap_snapshot": "669 open PRs through PR876, downloaded 2026-10-13; no overlapping grid-constrained arbitrary shift/add search identified.",
+  "result": {
+    "status": "Submitted finite circuit construction; no new kappa",
+    "pull_request": "https://github.com/CrocSwap/integer-mult-bounds/pull/882",
+    "completed_at": "2026-10-13T09:39:28.105031+00:00",
+    "searched_coefficients": 49,
+    "new_circuits": 7,
+    "affected_macros_per_orientation": 44,
+    "saved_real_primitives_vs_pr696": [
+      104,
+      104
+    ],
+    "saved_real_primitives_vs_four_horner_at_replacements": [
+      88,
+      88
+    ],
+    "exact_fractional_guards": [
+      4,
+      27
+    ],
+    "verification": "All-column primitive replay; independent full-graph Bellman proof; 15 mathematical negative controls; 9 package tests on Python 3.14.7 and 3.11.15; selected-record check.",
+    "coordination_update": "Local claim updated once with result and PR link; no pinned coordination issue available."
+  }
+}