#!/usr/bin/env python3 """Independent recomputation of the anchored bias beta(x) = S(x)/E(x). From the definitions in paper/anchored-note.md sections 1 and 6 only; no code is taken from any script in research/. W = x#; N_x = { r in [0,W) : r = 11 or 17 (mod 30), r mod p not in {0,p-2} for every prime 7<=p<=x }; N = |N_x|, claimed 2*prod_{7<=p<=x}(p-2); y = largest prime <= sqrt(W); S(x) = members of N_x with r mod q not in {0,q-2} for every prime x N), then for the scour primes on the same array (-> S), so survivors are a subset of the comb by construction. E is an exact Fraction, rounded once. Lemma 2 is checked against a separate Eratosthenes sieve of [0, W+3), not against the strike array. """ import sys, time from fractions import Fraction from math import isqrt, prod import numpy as np def prime_sieve(n): # index i true iff i is prime, for i in [0, n] s = np.ones(n + 1, dtype=bool) s[:2] = False for i in range(2, isqrt(n) + 1): if s[i]: s[i * i :: i] = False return s def primes_upto(n): return np.flatnonzero(prime_sieve(n)).tolist() def level(x, check_lemma2=True): t0 = time.time() W = prod(primes_upto(x)) # the tile, x# root = isqrt(W) small = primes_upto(root) y = small[-1] # largest prime <= sqrt(W) mid = [p for p in small if 7 <= p <= x] # comb primes scour = [q for q in small if x < q <= y] # scour primes alive = np.ones(W, dtype=bool) for p in mid: alive[0::p] = False alive[p - 2 :: p] = False N = int(alive[11::30].sum()) + int(alive[17::30].sum()) N_formula = 2 * prod(p - 2 for p in mid) for q in scour: alive[0::q] = False alive[q - 2 :: q] = False S = int(alive[11::30].sum()) + int(alive[17::30].sum()) surv = np.concatenate([np.flatnonzero(alive[c::30]).astype(np.int64) * 30 + c for c in (11, 17)]) surv.sort() assert len(surv) == S dens = Fraction(2, 30) # every prime 7 <= p <= y for q in [p for p in small if p >= 7]: dens *= Fraction(q - 2, q) E = float(dens * W) beta = S / E lem2 = "skipped" if check_lemma2: isp = prime_sieve(W + 3) below = int((surv <= y).sum()) bad_r = int((~isp[surv]).sum()) bad_r2 = int((~isp[surv + 2]).sum()) lem2 = ("ok: all %d survivors > y and (r, r+2) both prime" % S if below == 0 and bad_r == 0 and bad_r2 == 0 else "FAIL: %d <= y, %d r composite, %d r+2 composite" % (below, bad_r, bad_r2)) del isp del alive return dict(x=x, W=W, y=y, root=root, nscour=len(scour), N=N, N_formula=N_formula, S=S, E=E, beta=beta, lemma2=lem2, first=int(surv[0]) if S else None, last=int(surv[-1]) if S else None, secs=time.time() - t0) def _dp(v): # decimal places the draft quoted a value to return len(repr(float(v)).split(".")[1].rstrip("0")) or 0 DRAFT = { # paper/anchored-note.md section 3, as given to this agent 7: (8, 6.92, 1.1556), 11: (45, 39.27, 1.1458), 13: (307, 304.28, 1.0089), 17: (3099, 3245.51, 0.9549), 19: (38380, 41441.19, 0.9261), 23: (597475, 669028.8, 0.8930), } if __name__ == "__main__": levels = [int(a) for a in sys.argv[1:]] or [7, 11, 13, 17, 19, 23] print("independent beta recomputation (numpy %s, python %s)" % (np.__version__, sys.version.split()[0]), file=sys.stderr) # Draft 2: banner to stderr (report #67 item 3.6) print("%3s %18s %9s %8s %12s %10s %18s %9s %8s" % ("x", "W", "y", "#scour", "N", "N formula", "S", "E", "beta")) rows = [] for x in levels: r = level(x) rows.append(r) print("%3d %18d %9d %8d %12d %10d %18d %9.2f %8.4f" % (r["x"], r["W"], r["y"], r["nscour"], r["N"], r["N_formula"], r["S"], r["E"], r["beta"])) print() for r in rows: d = DRAFT.get(r["x"]) cmp = "" if d: cmp = (" draft S=%d E=%.2f beta=%.4f -> S %s, E %s, beta %s" % (d[0], d[1], d[2], "match" if r["S"] == d[0] else "DIFFER", "match" if abs(r["E"] - d[1]) <= 0.5 * 10 ** -_dp(d[1]) else "DIFFER", "match" if abs(r["beta"] - d[2]) <= 5e-5 else "DIFFER")) print("@%-2d N %s formula | first survivor %s (y=%d, floor sqrt W=%d) | " "Lemma 2 %s%s" % (r["x"], "=" if r["N"] == r["N_formula"] else "!=", r["first"], r["y"], r["root"], r["lemma2"], cmp)) print("@%-2d %.1f s" % (r["x"], r["secs"]), file=sys.stderr) # Draft 2: timing to stderr