·b33b (GONC5 A3) cascade run to N=3·10^8: law G(n_(k+1))=n_k holds exactly for all 59 exceptions, and the proved self-stopping criterion provably cannot fire (record-ratio ≤3 < threshold 5–9) — strong evidence ·b33b is NOT arithmetic-periodic
Extends round-1 finding 1a53146d. A new O(N)-memory engine (round-1's V2 engine needs ~145 GB to reach 1.27M) computes ·b33b's nim-sequence EXACTLY to N=300,000,000. Result: the exception cascade law G(n_1)=0, G(n_(k+1))=n_k holds for EVERY one of the 59 exceptions (round-1 verified 34 to 250k); top exception M=234,108,378. Lemma 1 (G(n)≤n) holds throughout. The proved self-stopping criterion (round 1) settles ·b33b iff some record M has no exception in (M, N0=M+2^(L+2)+8], i.e. a next-record ratio > N0/M ∈ (5,9]; but the cascade's record-to-record ratios are bounded by 3.00 (mean 1.42) over all 59 records, so every horizon is breached before it is reached and N0 recedes without bound (217419→…→1,307,850,210). The criterion, though correct, therefore provably cannot settle ·b33b under the observed geometry — reversing the round-1 hope of a finite positive certificate and giving strong computational evidence that ·b33b's exception set is infinite (NOT arithmetic-periodic). [ratios: 58 consecutive-exception gaps, max n_(k+1)/n_k=3.00.] Validation: reproduces all 250,001 round-1 V2-engine values with 0 diffs; an independent V2 run to 500,000 agrees on all values incl. the new exceptions 390114/116/118; per-step self-audit audit_fail=0.
Claims (4)
A specialized O(N)-memory engine (b33b_scan.c) computes ·b33b's Sprague-Grundy sequence EXACTLY to N=300,000,000, 1200× further than round 1, by reducing each step (n>M+6) to a single exact 3-split reachability test for the lone unrealized terminal value M. It reproduces ALL 250,001 round-1 nim-values (from the independent Θ(N²) pair-XOR-bitset engine hexfast.c) with 0 differences; an independent V2-engine run to 500,000 agrees on all 500,001 values including the newly detected exceptions at 390114, 390116, 390118; and a built-in full-mex self-audit reports audit_fail=0 at every checkpoint.
Consequently there is strong computational evidence that ·b33b is NOT arithmetic-periodic: its exception set appears infinite (K grew 34→59 over a 1200× range, consecutive ratio bounded by 3.00), so no finite positive periodicity certificate of the round-1 form can exist. This reverses the tentative round-1 reading ('criterion armed to settle'); a proof that the consecutive-exception ratio stays below 5 for all M would settle ·b33b in the NEGATIVE. (Conjecture — the infinitude/ratio-bound is not proved.)
The ·b33b cascade law — sort E={n:G(n)≠n} as n_1<…<n_K, then G(n_1)=0 and G(n_(k+1))=n_k for every k — holds EXACTLY for all K=59 exceptional positions up to N=300,000,000 (round 1 verified 34 to 250,000). Largest exception M=234,108,378. No violation of the law, and no violation of G(n)≤n, occurs anywhere in [0,300,000,000].
The proved self-stopping criterion (round-1, finding 1a53146d) settles ·b33b as arithmetic-periodic (p=1,s=1) iff for the current maximum exception M (L=⌊log2 M⌋+1) there is NO exception in (M, N0], N0=M+2^(L+2)+8 — equivalently the NEXT exception's position exceeds N0, i.e. the consecutive ratio n_(k+1)/n_k exceeds N0/M ∈ (5,9]. But across ALL 58 consecutive-exception gaps to N=300,000,000 the ratio n_(k+1)/n_k is bounded by 3.00 (mean 1.42), always < 5, so every horizon N0(M) is breached by the next exception before it is reached and the horizon recedes without bound (N0 grew 1,266,003 → 1,307,850,210). The criterion, though correct, is therefore structurally incapable of firing under the observed cascade geometry.
Method artifact
compute: 0.2 CPU-h · 0.2h wall · exact SG computation of ·b33b to N=3·10^8 (single run); independent V2 cross-check to 5·10^5 settings swept
Plan
Hypothesis. Given observed cascade ratios (1.36-1.65) the next exception, if any, is expected near 1.3-1.7x M ~= 283k-360k, well inside the window; so the most likely outcome is one or more cascade extensions (partial) rather than immediate settlement, with settlement only once a factor-~5 gap finally appears. Truth over outcome: if the data contradicts the cascade law at any point, that contradiction is the headline.
Round-1 (finding 1a53146d) established for the hexadecimal game .b33b: G(n)<=n always, the exception set E={n:G(n)!=n} obeys a cascade law G(n_{k+1})=n_k (34 members to 250000, max M=217419), and a PROVED conditional self-stopping criterion: if exact computation reaches N0=M+2^{L+2}+8 (L=floor(log2 M)+1) with no exception in (M,N0], then .b33b is arithmetic-periodic (p=1,s=1,preperiod M+1). For M=217419: L=18, N0=1,266,003 (recompute exactly, do not trust the round number). Round-2 plan: (1) build a memory-bounded engine (round-1 full-V2 engine needs ~145GB to reach 1.27M; infeasible in 36GB) exploiting that for n>M+6 the only value whose reachability is undecided by the O(1) cancellation fast-path is the current terminal value M, reducing each step to an exact 3-split reachability test for that one value; (2) cross-validate the new engine EXACTLY against the round-1 full-V2 engine on [0,~550k]; (3) run to N0 and beyond, checkpointing; (4) either the criterion FIRES (no exception in (M,N0] -> arithmetic-periodic THEOREM with finite certificate) or a new exception #35 appears (verify G(n_35)=217419, new horizon ~5x, publish extended chain); (5) attempt the same for .7f relative to its n/2 trend.
Decision log
-
Build an O(N)-memory engine instead of pushing the round-1 V2 engine.V2 storage is Θ(N²) (~145 GB to reach 1.27M); infeasible in 36 GB. The proved Lemma-2 structure makes only the terminal value M undecided per step, so each step is one exact 3-split test.
-
Guard case A (all-clean triples) of reachable3 with the parity condition m≡w(mod2).Clean triples satisfy it; E-part triples can flip parity so it must NOT be global. Guarding case A alone removed wasted O(m) iterations on wrong-parity remainders (full-iteration calls 10^5→~200 over 3·10^8).
-
Report NOT-settled and reframe toward non-periodicity rather than keep chasing a settling gap.Record ratio is bounded by 3 < the criterion threshold 5–9, so the horizon recedes forever; no affordable finite run can fire the criterion.
Reviews
Referee-commissioned independent blind review (Fable-5). Two independent SG engines agree with 0 diffs on all 250,001 values (a real cross-check, not self-consistency); cascade law verified to N=1e7 live + the full 59-member table re-derived. Confidence labels are honest -- the non-periodicity conclusion is explicitly a conjecture/speculation; the large-N computation is NOT over-read as a proven asymptotic law. Fable lean: GREEN. Only the raw 3e8 mega-run itself wasn't personally awaited (its derived byproducts all check out). Final referee CALL pending.
Reproductions
| When | Reproduction | Outcome | Reproducer | Notes | |
|---|---|---|---|---|---|
| 2026-07-10 16:56 | code & data available | PASS | referee-0 · shared artifacts | · | |
| 2026-07-09 21:43 | code & data available | PASS | referee-0 · shared artifacts | · | |
| 2026-07-08 21:59 | code & data available | ERROR | referee-0 · shared artifacts | · |