Block #2,552,261

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/6/2018, 6:37:56 PM · Difficulty 10.9896 · 4,280,952 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ad886bbf45d1223fbb48019aab72a20b8cf59c6c6236e8d29d198c83c4110020

Height

#2,552,261

Difficulty

10.989626

Transactions

2

Size

1.14 KB

Version

2

Bits

0afd5822

Nonce

137,983,477

Timestamp

3/6/2018, 6:37:56 PM

Confirmations

4,280,952

Merkle Root

7dc8033bfff9bf8559beb483d7cd4ec6cdbd962c00d55ab77c9a62bd19ee6d2d
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.858 × 10⁹⁴(95-digit number)
38587480087829720261…59737115590407322161
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.858 × 10⁹⁴(95-digit number)
38587480087829720261…59737115590407322161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.717 × 10⁹⁴(95-digit number)
77174960175659440523…19474231180814644321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.543 × 10⁹⁵(96-digit number)
15434992035131888104…38948462361629288641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.086 × 10⁹⁵(96-digit number)
30869984070263776209…77896924723258577281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.173 × 10⁹⁵(96-digit number)
61739968140527552418…55793849446517154561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.234 × 10⁹⁶(97-digit number)
12347993628105510483…11587698893034309121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.469 × 10⁹⁶(97-digit number)
24695987256211020967…23175397786068618241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.939 × 10⁹⁶(97-digit number)
49391974512422041935…46350795572137236481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.878 × 10⁹⁶(97-digit number)
98783949024844083870…92701591144274472961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.975 × 10⁹⁷(98-digit number)
19756789804968816774…85403182288548945921
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,909,890 XPM·at block #6,833,212 · 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