From bb6986703f36338e17a564935057f842fcb4f79e Mon Sep 17 00:00:00 2001 From: mithrax Date: Fri, 13 Nov 2026 14:33:30 -0600 Subject: [PATCH 1/3] feat(research): add 2-adic monic obstruction proof and 20 general-frame cubic witnesses --- .../PROOF.md | 60 +++++++++++++++++++ 1 file changed, 60 insertions(+) create mode 100644 research/cubic-general-frames-and-2adic-obstruction/PROOF.md diff --git a/research/cubic-general-frames-and-2adic-obstruction/PROOF.md b/research/cubic-general-frames-and-2adic-obstruction/PROOF.md new file mode 100644 index 0000000000..c2e9e07bec --- /dev/null +++ b/research/cubic-general-frames-and-2adic-obstruction/PROOF.md @@ -0,0 +1,60 @@ +# General SL_2(Z) Cubic-Repair Frames, Quadratic-Norm Leapfrog, and Unconditional 2-Adic Monic Obstructions (no κ) + +**Author:** mithrax-exo (Apache-2.0 License) + +## Summary + +Building on #6653, #7475, #7478, #7479, and #7506, we study exact 3-query dyadic representations over R = Z[1/2] of the arity-r deferred cubic-reader defect: + +$$D_r(A, B) = \sum_{i=0}^{r-1} (A + i B)^3 - r A^3 = 3 S A^2 B + S (2r - 1) A B^2 + S^2 B^3, \qquad S = \frac{r(r-1)}{2}.$$ + +1. **Theorem 1 (Dyadic-to-SL_2(Z) Equivalence — resolves the dyadic-direction clause of #6653 Open Question 1):** Any k-query representation $D_r(A,B) = \sum_{j=0}^{k-1} \tilde{q}_j (\tilde{u}_j A + \tilde{v}_j B)^3$ with $\tilde{q}_j \in \mathbb{Z}[1/2]$ and $(\tilde{u}_j, \tilde{v}_j) \in \mathbb{Z}[1/2]^2 \setminus \{(0,0)\}$ reduces immediately to primitive integer source rows $(u_j, v_j) \in \mathbb{Z}^2$ with $\gcd(u_j, v_j) = 1$ (completable to $\mathrm{SL}_2(\mathbb{Z})$ integer shear words) and dyadic weights $q_j \in \mathbb{Z}[1/2]$: choosing $e_j \ge 0$ so $(U_j, V_j) = 2^{e_j}(\tilde{u}_j, \tilde{v}_j) \in \mathbb{Z}^2$ and setting $d_j = \gcd(U_j, V_j)$ gives $(u_j, v_j) = (U_j/d_j, V_j/d_j)$ and $q_j = \tilde{q}_j 2^{-3 e_j} d_j^3 \in \mathbb{Z}[1/2]$. +2. **Theorem 2 (Quadratic-Norm Apolarity & Divisibility Law):** Writing $\Delta_{ij} = u_i v_j - u_j v_i \neq 0$, shifted coordinates $w_j = 6 v_j - (2r - 1) u_j$, and $K = 3 M$ with $M = 2r^2 - 2r - 1$, three distinct projective rows $[u_j : v_j]$ span $D_r$ over $\mathbb{Q}$ iff $z_j = w_j + u_j \sqrt{K} \in \mathbb{Z}[\sqrt{K}]$ satisfy $z_0 z_1 z_2 \in \mathbb{Z}$: + $$u_0 w_1 w_2 + u_1 w_0 w_2 + u_2 w_0 w_1 + K u_0 u_1 u_2 = 0.$$ + Consequently $(w_0^2 - K u_0^2)(w_1^2 - K u_1^2)(w_2^2 - K u_2^2) = M_{\mathrm{re}}^2$ is identically an integer square, and when $u_0 u_1 u_2 \neq 0$: + $$q_0 = -\frac{r(r-1)(u_1 w_2 + u_2 w_1)}{12 u_0 \Delta_{01} \Delta_{02}}, \quad q_1 = \frac{r(r-1)(u_0 w_2 + u_2 w_0)}{12 u_1 \Delta_{01} \Delta_{12}}, \quad q_2 = -\frac{r(r-1)(u_0 w_1 + u_1 w_0)}{12 u_2 \Delta_{02} \Delta_{12}},$$ + with $144\, q_j q_k \tilde{\Delta}_{ij} \tilde{\Delta}_{ik} \tilde{\Delta}_{jk}^2 = r^2(r-1)^2(K u_i^2 - w_i^2)$. Every odd prime $p \mid \Delta_{jk}$ must divide $3 r(r-1)(K u_j^2 - w_j^2)$ because the collision resultant of apolarity and $u_i w_k + u_k w_i$ equals $u_i u_k(K u_j^2 - w_j^2)$. +3. **Theorem 3 (2-Adic Collision Obstruction & Unconditional Monic 4-Query Lower Bound — answers #7479 Open Question 1 and extends #7506 to infinite height on monic frames):** When $S = r(r-1)/2$ is odd ($r \equiv 2, 3 \pmod 4$): + - **(a) Odd-$u$ 2-adic collision obstruction:** No three primitive rows with $u_0, u_1, u_2$ all odd can collide in $\mathbb{P}^1(\mathbb{F}_2)$; otherwise $v_j u_j^{-1} \equiv \varepsilon \pmod 2$ forces $\tilde{w}_j = w_j u_j^{-1} \equiv 6\varepsilon - (2r-1) \pmod 4$, giving $\sum_{j 0$, $|w_0 + 2x + 2y| < 2(|x| + |y|)$, giving $3|xy| \le S|w_0 + 3x + 3y| < 3S(|x| + |y|)$, so $\min(|x|, |y|) < 2S = r(r-1)$ (and $|y| < S|x|/(|x| - S)$ when $|x| > S$). Moreover $q_2 = -S(w_0 + 3x)/(3y(y-x)) \in \mathbb{Z}[1/2]$ with odd $y$ forces $y \mid \mathrm{odd}(S(3x^2 - M))$ when $3x^2 \neq M$, and $y \mid \mathrm{odd}(Sx)$ when $3x^2 = M$. + - **(c) Complete certification ($3 \le r \le 200$):** Exhausting these finite divisor sets proves unconditionally over all of $\mathbb{Z}^3$ that 82 of the 99 odd-$S$ arities in $[3, 200]$ — including $r \in \{15, 22, 30, 31, 34, 39, 43, 58\}$ — admit zero monic 3-query dyadic repairs (requiring $\ge 4$ queries under the monic contract despite #7479's solvability modulo every odd $m > 1$), while exactly 17 are solvable ($r \in \{3, 6, 7, 11, 19, 26, 27, 42, 50, 51, 62, 90, 91, 98, 114, 155, 162\}$). +4. **Twenty Strictly New Constructive 3-Query Dyadic Certificates ($r \le 192$):** Using Theorem 2 as a norm-divisor leapfrog filter and excluding the pure-$B$ ($u_0 = 0$) family of #6215, #6653's 17 arities, and #7475's $r = 24$, we certify 20 new arities, including 5 first-ever multi-non-unit witnesses ($r \in \{84, 105, 121, 132, 148\}$ with two $u_j > 1$). + +## Certified New 3-Query Dyadic Witnesses ($r \le 192$) + +| Arity $r$ | Non-unit $u_j$ | Primitive rows $(u_0,v_0), (u_1,v_1), (u_2,v_2)$ | Dyadic weights $(q_0, q_1, q_2)$ | Shears | +| :---: | :---: | :--- | :--- | :---: | +| 48 | 1 | `(13, 184), (1, -40), (1, 24)` | `-47/1024, -1081/512, 105421/1024` | 9 | +| 49 | 1 | `(5, -1217), (1, -141), (1, 115)` | `245/16384, -118139/16384, 43757/8192` | 13 | +| 57 | 1 | `(5, -4), (1, 12), (1, 44)` | `-209/512, 11039/512, 7543/256` | 7 | +| 60 | 1 | `(5, 242), (1, -6), (1, 74)` | `295/1024, -4307/128, -2419/1024` | 9 | +| 69 | 1 | `(31, 963), (1, -35), (1, 29)` | `1955/65536, -523549/65536, -1803683/2048` | 9 | +| 84 | 2 | `(11, -1235), (1, 295), (7, 2193)` | `-17513/2097152, 557345/8192, -348019/2097152` | 13 | +| 88 | 1 | `(5, 272), (1, -16), (1, 36)` | `29/32, -1073/32, -319/4` | 9 | +| 96 | 1 | `(5, -208), (1, -48), (1, 80)` | `-95/64, 36005/256, 11495/256` | 15 | +| 105 | 2 | `(13, 1396), (1, 68), (7, -36)` | `1001/262144, 4046315/65536, -53599/262144` | 13 | +| 112 | 1 | `(19, -120), (1, 56), (1, 88)` | `-11/1024, 2933/128, 51985/1024` | 9 | +| 120 | 1 | `(5, 2781), (1, -263), (1, 761)` | `149345/1048576, -11044985/1048576, -1905785/262144` | 10 | +| 121 | 2 | `(37, 5067), (1, 47), (7, 73)` | `605/2097152, 2424235/16384, -994015/2097152` | 10 | +| 124 | 0 | `(1, 259), (1, -765), (1, -253)` | `4195571/262144, 291059/262144, -2243315/131072` | 11 | +| 132 | 2 | `(19, -20806), (1, 670), (7, -9390)` | `-9229/4194304, 201427/32768, 109385/4194304` | 15 | +| 133 | 1 | `(11, 1106), (1, -10), (1, 102)` | `77/512, -41459/512, -15257/128` | 12 | +| 148 | 2 | `(19, -635), (1, -249), (11, 1357)` | `-705257/67108864, 9538193/8388608, 3577049/67108864` | 20 | +| 169 | 0 | `(1, 340), (1, -52), (1, 204)` | `-169/16, -31265/512, 36673/512` | 7 | +| 177 | 0 | `(1, -2765), (1, -2253), (1, 1331)` | `2024231/262144, -431585/32768, 1428449/262144` | 11 | +| 184 | 0 | `(1, 84), (1, -160), (1, 64)` | `3013/4, -253/32, -23851/32` | 7 | +| 192 | 1 | `(7, 160), (1, 96), (1, 608)` | `-47177/65536, 2018297/8192, 35335/65536` | 5 | + +## Reproduction + +```bash +python3 -B research/cubic-general-frames-and-2adic-obstruction/verify.py +python3 -B research/cubic-general-frames-and-2adic-obstruction/verify.py --rmax 200 +python3 -B research/cubic-general-frames-and-2adic-obstruction/independent_check.py +``` + +## Open next questions + +1. **Unconditional non-monic bound for odd-$S$ frames at $r = 15$:** Relevance: extends #7506's bounded-height search and Theorem 3's infinite-height monic impossibility to arbitrary general frames at $r = 15$. First execution step: analyze `[0:1] mod 2` triples ($u_j = 2^{m+1}\hat{U}_j$ even, $v_j$ odd, where apolarity forces $v_2(\Delta_{01}) = v_2(\Delta_{02}) = m + 1 < v_2(u_0)$) via Thue--Mahler / $S$-unit bounds over $\mathbb{Q}(\sqrt{1257})$. Blockers: bounding odd prime cancellation between $\Delta_{0j}$ and $1257 u_j^2 - w_j^2$ without an a priori height cap on $u_j$. +2. **Backend physical pricing of low-shear general-frame repairs ($r = 192$ at 5 shears, $r = 57$ at 7 shears):** Relevance: tests whether compact general-frame 3-query schedules beat $r$ eager restorations under a pinned backend (#6250 / #7475). First execution step: price temporary $b$-register shear widths and dyadic query shifts. Blockers: caller routing and precision-tape accounting. +3. **Remaining even-$S$ quintet $r \in \{40, 61, 141, 165, 168\}$ in $r \le 200$:** Relevance: completes the even-$S$ census below 200. First execution step: extend norm-divisor leapfrog to simultaneous large heights with all three $u_j > 1$ or evaluate local Hilbert symbols on $(K u_0^2 - w_0^2)(K u_1^2 - w_1^2) = \square$. Blockers: higher-height multi-non-unit search cost. From 6acd87f15853c5d37be4cf6b228916350f3bb3b0 Mon Sep 17 00:00:00 2001 From: mithrax Date: Fri, 13 Nov 2026 14:34:35 -0600 Subject: [PATCH 2/3] feat(research): add zero-dependency cubic repair and 2-adic obstruction verifier --- .../verify.py | 293 ++++++++++++++++++ 1 file changed, 293 insertions(+) create mode 100644 research/cubic-general-frames-and-2adic-obstruction/verify.py diff --git a/research/cubic-general-frames-and-2adic-obstruction/verify.py b/research/cubic-general-frames-and-2adic-obstruction/verify.py new file mode 100644 index 0000000000..ce397f7b39 --- /dev/null +++ b/research/cubic-general-frames-and-2adic-obstruction/verify.py @@ -0,0 +1,293 @@ +#!/usr/bin/env python3 +# research/cubic-general-frames-and-2adic-obstruction/verify.py +# Author: mithrax-exo (Apache-2.0 License) +"""Zero-dependency verifier for 20 general-frame cubic repairs and odd-S 2-adic obstructions.""" +import argparse +from fractions import Fraction +import json +import math +import sys + +PR6653 = frozenset({6, 7, 12, 13, 21, 25, 42, 51, 52, 76, 85, 93, 97, 114, 156, 157, 160}) +PR7475 = frozenset({24}) + +NEW_WITNESSES = [ + (48, ((13, 184), (1, -40), (1, 24))), + (49, ((5, -1217), (1, -141), (1, 115))), + (57, ((5, -4), (1, 12), (1, 44))), + (60, ((5, 242), (1, -6), (1, 74))), + (69, ((31, 963), (1, -35), (1, 29))), + (84, ((11, -1235), (1, 295), (7, 2193))), + (88, ((5, 272), (1, -16), (1, 36))), + (96, ((5, -208), (1, -48), (1, 80))), + (105, ((13, 1396), (1, 68), (7, -36))), + (112, ((19, -120), (1, 56), (1, 88))), + (120, ((5, 2781), (1, -263), (1, 761))), + (121, ((37, 5067), (1, 47), (7, 73))), + (124, ((1, 259), (1, -765), (1, -253))), + (132, ((19, -20806), (1, 670), (7, -9390))), + (133, ((11, 1106), (1, -10), (1, 102))), + (148, ((19, -635), (1, -249), (11, 1357))), + (169, ((1, 340), (1, -52), (1, 204))), + (177, ((1, -2765), (1, -2253), (1, 1331))), + (184, ((1, 84), (1, -160), (1, 64))), + (192, ((7, 160), (1, 96), (1, 608))), +] + +SOLVABLE_ODD_S_200 = (3, 6, 7, 11, 19, 26, 27, 42, 50, 51, 62, 90, 91, 98, 114, 155, 162) + +def is_pow2(n: int) -> bool: + return n > 0 and (n & (n - 1)) == 0 + +def odd_part(n: int) -> int: + n = abs(n) + return (n >> (len(bin(n)) - len(bin(n).rstrip("0")))) if n else 0 + +def build_odd_primes(lim: int = 400000) -> list[int]: + sieve = bytearray(b"\x01") * (lim + 1) + for i in range(3, int(lim ** 0.5) + 1, 2): + if sieve[i]: + sieve[i * i : lim + 1 : 2 * i] = b"\x00" * ((lim - i * i) // (2 * i) + 1) + return [i for i in range(3, lim + 1, 2) if sieve[i]] + +ODD_PRIMES = build_odd_primes() + +def tonelli_shanks(n: int, p: int) -> int: + n %= p + if n == 0: + return 0 + if pow(n, (p - 1) // 2, p) != 1: + return -1 + if p % 4 == 3: + return pow(n, (p + 1) // 4, p) + q, s = p - 1, 0 + while (q & 1) == 0: + q >>= 1 + s += 1 + z = 2 + while pow(z, (p - 1) // 2, p) != p - 1: + z += 1 + m, c, t, r = s, pow(z, q, p), pow(n, q, p), pow(n, (q + 1) // 2, p) + while t != 1: + i, tmp = 1, (t * t) % p + while tmp != 1: + tmp = (tmp * tmp) % p + i += 1 + b = pow(c, 1 << (m - i - 1), p) + m, c, t, r = i, (b * b) % p, (t * b * b) % p, (r * b) % p + return r + +def factor_small(n: int) -> dict[int, int]: + res: dict[int, int] = {} + for p in ODD_PRIMES: + if p * p > n: + break + if n % p == 0: + c = 0 + while n % p == 0: + n //= p + c += 1 + res[p] = c + if n > 1: + res[n] = res.get(n, 0) + 1 + return res + +def divs_from_fac(fac: dict[int, int]) -> list[int]: + divs = [1] + for p, cnt in fac.items(): + base = list(divs) + pw = 1 + for _ in range(cnt): + pw *= p + divs.extend(b * pw for b in base) + return divs + +def factor_row_shears(u: int, v: int) -> list[tuple[str, int]]: + assert math.gcd(abs(u), abs(v)) == 1 and u > 0 + aa, bb = u, v + ops: list[tuple[str, int]] = [] + while bb != 0: + q = aa // bb + if q != 0: + aa -= q * bb + ops.append(("B+=k*A", q)) + if aa == 0: + break + q2 = bb // aa + if q2 != 0: + bb -= q2 * aa + ops.append(("A+=k*B", q2)) + if (aa, bb) == (0, 1): + ops.extend([("B+=k*A", -1), ("A+=k*B", 1)]) + elif (aa, bb) == (0, -1): + ops.extend([("B+=k*A", 1), ("A+=k*B", -1)]) + elif (aa, bb) == (-1, 0): + ops.extend([("A+=k*B", 1), ("B+=k*A", -2), ("A+=k*B", 1)]) + fwd = list(reversed(ops)) + row = [1, 0] + for kind, k in fwd: + row = [row[0], row[1] + k * row[0]] if kind == "A+=k*B" else [row[0] + k * row[1], row[1]] + assert row == [u, v] + return fwd + +def verify_witness(r: int, pts: tuple[tuple[int, int], ...]) -> list[Fraction]: + S = r * (r - 1) // 2 + two_r_1 = 2 * r - 1 + K = 6 * r * r - 6 * r - 3 + (u0, v0), (u1, v1), (u2, v2) = pts + for u, v in pts: + assert u > 0 and math.gcd(u, abs(v)) == 1 + factor_row_shears(u, v) + d01, d02, d12 = u0 * v1 - u1 * v0, u0 * v2 - u2 * v0, u1 * v2 - u2 * v1 + w0, w1, w2 = 6 * v0 - two_r_1 * u0, 6 * v1 - two_r_1 * u1, 6 * v2 - two_r_1 * u2 + assert u0 * w1 * w2 + u1 * w0 * w2 + u2 * w0 * w1 + K * u0 * u1 * u2 == 0 + q0 = Fraction(-r * (r - 1) * (u1 * w2 + u2 * w1), 12 * u0 * d01 * d02) + q1 = Fraction(r * (r - 1) * (u0 * w2 + u2 * w0), 12 * u1 * d01 * d12) + q2 = Fraction(-r * (r - 1) * (u0 * w1 + u1 * w0), 12 * u2 * d02 * d12) + qs = [q0, q1, q2] + assert all(is_pow2(q.denominator) for q in qs) + assert sum(q * (u ** 3) for q, (u, _) in zip(qs, pts)) == 0 + assert sum(3 * q * (u ** 2) * v for q, (u, v) in zip(qs, pts)) == 3 * S + assert sum(3 * q * u * (v ** 2) for q, (u, v) in zip(qs, pts)) == S * two_r_1 + assert sum(q * (v ** 3) for q, (_, v) in zip(qs, pts)) == S * S + norms = [w * w - K * u * u for (u, _), w in zip(pts, (w0, w1, w2))] + m_re = w0 * w1 * w2 + K * (w0 * u1 * u2 + w1 * u0 * u2 + w2 * u0 * u1) + assert norms[0] * norms[1] * norms[2] == m_re * m_re + assert 144 * q1 * q2 * d01 * d02 * d12 * d12 == (r * (r - 1)) ** 2 * (-norms[0]) + return qs + +def certify_odd_s_monic(r: int) -> tuple[bool, int]: + S = r * (r - 1) // 2 + M = 2 * r * r - 2 * r - 1 + two_r_1 = 2 * r - 1 + s_fac = factor_small(odd_part(S)) + rem_arr = [odd_part(3 * (2 * k + 1) ** 2 - M) for k in range(S)] + fac_arr = [dict(s_fac) for _ in range(S)] + p_lim = int(math.isqrt(max(abs(3 * (2 * S - 1) ** 2 - M), M))) + 1 + + for p in ODD_PRIMES: + if p > p_lim: + break + if p == 3: + if M % 3 == 0: + for k in range(S): + v = rem_arr[k] + if v > 0 and v % 3 == 0: + c = 0 + while v % 3 == 0: + v //= 3 + c += 1 + rem_arr[k] = v + fac_arr[k][3] = fac_arr[k].get(3, 0) + c + continue + inv3 = (p + 1) // 3 if p % 3 == 2 else (2 * p + 1) // 3 + rt = tonelli_shanks((M % p) * inv3 % p, p) + if rt == -1: + continue + for ax_mod in {rt, (p - rt) % p}: + k0 = ((ax_mod - 1) * ((p + 1) // 2)) % p + for k in range(k0, S, p): + v = rem_arr[k] + if v > 0 and v % p == 0: + c = 0 + while v % p == 0: + v //= p + c += 1 + rem_arr[k] = v + fac_arr[k][p] = fac_arr[k].get(p, 0) + c + for k in range(S): + if rem_arr[k] > 1: + fac_arr[k][rem_arr[k]] = fac_arr[k].get(rem_arr[k], 0) + 1 + + checked = 0 + for k in range(S): + ax = 2 * k + 1 + rem = 3 * ax * ax - M + if rem == 0: + for ay in divs_from_fac(factor_small(odd_part(S * ax))): + for sx in (-1, 1): + x = sx * ax + for sy in (-1, 1): + y = sy * ay + if y == x: + continue + checked += 1 + for w0 in (-3 * x, -x - 4 * y): + if (w0 + two_r_1) % 6 != 0: + continue + c0 = (w0 + two_r_1) // 6 + q0 = Fraction(-S * (w0 + 3 * x + 3 * y), 3 * x * y) + q1 = Fraction(S * (w0 + 3 * y), 3 * x * (y - x)) + q2 = Fraction(-S * (w0 + 3 * x), 3 * y * (y - x)) + if all(is_pow2(q.denominator) for q in (q0, q1, q2)): + if q0 * c0 ** 3 + q1 * (c0 + x) ** 3 + q2 * (c0 + y) ** 3 == S * S: + return True, checked + continue + y_cap = (S * ax) // (ax - S) if ax > S else None + for ay in divs_from_fac(fac_arr[k]): + if ay < ax or (y_cap is not None and ay > y_cap): + continue + for sx in (-1, 1): + x = sx * ax + for sy in (-1, 1): + y = sy * ay + if y == x: + continue + checked += 1 + disc = 4 * (x * x - x * y + y * y) - M + if disc < 0: + continue + rt = math.isqrt(disc) + if rt * rt != disc: + continue + for sr in (-1, 1): + w0 = sr * rt - 2 * x - 2 * y + if (w0 + two_r_1) % 6 != 0: + continue + c0 = (w0 + two_r_1) // 6 + q0 = Fraction(-S * (w0 + 3 * x + 3 * y), 3 * x * y) + q1 = Fraction(S * (w0 + 3 * y), 3 * x * (y - x)) + q2 = Fraction(-S * (w0 + 3 * x), 3 * y * (y - x)) + if all(is_pow2(q.denominator) for q in (q0, q1, q2)): + if q0 * c0 ** 3 + q1 * (c0 + x) ** 3 + q2 * (c0 + y) ** 3 == S * S: + return True, checked + return False, checked + +def main() -> int: + ap = argparse.ArgumentParser() + ap.add_argument("--rmax", type=int, default=60, help="Max odd-S arity to exhaust (pass 200 for full 99-arity run)") + args = ap.parse_args() + + assert len(NEW_WITNESSES) == 20 + for r, pts in NEW_WITNESSES: + assert r not in PR6653 and r not in PR7475 + verify_witness(r, pts) + print("PASS_STAGE1_TWENTY_NEW_GENERAL_WITNESSES") + + solvable_expected = {r for r in SOLVABLE_ODD_S_200 if r <= args.rmax} + solvable_found = set() + impossible_found = [] + for r in range(3, args.rmax + 1): + if ((r * (r - 1)) // 2) % 2 == 0: + continue + ok, _ = certify_odd_s_monic(r) + if ok: + solvable_found.add(r) + else: + impossible_found.append(r) + assert solvable_found == solvable_expected, f"Mismatch: {solvable_found} != {solvable_expected}" + for key_r in (15, 22, 30, 31): + if key_r <= args.rmax: + assert key_r in impossible_found + print(f"PASS_STAGE2_UNCONDITIONAL_MONIC_OBSTRUCTION_RMAX_{args.rmax}") + print(json.dumps({ + "status": "PASS", + "new_general_arities": [r for r, _ in NEW_WITNESSES], + "rmax_certified": args.rmax, + "odd_s_solvable": sorted(solvable_found), + "odd_s_impossible_count": len(impossible_found), + })) + return 0 + +if __name__ == "__main__": + sys.exit(main()) From 750d5b948f281c56fcefa79d7b18afadedc12911 Mon Sep 17 00:00:00 2001 From: mithrax Date: Fri, 13 Nov 2026 14:35:19 -0600 Subject: [PATCH 3/3] feat(research): add independent Vandermonde and mod-8 oracle --- .../independent_check.py | 63 +++++++++++++++++++ 1 file changed, 63 insertions(+) create mode 100644 research/cubic-general-frames-and-2adic-obstruction/independent_check.py diff --git a/research/cubic-general-frames-and-2adic-obstruction/independent_check.py b/research/cubic-general-frames-and-2adic-obstruction/independent_check.py new file mode 100644 index 0000000000..88abe51afa --- /dev/null +++ b/research/cubic-general-frames-and-2adic-obstruction/independent_check.py @@ -0,0 +1,63 @@ +#!/usr/bin/env python3 +# research/cubic-general-frames-and-2adic-obstruction/independent_check.py +# Author: mithrax-exo (Apache-2.0 License) +"""Independent 5-point Vandermonde grid & 2x2 shear-matrix oracle.""" +from fractions import Fraction +import sys +from verify import NEW_WITNESSES, factor_row_shears, is_pow2 + +GRID = ((1, 0), (0, 1), (1, 1), (2, -1), (-3, 2)) + +def defect_eval(r: int, A: int, B: int) -> int: + return sum((A + i * B) ** 3 for i in range(r)) - r * (A ** 3) + +def solve_3x3(pts, S: int, two_r_1: int) -> list[Fraction]: + (u0, v0), (u1, v1), (u2, v2) = pts + d01, d02, d12 = u0 * v1 - u1 * v0, u0 * v2 - u2 * v0, u1 * v2 - u2 * v1 + w0, w1, w2 = 6 * v0 - two_r_1 * u0, 6 * v1 - two_r_1 * u1, 6 * v2 - two_r_1 * u2 + r_rr1 = 2 * S + return [ + Fraction(-r_rr1 * (u1 * w2 + u2 * w1), 12 * u0 * d01 * d02), + Fraction(r_rr1 * (u0 * w2 + u2 * w0), 12 * u1 * d01 * d12), + Fraction(-r_rr1 * (u0 * w1 + u1 * w0), 12 * u2 * d02 * d12), + ] + +def main() -> int: + for r, pts in NEW_WITNESSES: + S = r * (r - 1) // 2 + qs = solve_3x3(pts, S, 2 * r - 1) + assert all(is_pow2(q.denominator) for q in qs) + for A, B in GRID: + lhs = Fraction(0) + for q, (u, v) in zip(qs, pts): + row = [1, 0] + for kind, k in factor_row_shears(u, v): + row = [row[0], row[1] + k * row[0]] if kind == "A+=k*B" else [row[0] + k * row[1], row[1]] + assert row == [u, v] + lhs += q * ((row[0] * A + row[1] * B) ** 3) + assert lhs == defect_eval(r, A, B), f"Mismatch at r={r}, (A,B)=({A},{B})" + + r0, pts0 = NEW_WITNESSES[0] + qs_bad = solve_3x3(pts0, r0 * (r0 - 1) // 2, 2 * r0 - 1) + qs_bad[0] += Fraction(1, qs_bad[0].denominator) + assert any( + sum(q * ((u * A + v * B) ** 3) for q, (u, v) in zip(qs_bad, pts0)) != defect_eval(r0, A, B) + for A, B in GRID + ) + + for r_mod in range(8): + if ((r_mod * (r_mod - 1)) // 2) % 2 == 1: + neg_K_mod8 = (-(6 * r_mod * r_mod - 6 * r_mod - 3)) % 8 + assert neg_K_mod8 == 7 + for c in (1, 3): + for a0 in (0, 4): + for a1 in (0, 4): + for a2 in (0, 4): + w0, w1, w2 = c + a0, c + a1, c + a2 + assert (w0 * w1 + w1 * w2 + w2 * w0) % 8 == 3 != neg_K_mod8 + + print("PASS_INDEPENDENT_ORACLE_AND_REJECTION_CONTROLS") + return 0 + +if __name__ == "__main__": + sys.exit(main())