Block #2,215,625

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/21/2017, 2:13:01 AM · Difficulty 10.9433 · 4,610,934 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a460ba5850fd391ee1924fa49dc1f2c93bcce38a167b3e6875c44be7ea39e9af

Height

#2,215,625

Difficulty

10.943267

Transactions

2

Size

723 B

Version

2

Bits

0af179f3

Nonce

495,348,774

Timestamp

7/21/2017, 2:13:01 AM

Confirmations

4,610,934

Merkle Root

31e6bb573f24c12831266186475afd041511cf488d5db02a3e9d82551f847e6e
Transactions (2)
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.

3.913 × 10⁹⁵(96-digit number)
39135075984587293635…56242630459527178241
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
3.913 × 10⁹⁵(96-digit number)
39135075984587293635…56242630459527178241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.827 × 10⁹⁵(96-digit number)
78270151969174587271…12485260919054356481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.565 × 10⁹⁶(97-digit number)
15654030393834917454…24970521838108712961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.130 × 10⁹⁶(97-digit number)
31308060787669834908…49941043676217425921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.261 × 10⁹⁶(97-digit number)
62616121575339669817…99882087352434851841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.252 × 10⁹⁷(98-digit number)
12523224315067933963…99764174704869703681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.504 × 10⁹⁷(98-digit number)
25046448630135867926…99528349409739407361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.009 × 10⁹⁷(98-digit number)
50092897260271735853…99056698819478814721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.001 × 10⁹⁸(99-digit number)
10018579452054347170…98113397638957629441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.003 × 10⁹⁸(99-digit number)
20037158904108694341…96226795277915258881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.007 × 10⁹⁸(99-digit number)
40074317808217388683…92453590555830517761
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,856,623 XPM·at block #6,826,558 · 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