Block #2,471,154

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2018, 1:53:25 PM · Difficulty 10.9617 · 4,371,809 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
68c04702c74389368ba7db2415657035934f547833e0588f56fa6683bd181af2

Height

#2,471,154

Difficulty

10.961703

Transactions

3

Size

1.67 KB

Version

2

Bits

0af63232

Nonce

317,718,358

Timestamp

1/13/2018, 1:53:25 PM

Confirmations

4,371,809

Merkle Root

677bc4dbc86732916fb660b73f52cd6b88027d199600420b99194e50079ccdff
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.

4.368 × 10⁹³(94-digit number)
43680319940556686353…80751104437922541879
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
4.368 × 10⁹³(94-digit number)
43680319940556686353…80751104437922541879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.736 × 10⁹³(94-digit number)
87360639881113372706…61502208875845083759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.747 × 10⁹⁴(95-digit number)
17472127976222674541…23004417751690167519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.494 × 10⁹⁴(95-digit number)
34944255952445349082…46008835503380335039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.988 × 10⁹⁴(95-digit number)
69888511904890698165…92017671006760670079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.397 × 10⁹⁵(96-digit number)
13977702380978139633…84035342013521340159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.795 × 10⁹⁵(96-digit number)
27955404761956279266…68070684027042680319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.591 × 10⁹⁵(96-digit number)
55910809523912558532…36141368054085360639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.118 × 10⁹⁶(97-digit number)
11182161904782511706…72282736108170721279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.236 × 10⁹⁶(97-digit number)
22364323809565023412…44565472216341442559
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 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
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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,988,058 XPM·at block #6,842,962 · 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