The Chain

Seven primes define the ring. Starting from 1 and 2, the map c(n) = 2n+1 applied to each chain member generates the next: c(1) = 3, c(2) = 5, c(3) = 7, c(5) = 11. It stops because c(7) = 15 = 3*5 is composite. 13 = 2^2 + 3^2 bounds the chain. 17 closes the ring: 5*7 = 1 mod 17. Together: Z/8 x Z/9 x Z/25 x Z/49 x Z/11 x Z/13 x Z/17 = 214,414,200.

The Seven Primes

Chain Uniqueness

The chain is not one possibility among many. It is the ONLY all-prime chain under the generation rules. The proof is a single sentence: if the seed is any odd prime p > 2, then p+1 is even and at least 4 -- composite. 2 is the only even prime. Everything else follows.

Class Numbers Along the Chain

Start with 2. Apply c(n)=2n+1 repeatedly: 2, 5, 11, 23, 47, 95, 191, 383. Now compute the class number h(-d) for each value -- the number of distinct ways a quadratic form can represent integers. What comes out is the ring's own primes.

Six consecutive class numbers return 1, 3, 5, 8, 13, 17. This was not designed. It was found. The class number has no obvious reason to produce a pattern along a Cunningham chain -- yet it produces the ring's primes exactly.

The Ratios Between Consecutive Class Numbers

Consecutive class number ratios along the chain from 2 produce famous constants:

5/3 matches Kolmogorov's turbulence exponent, but the match may be coincidental -- small-prime ratios are dense near common physics constants. The pattern is real (class numbers DO produce these ratios). The physical interpretation is unproved.

Two Chains, Two Sequences

The ring has two Cunningham chains. One starts at 2 and produces chain primes as class numbers. The other starts at 1 and produces Fibonacci numbers:

Chain from 1: Fibonacci numbers (additive growth). Chain from 2: ring primes as class numbers (multiplicative growth c(n)=2n+1). Two chains, two growth laws, one ring. The break at 127 = 2^7 - 1 is a Mersenne prime. Mersenne primes have unusually small class numbers -- h(-127) = 5, not the expected 8.

Cross-Chain Duality

Interleaved by size: 1, 2, 3, 5, 7, 11. The chains alternate perfectly. Shadow function s(p) = (p-1)/2 inverts Cunningham: 3->1, 5->2, 7->3, 11->5. Shadow chain = {1, 2, 3, 5} = the chain without 7. s(13) = 6 = 2*3 (composite). The chain = longest initial prime segment where all shadows are prime or 1.

The 13 Convergence

The Mirror Laws

The Shadow Polynomial

P(x) = (x-1)(x-2)(x-3)(x-5) = x^4 - 11x^3 + 41x^2 - 61x + 30. The shadow polynomial encodes the chain. Its coefficients are chain values:

The Pairwise Catalog

Gap Exponent Palindrome

The consecutive gaps between chain primes {2,3,5,7,11} are {1,2,2,4}. Every gap is a power of 2. The exponents are (0,1,1,2) -- the first four Fibonacci numbers. The gap ratios (2, 1, 2) form a palindrome with identity at the center.

Partition Catalog

Split {2, 3, 5, 7, 11} into two groups and form prod(pair) + prod(triple). Of 10 possible 2|3 partitions, 7 give primes. The 3 non-primes factor as: 13^2, 2^7 - 1, and 17 * 23.

The 8-Vertex Cube

Three independent 3+3 splits embed the six primes {2, 3, 5, 7, 11, 13} into a cube. Each axis is a binary property:

Addresses: 2=(000), 5=(010), 7=(011), 3=(111), 13=(101), 11=(100). All six vertices unique. Two corners empty: (001) and (110). Both forced by the structure of the primes.

The Ring Hierarchy

What Precipitates

None of this was assumed. All was computed, tested, verified:

Explore: Walk a Cunningham Chain

Enter a seed number. The Cunningham map c(n) = 2n+1 iterates from that seed. Each step: is the result prime? The chain starts from {1, 2}. Try seed=1 (chain: 1,3,7,15...) or seed=2 (chain: 2,5,11,23...).

Enter seed:

Try: 1 (odd chain), 2 (even chain), 89 (long chain), 41 (= f(7)).

Paradigm Contrast

The chain describes structure, not temporal sequence. 0/0 = everything. 1 precipitates as the unique element with zero self-division ambiguity. The rest is algebra.