Block #345,238

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2014, 7:14:36 PM · Difficulty 10.2100 · 6,471,893 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8be01d49e6c44c6a22b6400d37333d85d28c0e3ae059637da107f52bd921c3b3

Height

#345,238

Difficulty

10.210013

Transactions

21

Size

7.14 KB

Version

2

Bits

0a35c371

Nonce

16,487

Timestamp

1/5/2014, 7:14:36 PM

Confirmations

6,471,893

Merkle Root

3b2df08eafa8dcb15880212ca724c9fb66ca7ae29c3dd12c9411e0a1febd302b
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.392 × 10⁹⁶(97-digit number)
23920356253905291779…93198687508860170561
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.392 × 10⁹⁶(97-digit number)
23920356253905291779…93198687508860170561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.784 × 10⁹⁶(97-digit number)
47840712507810583558…86397375017720341121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.568 × 10⁹⁶(97-digit number)
95681425015621167116…72794750035440682241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.913 × 10⁹⁷(98-digit number)
19136285003124233423…45589500070881364481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.827 × 10⁹⁷(98-digit number)
38272570006248466846…91179000141762728961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.654 × 10⁹⁷(98-digit number)
76545140012496933692…82358000283525457921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.530 × 10⁹⁸(99-digit number)
15309028002499386738…64716000567050915841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.061 × 10⁹⁸(99-digit number)
30618056004998773477…29432001134101831681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.123 × 10⁹⁸(99-digit number)
61236112009997546954…58864002268203663361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.224 × 10⁹⁹(100-digit number)
12247222401999509390…17728004536407326721
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,781,082 XPM·at block #6,817,130 · 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