Block #2,553,289

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/7/2018, 8:15:33 AM · Difficulty 10.9901 · 4,291,551 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a0d1dc7c471ab571b4027da62cc43deb8d3a5577e4bc7fe820fa44cacf129fce

Height

#2,553,289

Difficulty

10.990078

Transactions

71

Size

19.93 KB

Version

2

Bits

0afd75c8

Nonce

27,837,156

Timestamp

3/7/2018, 8:15:33 AM

Confirmations

4,291,551

Merkle Root

21815741ead62ccc0ae9b163db2ef25f6f731f6c856530df553b4e4875fa17ab
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.

9.235 × 10⁹⁴(95-digit number)
92355988394301235695…80487932943162070641
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
9.235 × 10⁹⁴(95-digit number)
92355988394301235695…80487932943162070641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.847 × 10⁹⁵(96-digit number)
18471197678860247139…60975865886324141281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.694 × 10⁹⁵(96-digit number)
36942395357720494278…21951731772648282561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.388 × 10⁹⁵(96-digit number)
73884790715440988556…43903463545296565121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.477 × 10⁹⁶(97-digit number)
14776958143088197711…87806927090593130241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.955 × 10⁹⁶(97-digit number)
29553916286176395422…75613854181186260481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.910 × 10⁹⁶(97-digit number)
59107832572352790845…51227708362372520961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.182 × 10⁹⁷(98-digit number)
11821566514470558169…02455416724745041921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.364 × 10⁹⁷(98-digit number)
23643133028941116338…04910833449490083841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.728 × 10⁹⁷(98-digit number)
47286266057882232676…09821666898980167681
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:58,003,128 XPM·at block #6,844,839 · 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