Block #408,964

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/18/2014, 1:50:09 AM · Difficulty 10.4238 · 6,397,540 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bf1b38b40eac453c0d2722bc07559b2927373035d8b0aa73c8bc81683aa6974c

Height

#408,964

Difficulty

10.423762

Transactions

7

Size

1.95 KB

Version

2

Bits

0a6c7ba3

Nonce

20,675,646

Timestamp

2/18/2014, 1:50:09 AM

Confirmations

6,397,540

Merkle Root

2979ea1cdb65bf44b25f049a4cf77417d33739691125833bb858978805238792
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.087 × 10⁹⁴(95-digit number)
30875456169910276994…38053478521757088001
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.087 × 10⁹⁴(95-digit number)
30875456169910276994…38053478521757088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.175 × 10⁹⁴(95-digit number)
61750912339820553989…76106957043514176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.235 × 10⁹⁵(96-digit number)
12350182467964110797…52213914087028352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.470 × 10⁹⁵(96-digit number)
24700364935928221595…04427828174056704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.940 × 10⁹⁵(96-digit number)
49400729871856443191…08855656348113408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.880 × 10⁹⁵(96-digit number)
98801459743712886382…17711312696226816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.976 × 10⁹⁶(97-digit number)
19760291948742577276…35422625392453632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.952 × 10⁹⁶(97-digit number)
39520583897485154553…70845250784907264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.904 × 10⁹⁶(97-digit number)
79041167794970309106…41690501569814528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.580 × 10⁹⁷(98-digit number)
15808233558994061821…83381003139629056001
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,696,128 XPM·at block #6,806,503 · 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.

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