Block #411,258

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/19/2014, 3:10:37 PM · Difficulty 10.4314 · 6,414,271 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5e33070dfdd54c06ca489eebbbb1ebde1688770846d31b10120c7c2ee29d1b36

Height

#411,258

Difficulty

10.431398

Transactions

1

Size

867 B

Version

2

Bits

0a6e7013

Nonce

314,184

Timestamp

2/19/2014, 3:10:37 PM

Confirmations

6,414,271

Merkle Root

3d5d47c839aef43d11c80499b9452f7b4bfd6733c74ac8b476c58302c191bba9
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.191 × 10⁹⁴(95-digit number)
11910765251983071689…57292054390586496361
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.191 × 10⁹⁴(95-digit number)
11910765251983071689…57292054390586496361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.382 × 10⁹⁴(95-digit number)
23821530503966143379…14584108781172992721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.764 × 10⁹⁴(95-digit number)
47643061007932286759…29168217562345985441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.528 × 10⁹⁴(95-digit number)
95286122015864573518…58336435124691970881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.905 × 10⁹⁵(96-digit number)
19057224403172914703…16672870249383941761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.811 × 10⁹⁵(96-digit number)
38114448806345829407…33345740498767883521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.622 × 10⁹⁵(96-digit number)
76228897612691658814…66691480997535767041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.524 × 10⁹⁶(97-digit number)
15245779522538331762…33382961995071534081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.049 × 10⁹⁶(97-digit number)
30491559045076663525…66765923990143068161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.098 × 10⁹⁶(97-digit number)
60983118090153327051…33531847980286136321
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,848,329 XPM·at block #6,825,528 · 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