Block #2,828,008

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/7/2018, 12:39:19 AM · Difficulty 11.7117 · 4,014,078 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
ed15eb9e8dcfa9e7ba9105ca1dbdd06a470472caa76adb521f8bcae7dc285ce9

Height

#2,828,008

Difficulty

11.711705

Transactions

7

Size

3.19 KB

Version

2

Bits

0bb63249

Nonce

129,043,684

Timestamp

9/7/2018, 12:39:19 AM

Confirmations

4,014,078

Merkle Root

808a5ef5780222d4b2b0b81636acc0528baaf0d8667a9bd24bb51cb7cc9a9538
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

8.306 × 10⁹²(93-digit number)
83060661101352110356…28607296056028759199
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
8.306 × 10⁹²(93-digit number)
83060661101352110356…28607296056028759199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.661 × 10⁹³(94-digit number)
16612132220270422071…57214592112057518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.322 × 10⁹³(94-digit number)
33224264440540844142…14429184224115036799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.644 × 10⁹³(94-digit number)
66448528881081688285…28858368448230073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.328 × 10⁹⁴(95-digit number)
13289705776216337657…57716736896460147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.657 × 10⁹⁴(95-digit number)
26579411552432675314…15433473792920294399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.315 × 10⁹⁴(95-digit number)
53158823104865350628…30866947585840588799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.063 × 10⁹⁵(96-digit number)
10631764620973070125…61733895171681177599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.126 × 10⁹⁵(96-digit number)
21263529241946140251…23467790343362355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.252 × 10⁹⁵(96-digit number)
42527058483892280502…46935580686724710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.505 × 10⁹⁵(96-digit number)
85054116967784561005…93871161373449420799
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,981,073 XPM·at block #6,842,085 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy