Block #288,390

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 5:33:56 PM · Difficulty 9.9877 · 6,556,589 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a7b07f72bd01ccabb24e7b5273d8af10d3e434b62ba0f7be8dbe88c0d25f3e0d

Height

#288,390

Difficulty

9.987657

Transactions

1

Size

1007 B

Version

2

Bits

09fcd71b

Nonce

14,570

Timestamp

12/1/2013, 5:33:56 PM

Confirmations

6,556,589

Merkle Root

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

2.159 × 10¹⁰⁵(106-digit number)
21597371418246429742…74412123907319090561
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
2.159 × 10¹⁰⁵(106-digit number)
21597371418246429742…74412123907319090561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.319 × 10¹⁰⁵(106-digit number)
43194742836492859485…48824247814638181121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.638 × 10¹⁰⁵(106-digit number)
86389485672985718970…97648495629276362241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.727 × 10¹⁰⁶(107-digit number)
17277897134597143794…95296991258552724481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.455 × 10¹⁰⁶(107-digit number)
34555794269194287588…90593982517105448961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.911 × 10¹⁰⁶(107-digit number)
69111588538388575176…81187965034210897921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.382 × 10¹⁰⁷(108-digit number)
13822317707677715035…62375930068421795841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.764 × 10¹⁰⁷(108-digit number)
27644635415355430070…24751860136843591681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.528 × 10¹⁰⁷(108-digit number)
55289270830710860140…49503720273687183361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.105 × 10¹⁰⁸(109-digit number)
11057854166142172028…99007440547374366721
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,004,252 XPM·at block #6,844,978 · 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