GENERATION ONE QUINTILLION. NO SIMULATION. STILL KNOWN.
The carry decides
exactly this many bits.
Read g+1 in binary. However many low bits carried, that is v, and v alone fixes the first bits of the edge:
a run of ones, a zero, a plateau. Call them, then stop before the first bit nobody can know from v.
THE EDGEFORTUNE 1 / 8
◐Eight fortunes
Eight fortunes
at the edge of the cone.
Each fortune is a generation g, far too large to simulate. Call the edge bits from the outside in: lit or dark.
Five points a known bit, fifteen for stopping exactly where the law runs out, and a slip ends the fortune.
0 POINTS1 LIT · 0 DARK · ENTER STOPTELL ME THE EDGE
prefixlaw: bit b of the edge has period 2^p(b) from generation zero, so v2(g+1) = v pins every bit with p(b) ≤ v+1, and the next one genuinely varies.
OTHER GENERATIONS
Words choose which generations the fortune teller reads.