Every prime in the chain is built from 2 via the Cunningham map c(n) = 2n+1. c(1) = 3. c(2) = 5. c(3) = 7. The entire structure rests on the pair -- and then 2 self-destructs. 2^3 = 8, and 8 = 0 in the mod-8 channel. Three steps from engine to annihilation.
This page explores what makes 2 unique: how it generates the chain, how it splits the ring into even and odd, how it creates the number 42, and why its self-destruction leaves every other channel untouched.
The Chain Engine
2 is the only even prime. Every other prime in the chain is built from it using the Cunningham map c(n) = 2n + 1:
3 = 2*1 + 1
c(1) = 3
The first Cunningham step. 3 is the minimum for majority vote, triangles, closure.
5 = 2*2 + 1
c(2) = 5
5^2 divides the ring but 5 does not divide phi(210) = 48. Self-blind.
7 = 2*3 + 1
c(3) = 7
Deepest channel: mod-49 has 49 states. Controls the spectral gap.
2 mod 2 = 0
Self-annihilation
2 vanishes in its own channel. The engine cannot see itself running.
Channel sum
N/2 = 6,306,300
The mod-8 channel is the ONLY one with nonzero element sum. All odd channels sum to 0.
3*5*7 = 105
The odd product
The only product of consecutive chain primes that excludes 2. All odd, all coprime to 2.
Self-Destruction at Step 3
Mod-8 Annihilation (PROVED)
2^3 = 8 = 0 mod 8. The mod-8 channel dies in 3 steps. But gcd(2, 3*5*7*11*13) = 1, so 2 cannot kill any odd channel. Multiplying by 2 cycles odd channels indefinitely. After 420 steps: 2^420 = 1,576,576 = (0, 1, 1, 1, 1, 1) in CRT -- the mod-8 channel is zero, all five others are 1.
Step k
2^k
mod 8
Status
0
1
1
All 6 channels alive
1
2
2
First departure
2
4
4
Deepening
3
8
0
Mod-8 channel dead
420
1,576,576
0
Terminal projector: CRT = (0,1,1,1,1,1)
Odd channel periods: ord(2, 9)=6, ord(2, 25)=20, ord(2, 49)=21, ord(2, 11)=10. The mod-8 channel is the most fragile and the most essential. Without 2, no chain. With 2, eventual death in that channel.
Explore: The Mirror
Every element n has a twin: N-n. Their CRT residues sum to the channel modulus in each channel: (8,9,25,49,11,13). The mirror swaps without loss -- addition is ALWAYS reversible. The mirror IS the additive inverse.
ord(2, 49) = 21 because 2 is a quadratic residue mod 7 (Legendre symbol (2/7) = +1), so ord(2, 7) = 3. Hensel lifting: ord(2, 49) = 7*3 = 21. Meanwhile ord(2, 9) = 6. The Carmichael lambda across these two channels is lcm(6, 21) = 42 = 2*3*7. The three smallest chain primes multiplied.
42 Theorem (PROVED)
In any lambda-420 ring: the projector doubled equals 2 if and only if the 2-exponent is at most 1 (thin mod-2 channel). Of the 84 such rings dividing Z/12,612,600: exactly 42 satisfy this, exactly 42 do not. Perfect half-and-half. In Z/12,612,600 itself (2-exponent 3), it does NOT hold: 2 * 1,576,576 = (0,2,2,2,2,2) not (2,2,2,2,2,2).
Mod-9 period
ord(2, 9) = 6
3 appears in both 6 and 21. It is the common factor linking the mod-9 and mod-49 channels.
Mod-25 period
ord(2, 25) = 20
20 = 4*5. This channel alone forces lcm(6, 20, 21) = 420 -- doubling the naive lcm(6, 21) = 42.
Mod-49 period
ord(2, 49) = 21
21 is odd. The mod-49 channel never mirrors (no element at half-period). It spirals.
Full lambda
lcm(2, 6, 20, 21, 10) = 420
All five odd-channel periods combine to give 420 = 2^2 * 3 * 5 * 7.
The Parity Mechanism
Even/Odd Split (7 sub-theorems, ALL VERIFIED)
T1: Removing 2-edges from the Cayley graph of Z/210 splits it into 2 components (even/odd). T2: Each component has exactly 105 vertices. T3: The 2-edges form a perfect matching. T4: The other generators {30, 42, 70} are all even (parity-preserving). Only the generator 105 is odd. T5: Spectral gap = 4*sin^2(pi/7) = 0.753. T6: No 2-edge pair shares an eigenvalue class (0/105). T7: Hamiltonian cycles use an even number of 2-edges, minimum 2.
2 splits the ring into even and odd. It is the only parity-flipping generator. The smallest possible membrane between two halves.
Quadratic Residue Matrix
The 7x7 Legendre symbol matrix reveals which of the seven primes are squares modulo which others. 2 has unique behavior: it classifies primes by their residue mod 8.
QR Matrix Theorem (PROVED, 90/90)
The 7x7 Legendre matrix has 42 off-diagonal entries: 17 QR, 25 NR. Among 30 odd-prime pairs: 9 QR, 21 NR (ratio 3:7). Per-row QR count: {3, 11, 13} have 3 each (balanced); {2, 5, 7, 17} have 2 each (deficit). Total = 3*3 + 4*2 = 9 + 8 = 17. The triad {3, 7, 11} (all 3 mod 4) forms a directed QR 3-cycle: 3 is QR mod 11, 11 is QR mod 7, 7 is QR mod 3, but not the reverse.
2 is QR mod p
Only {7, 17}
2 is a quadratic residue mod p iff p = +-1 mod 8. Among the seven primes: 7 = -1 mod 8 and 17 = +1 mod 8.
Directed 3-cycle
3 -> 11 -> 7 -> 3
{3, 7, 11} form an asymmetric QR cycle. 3 anti-symmetric pairs.
5 has minimum QR
Only 11 is QR mod 5
5 has minimal quadratic receptivity among odd primes. 1 of 5 possible.
42 = 17 + 25
QR count + NR count
The total off-diagonal count decomposes into the 7th prime (17) and 5^2 (25).
CRT Key Exchange
Diffie-Hellman naturally decomposes via CRT. Generator g = 137 (order 420 in Z/12,612,600). g^a splits into 6 independent exponentiations, one per channel. The shared secret is the CRT reconstruction of 6 independent exchanges.
CRT-DH Decomposition
g^a mod N = CRT(g^a mod 8, g^a mod 9, g^a mod 25, g^a mod 49, g^a mod 11, g^a mod 13). Each channel computes Diffie-Hellman independently. The 6-channel structure is not a security improvement (Pohlig-Hellman already exploits this) -- it is a structural insight: key exchange IS CRT decomposition.