Block #305,215

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2013, 8:58:26 AM · Difficulty 9.9935 · 6,532,816 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
94611087aee97ce8c190735f1fadf28625f457cf58c6cffd516079d147b316fc

Height

#305,215

Difficulty

9.993543

Transactions

4

Size

1.77 KB

Version

2

Bits

09fe58ce

Nonce

287,268

Timestamp

12/11/2013, 8:58:26 AM

Confirmations

6,532,816

Merkle Root

fce74c23a6a65a43a30a54c6d7d70fd0ef4ab787ad390e9bfc82815188f4368a
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.860 × 10⁹⁰(91-digit number)
18600724818263789492…55732307899255809801
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.860 × 10⁹⁰(91-digit number)
18600724818263789492…55732307899255809801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.720 × 10⁹⁰(91-digit number)
37201449636527578985…11464615798511619601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.440 × 10⁹⁰(91-digit number)
74402899273055157971…22929231597023239201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.488 × 10⁹¹(92-digit number)
14880579854611031594…45858463194046478401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.976 × 10⁹¹(92-digit number)
29761159709222063188…91716926388092956801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.952 × 10⁹¹(92-digit number)
59522319418444126377…83433852776185913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.190 × 10⁹²(93-digit number)
11904463883688825275…66867705552371827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.380 × 10⁹²(93-digit number)
23808927767377650550…33735411104743654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.761 × 10⁹²(93-digit number)
47617855534755301101…67470822209487308801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.523 × 10⁹²(93-digit number)
95235711069510602203…34941644418974617601
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,948,598 XPM·at block #6,838,030 · 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