Block #2,439,821

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/25/2017, 3:50:15 AM · Difficulty 10.9238 · 4,397,251 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
325ce09f71c006659866f314be96cf67145e5999c115f7718fa293ccf1ec7d35

Height

#2,439,821

Difficulty

10.923770

Transactions

2

Size

8.22 KB

Version

2

Bits

0aec7c30

Nonce

1,347,138,181

Timestamp

12/25/2017, 3:50:15 AM

Confirmations

4,397,251

Merkle Root

f8e0e6be7434f3e112d3300ce07e2d43ee04b4a9b58f83045b9b61cd1b6e901e
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.

1.181 × 10⁹⁶(97-digit number)
11814901687900021941…97409759838048787201
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
1.181 × 10⁹⁶(97-digit number)
11814901687900021941…97409759838048787201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.362 × 10⁹⁶(97-digit number)
23629803375800043883…94819519676097574401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.725 × 10⁹⁶(97-digit number)
47259606751600087766…89639039352195148801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.451 × 10⁹⁶(97-digit number)
94519213503200175533…79278078704390297601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.890 × 10⁹⁷(98-digit number)
18903842700640035106…58556157408780595201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.780 × 10⁹⁷(98-digit number)
37807685401280070213…17112314817561190401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.561 × 10⁹⁷(98-digit number)
75615370802560140426…34224629635122380801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.512 × 10⁹⁸(99-digit number)
15123074160512028085…68449259270244761601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.024 × 10⁹⁸(99-digit number)
30246148321024056170…36898518540489523201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.049 × 10⁹⁸(99-digit number)
60492296642048112341…73797037080979046401
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,940,881 XPM·at block #6,837,071 · 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