Tooling: 3.09× faster production frame-pair enumeration via eight-bit neighborhoods with identical receipts

research/complex-decoder-field-extension-seed44/CERTIFICATE.json

@@ -5422,9 +5422,10 @@
     "files": {
       "research/complex-frame-pair-decoders/PROOF.md": "ba53c1d8a9bc2d935d546bde46ca7341bd65f8515013e07b073296b4db2a9a74",
       "research/complex-frame-pair-decoders/README.md": "edd848b0177dc73a6e2646d4fd82f0b2ceae37e642bf19d6af602579a041a57e",
-      "research/complex-frame-pair-decoders/verify.py": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
+      "research/frame-pair-enumeration-production/baseline.py": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
     },
-    "hash_policy": "SHA256 with CRLF normalized to LF"
+    "hash_policy": "SHA256 with CRLF normalized to LF",
+    "note": "After research/frame-pair-enumeration-production/, pairwise verify.py bytes are pinned via that package baseline.py."
   },
   "status": "PASS_COMPLEX_DECODER_FIELD_EXTENSION_S44",
   "theorem": "For arbitrary complex D,T with exactly eight columns and D T^transpose = 2G on all live pairs, p<=24 implies cost>=max(72-p,56). Existing real attainments show sharpness over puncture sets of each size."

research/complex-decoder-field-extension-seed44/SOURCES.json

@@ -3,7 +3,8 @@
   "files": {
     "research/complex-frame-pair-decoders/PROOF.md": "ba53c1d8a9bc2d935d546bde46ca7341bd65f8515013e07b073296b4db2a9a74",
     "research/complex-frame-pair-decoders/README.md": "edd848b0177dc73a6e2646d4fd82f0b2ceae37e642bf19d6af602579a041a57e",
-    "research/complex-frame-pair-decoders/verify.py": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
+    "research/frame-pair-enumeration-production/baseline.py": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
   },
-  "hash_policy": "SHA256 with CRLF normalized to LF"
+  "hash_policy": "SHA256 with CRLF normalized to LF",
+  "note": "After research/frame-pair-enumeration-production/, pairwise verify.py bytes are pinned via that package baseline.py."
 }

research/complex-decoder-field-extension-seed44/replay_source.py

@@ -13,7 +13,8 @@
 if not __debug__:raise SystemExit('predecessor assertions must be enabled')
 sys.dont_write_bytecode=True
 here=Path(__file__).resolve().parent
-source=here.parents[1]/'research/complex-frame-pair-decoders/verify.py'
+# Pairwise-era PR968 model; production verify.py ships the neighborhood enumerator.
+source=here.parents[1]/'research/frame-pair-enumeration-production/baseline.py'
 spec=importlib.util.spec_from_file_location('credited_pr968',source)
 m=importlib.util.module_from_spec(spec);spec.loader.exec_module(m)
 with contextlib.redirect_stdout(io.StringIO()) as captured:

research/complex-decoder-field-extension-seed44/verify.py

@@ -18,7 +18,9 @@
 HERE=Path(__file__).resolve().parent
 ROOT=HERE.parents[1]
 BASE='2921874911956718fcaaaf9396fe8267b3cfa9f0'
-SOURCES={'research/complex-frame-pair-decoders/'+name for name in ('PROOF.md','README.md','verify.py')}
+SOURCES={'research/complex-frame-pair-decoders/PROOF.md',
+         'research/complex-frame-pair-decoders/README.md',
+         'research/frame-pair-enumeration-production/baseline.py'}
 spec=importlib.util.spec_from_file_location('gaussian_exact',HERE/'exact.py')
 ex=importlib.util.module_from_spec(spec);spec.loader.exec_module(ex)
 G=ex.G

research/complex-frame-pair-decoders/verify.py

