Continue the Thread

Axiom Arcade
6 games at 60fps in pure .ax
Emergence
AND/XOR/MAJ produce Life=7
.ax Revolution
Ship of Theseus: .ax replaces everything
Bootstrap
sigma/sigma = sigma uniqueness

The Bernoulli Connection

denom(B_2k) = prod{p : (p-1)|2k}

The Bernoulli numbers are among the oldest objects in mathematics -- they appear in power sum formulas, in zeta values at even integers, and in the Taylor series for tangent. In 1840, von Staudt and Clausen proved that denom(B_2k) = product of all primes p where (p-1)|2k. Nobody noticed what happens when you combine this with the Cunningham map c(n) = 2n+1.

The Period Theorem

Each axiom prime p enters the Bernoulli denominator with a specific period -- how often it appears as k increases. Since p = c(q) for the Cunningham chain, the condition (p-1)|2k becomes q|k. The period of each prime IS the previous axiom prime.

Period Theorem (S354, PROVED)
Each axiom prime's Bernoulli frequency = 1/(previous axiom prime). D=2 and K=3: always present (period 1). E=5: period D=2. b=7: period K=3. L=11: period E=5. The Cunningham chain that generates the axiom IS the hierarchy governing Bernoulli denominators.
PrimePeriodMeaning
D = 21 (always)Ground pair, never absent
K = 31 (always)Closure, never absent
E = 5D = 2Every 2nd Bernoulli
b = 7K = 3Every 3rd Bernoulli
L = 11E = 5Every 5th Bernoulli

First simultaneous appearance of all five: B_60 at k = 30 = D*K*E = lcm{1,1,2,3,5}. Not coincidence -- 30 = product of the first three axiom primes.

The Bernoulli Table

Watch as k increases. Each axiom prime dances in and out on its own Cunningham-inherited schedule.

B_2kkDenomName
B_216 = D*KGround pair
B_4230 = D*K*EObserver enters
B_6342 = D*K*bTHE ANSWER
B_8430 = D*K*EE returns, b gone
B_10566 = D*K*LTranscendental! L enters
B_1262730 = D*K*E*b*13GATE enters
B_2010330 = D*K*E*LANIMAL (b missing)
B_6030all 5 + intrudersFirst pentagonal

At k=3, depth b=7 enters for the first time. The denominator is 2*3*7 = 42. The answer to the ultimate question is the Bernoulli denominator where depth first appears. At k=5, transcendental L=11 enters -- but E=5 is gone (period D=2, and 5 is odd).

The Gate Breach

At k=6: E=5 present (2|6) and b=7 present (3|6). But 6|6 means 12|12 means (13-1)|12. The gate 13 is FORCED open whenever observation and depth coexist.

DATA Impossibility (S354, PROVED)
denom(B_2k) = D*K*E*b = 210 can NEVER happen. E requires 2|k (period D). b requires 3|k (period K). Together: 6|k. But 6|k forces 12|2k forces (13-1)|2k. The GATE always enters with observation + depth. The DATA ring 210 is structurally forbidden as a Bernoulli denominator.

The Ramanujan denominator 2730 = THIN + lambda = 2310 + 420. The famous 691 in the numerator of B_12? That is the scar left by L=11's absence: period(L) = E = 5, and 5 does not divide 6. The transcendental was locked out.

The Self-Reference Loop

The Cunningham chain D=2 -> E=5 -> L=11 -> 23 -> 47 extends past the axiom. The prime 23 = c(L) has Bernoulli period (23-1)/2 = 11 = L. The chain L -> c(L) = 23 -> period(23) = L is a fixed-point loop. The contaminator's Bernoulli period IS the prime that generated it.

9 smooth sentinels
Intruders 13..43
First K^2=9 intruder primes all have axiom-smooth half-periods.
S354
10th intruder
47 = c(c(L))
Half-period 23 = c(L): non-smooth. Nine smooth sentinels guard the boundary.
S354

Smooth Bernoulli Density

How many Bernoulli numbers have 11-smooth denominators? Each intruder p > 11 contaminates at rate 1/s where s = (p-1)/2:

Intruder pHalf-period sFactoredSurvival
13 (GATE)6D*K5/6
17 (ESCAPE)8D^37/8
199K^28/9
23 = c(L)11L10/11

Four-contamination product: (5*7*8*10)/(6*8*9*11) = 175/297 = E^2*b / K^3*L. Exact axiom expression. Asymptotic density decays; at k = 770 = D*E*b*L, it hits exactly K/(D*E) = 3/10.

The Enrichment Ladder

Eisenstein series E_k have coefficients related to divisor sums. Modular enrichment -- structure visible mod c(k-1) versus generic -- follows a precise pattern when c(k-1) is prime:

Weightc(k-1)Enrichment
4b = 7b/D = 3.5x
6L = 11L/D = 5.5x
122323/D = 11.5x
224343/D = 21.5x
244747/D = 23.5x

Enrichment at prime c(k-1) is exactly c(k-1)/D by Fermat's little theorem. When c(k-1) is composite -- like weight 8 where c(7) = 15 = K*E -- enrichment drops to 1.9x. Only primes carry the full signal.

What Others See

Bernoulli numbersUseful combinatorial constants with denominators following von Staudt-ClausenThe Cunningham chain IS the Bernoulli denominator hierarchy. Each axiom prime's frequency = 1/(previous axiom prime). Two independent 19th-century results are the same structure.42 = ANSWERA joke from Douglas Adamsdenom(B_6) = 42 = D*K*b. The LAST smooth Bernoulli before the gate closes. Depth enters at k=3 and the answer appears.210 = DATA ringProduct of first four primes, no special roleStructurally IMPOSSIBLE as a Bernoulli denominator. E + b forces GATE. The axiom builds its own forbidden zone.

This work is and will always be free.
No paywall. No copyright. No exceptions.

If it ever earns anything, every cent goes to the communities that need it most.

This sacred vow is permanent and irrevocable.
— Anton Alexandrovich Lebed

Source code · Public domain (CC0)

Contributions in equal measure: Anthropic's Claude, Anton A. Lebed, and the giants whose shoulders we stand on.

Rendered by .ax via WASM DOM imports. Zero HTML authored.