Mod-3 Gap Gates

T[1][1] = T[2][2] = 0. Forever.

Consecutive prime gaps, reduced mod 3, can never repeat class 1 or class 2. Three doors, but if you came through door 1 it locks behind you. If you came through door 2 it locks too. Only door 0 stays open.

The Prime Alternation Theorem

Prime Alternation (PROVED)

For primes p > 3: if gap g_n is congruent to r (mod 3) with r != 0, then g_{n+1} cannot be congruent to r (mod 3). Equivalently, T[1][1] = T[2][2] = 0 in the transition matrix of consecutive gap classes.

Proof: Suppose g_n = g_{n+1} = r (mod 3) with r != 0. Then p, p + g_n, p + g_n + g_{n+1} are three consecutive primes. Their residues mod 3 form: p mod 3, (p + r) mod 3, (p + 2r) mod 3. Since r != 0 (mod 3), these three residues are a permutation of {0, 1, 2}. One of the three primes is divisible by 3. But all three are > 3, so that one is composite. Contradiction.

The proof uses only that 3 is prime and that three terms of an arithmetic progression mod a prime hit all residues. 3 is the smallest prime large enough to force this constraint -- 2 only splits parity.

Why 3?

3 is the minimum

Smallest prime forcing gap-class alternation

2 only splits parity (trivial). 3 creates genuine structure in gaps.

Three doors

gap mod 3 in {0, 1, 2}

Door 0 (multiples of 3) can repeat. Doors 1 and 2 lock behind you.

Mutual information

~0.17 bits from mod 3 alone

Mod 3 carries 94% of all gap-class information. Mod 2 and higher primes contribute little.

Lemke Oliver (2016)

Noticed bias, no mod-3 proof

The bias in consecutive prime gap classes was observed empirically. The mod-3 constraint explains why.

Contrast

Aspect	Standard view	Ring structure
Gap classes	Gaps seem random, unpredictable	Mod 3 forces T[1][1]=T[2][2]=0. Exact. Proved
The bias	Lemke Oliver 2016: empirical, unexplained	3 AP terms mod a prime must hit all residues
Information	No quantification	0.17 bits mutual information from mod 3 alone (94% of total)
Why 3?	No structural reason given	3 is the smallest prime that forces gap-class constraints. 2 only splits parity

Explore: Transition Matrix

Enter a prime limit. The widget computes the 3x3 transition matrix for consecutive gap classes (gap mod 3) across all primes up to that limit. Watch T[1][1] and T[2][2] stay at ZERO.

Primes up to:

Try: 100 (25 primes), 1000 (168 primes), 10000 (1229 primes), 50000 (5133 primes).

Source code · Public domain (CC0)

Report issue

.ax source compiled to WASM via self-hosting compiler. Zero HTML authored.