@@ -371,30 +371,45 @@ def rec(clique, cand):
 
 def frame_pair_solutions(F0, F1):
     """All splits: row normals S (from F0) and T (from F1); every column partner is a cross-frame line with
-    odd inner product and orthogonal to all other row normals."""
+    odd inner product and orthogonal to all other row normals.
+
+    Eight-bit neighborhood masks (woklerx #1099 / frame-pair-enumeration-fast-seed93)
+    preserve the exact search domain, acceptance condition, multiplicity and order.
+    """
+    if len(F0) != 8 or len(F1) != 8 or len(set(F0 + F1)) != 16:
+        raise ValueError('two disjoint ordered eight-element frames required')
+    neighbors = [sum(bool(IP[g][f]) << j for j, f in enumerate(F0)) for g in F1]
+    reverse_neighbors = [sum(bool(IP[f][g]) << j for j, g in enumerate(F1)) for f in F0]
     sols = []
-    for smask in range(256):
-        S = [F0[j] for j in range(8) if smask >> j & 1]
-        need = 8 - len(S)
-        # g in F1 is usable as the partner of f in S iff N(g) cap S == {f}
-        part = {f: [g for g in F1 if [x for x in S if IP[g][x]] == [f]] for f in S}
-        if any(not part[f] for f in S):
+    for selected in range(256):
+        left = [j for j in range(8) if selected >> j & 1]
+        partners = [[] for _ in range(8)]
+        for g, adjacent in enumerate(neighbors):
+            hit = adjacent & selected
+            if hit and hit & (hit - 1) == 0:
+                partners[hit.bit_length() - 1].append(g)
+        if any(not partners[f] for f in left):
             continue
-        for choice in itertools.product(*[part[f] for f in S]):
-            if len(set(choice)) != len(S):
+        for choice in itertools.product(*(partners[f] for f in left)):
+            # Retain the reference injectivity guard even though singleton
+            # neighborhoods already partition these first-partner lists.
+            if len(set(choice)) != len(left):
                 continue
-            Tset = [g for g in F1 if g not in choice]
-            if len(Tset) != need:
+            chosen = sum(1 << g for g in choice)
+            right = [g for g in range(8) if not chosen >> g & 1]
+            remainder = [f for f in range(8) if not selected >> f & 1]
+            second = [[] for _ in range(8)]
+            for f in remainder:
+                hit = reverse_neighbors[f] & (255 ^ chosen)
+                if hit and hit & (hit - 1) == 0:
+                    second[hit.bit_length() - 1].append(f)
+            if any(not second[g] for g in right):
                 continue
-            rest = [f for f in F0 if f not in S]
-            part2 = {g: [f for f in rest if [x for x in Tset if IP[f][x]] == [g]] for g in Tset}
-            if any(not part2[g] for g in Tset):
-                continue
-            for choice2 in itertools.product(*[part2[g] for g in Tset]):
-                if len(set(choice2)) != len(Tset):
+            for choice2 in itertools.product(*(second[g] for g in right)):
+                if len(set(choice2)) != len(right):
                     continue
-                pairs = list(zip(S, choice)) + list(zip(Tset, choice2))
-                sols.append(pairs)
+                sols.append([(F0[f], F1[g]) for f, g in zip(left, choice)] +
+                            [(F1[g], F0[f]) for g, f in zip(right, choice2)])
     return sols
 
 

research/complex-general-normal-boundary/SOURCES.json

@@ -28,9 +28,10 @@
     },
     {
       "path": "research/complex-frame-pair-decoders/verify.py",
-      "usage": "input",
+      "usage": "provenance",
       "git_blob": "57dd8993e8ac016e8a92a9a885392b58014137bb",
-      "sha256": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
+      "sha256": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395",
+      "note": "Pairwise-era digest retained as provenance after research/frame-pair-enumeration-production/; working verify.py ships eight-bit neighborhood enumeration."
     },
     {
       "path": "research/root-pair-first-drop-seed48/CERTIFICATE.json",

research/complex-general-normal-boundary/VERIFY.json

@@ -6,7 +6,6 @@
   "inputs": [
     "research/complex-decoder-field-extension-seed44/PROOF.md",
     "research/complex-frame-pair-decoders/PROOF.md",
-    "research/complex-frame-pair-decoders/verify.py",
     "research/root-pair-first-drop-seed48/CERTIFICATE.json",
     "research/root-pair-first-drop-seed48/PROOF.md",
     "research/root-pair-first-drop-seed48/explore.py"

research/complex-puncture-depth-ceiling/SOURCES.json

@@ -34,9 +34,10 @@
     },
     {
       "path": "research/complex-frame-pair-decoders/verify.py",
-      "usage": "input",
+      "usage": "provenance",
       "git_blob": "57dd8993e8ac016e8a92a9a885392b58014137bb",
-      "sha256": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
+      "sha256": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395",
+      "note": "Pairwise-era digest retained as provenance after research/frame-pair-enumeration-production/; working verify.py ships eight-bit neighborhood enumeration."
     },
     {
       "path": "research/complex-local-word-ceiling/RESULT.json",

research/complex-puncture-depth-ceiling/VERIFY.json

@@ -8,7 +8,6 @@
     "research/community-frontier1094-audit/ASSEMBLY.json",
     "research/community-frontier1094-audit/INDEPENDENT1094.json",
     "research/complex-frame-pair-decoders/README.md",
-    "research/complex-frame-pair-decoders/verify.py",
     "research/complex-local-word-ceiling/RESULT.json",
     "research/complex-local-word-ceiling/ceiling.py"
   ],

research/e8-connectivity-incidence-boundary/SOURCES.json

@@ -22,9 +22,10 @@
     },
     {
       "path": "research/complex-frame-pair-decoders/verify.py",
-      "usage": "input",
+      "usage": "provenance",
       "git_blob": "57dd8993e8ac016e8a92a9a885392b58014137bb",
-      "sha256": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
+      "sha256": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395",
+      "note": "Pairwise-era digest retained as provenance after research/frame-pair-enumeration-production/; working verify.py ships eight-bit neighborhood enumeration."
     }
   ]
 }

research/e8-connectivity-incidence-boundary/VERIFY.json

@@ -4,8 +4,7 @@
   "python": "3.12",
   "requirements": [],
   "inputs": [
-    "research/complex-frame-pair-decoders/PROOF.md",
-    "research/complex-frame-pair-decoders/verify.py"
+    "research/complex-frame-pair-decoders/PROOF.md"
   ],
   "commands": [
     {
@@ -20,7 +19,13 @@
       "checks": "Regenerate genuine E8 frames, 28 connected graphs, exact upper/lower rank bounds, extra kernel independence, full-family and one-frame-repair positive controls; pivot-only rejection."
     },
     {
-      "argv": ["{python}", "-I", "-O", "-B", "{package}/test_verify.py"],
+      "argv": [
+        "{python}",
+        "-I",
+        "-O",
+        "-B",
+        "{package}/test_verify.py"
+      ],
       "timeout_seconds": 120,
       "checks": "Positive optimized CLI replay; deleted pivot, unknown negative support, disconnected signs, false rank and missing graph receipt rejection controls."
     }

research/e8-factor-linear-overcomplete47/SOURCES.json

@@ -2,14 +2,15 @@
   "base": "c0e3631dc24e3c24a861f7d3d79e0608481cccec",
   "files": {
     "research/complex-decoder-field-extension-seed44/PROOF.md": "a89530576d8a5e1ae8778d601b37140d954212cd46e06b87a3f565294ee251a2",
-    "research/complex-decoder-field-extension-seed44/SOURCES.json": "788c48817795740df3b997e3bf949298371138c37889d9f6b0c1e8fadffa442a",
+    "research/complex-decoder-field-extension-seed44/SOURCES.json": "645487fef9fcc9795f49ae900f00dcc8b8aaa6e2eb0394a0103945d67d45343b",
     "research/complex-decoder-field-extension-seed44/exact.py": "68902522a71053059f94d8f71ce9eed720fbe08603acbe5a4735d2c9305ac0ee",
-    "research/complex-decoder-field-extension-seed44/replay_source.py": "304c41e52b37270f3ed82aef5bc401737499aa8864959100475904d2ffd0b409",
-    "research/complex-decoder-field-extension-seed44/verify.py": "1c26de9d6a91ec1dc605ca4e9de7a05da3b44709b2efa9d1d6e285b783db89e0",
+    "research/complex-decoder-field-extension-seed44/replay_source.py": "9f585f714c71764100c0ffede9933284d856709316466b43337df30dcb847433",
+    "research/complex-decoder-field-extension-seed44/verify.py": "2ab6f1aad7b8e7c94899756c09940029a3d23433c65fc48ae73a462f126e7500",
     "research/complex-frame-pair-decoders/PROOF.md": "ba53c1d8a9bc2d935d546bde46ca7341bd65f8515013e07b073296b4db2a9a74",
     "research/complex-frame-pair-decoders/README.md": "edd848b0177dc73a6e2646d4fd82f0b2ceae37e642bf19d6af602579a041a57e",
-    "research/complex-frame-pair-decoders/verify.py": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
+    "research/frame-pair-enumeration-production/baseline.py": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
   },
   "selected_sha256": "10b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32",
-  "hash_domain": "SHA256 source bytes after CRLF-to-LF normalization"
+  "hash_domain": "SHA256 source bytes after CRLF-to-LF normalization",
+  "note": "After research/frame-pair-enumeration-production/, pairwise verify.py bytes are pinned via that package baseline.py; complex-decoder pins refreshed after the same retarget."
 }

research/e8-factor-linear-overcomplete47/verify.py

@@ -11,7 +11,9 @@
 BASE='c0e3631dc24e3c24a861f7d3d79e0608481cccec'
 OLD='research/complex-decoder-field-extension-seed44/'
 PAIR='research/complex-frame-pair-decoders/'
-PATHS={OLD+x for x in ('PROOF.md','verify.py','exact.py','replay_source.py','SOURCES.json')}|{PAIR+x for x in ('PROOF.md','README.md','verify.py')}
+PATHS={OLD+x for x in ('PROOF.md','verify.py','exact.py','replay_source.py','SOURCES.json')}|{
+    PAIR+'PROOF.md', PAIR+'README.md',
+    'research/frame-pair-enumeration-production/baseline.py'}
 
 def need(ok,msg):
     if not ok:raise ValueError(msg)

research/frame-pair-enumeration-fast-seed93/README.md

@@ -1,5 +1,8 @@
 # Faster exact frame-pair enumeration
 
+After `research/frame-pair-enumeration-production/`, the pairwise checker bytes live in [`baseline.py`](baseline.py); production `complex-frame-pair-decoders/verify.py` ships the neighborhood enumerator.
+
+
 Precomputed eight-bit neighborhoods accelerate PR968's complete frame-split
 search while preserving every ordered solution and its existing exact checks.
 On the recorded Windows CPython run, the enumeration median is **4.57x faster**;

research/frame-pair-enumeration-fast-seed93/SOURCES.json

@@ -1,8 +1,9 @@
 {
   "base_commit": "abdc6a7002abdbcd9e21bfc5e1a795784deacfdf",
   "files": {
-    "research/complex-frame-pair-decoders/verify.py": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
+    "research/frame-pair-enumeration-fast-seed93/baseline.py": "bdf7ee497dc04dfc634ee5b7848f6a2b39b0169668fb1a60a9715111dbd15395"
   },
   "hash_convention": "SHA256 after CRLF to LF normalization; all other bytes retained",
-  "predecessor": "themilkman216 PR968, Apache-2.0; exact source split order and checks retained"
+  "predecessor": "themilkman216 PR968, Apache-2.0; exact source split order and checks retained",
+  "note": "After research/frame-pair-enumeration-production/, pairwise bytes are vendored in baseline.py."
 }