Block #345,975

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 6:55:13 AM · Difficulty 10.2158 · 6,463,720 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
aaf89e829dbb1f4e88107fb46e61c1c0f0cede7da0b7b660d655d4aab1979b7f

Height

#345,975

Difficulty

10.215776

Transactions

2

Size

676 B

Version

2

Bits

0a373d16

Nonce

24,838

Timestamp

1/6/2014, 6:55:13 AM

Confirmations

6,463,720

Merkle Root

7bb95a260744c6ccb6ce091dfecd98c42b9bba75b4bdce3ec27b99808fef99b9
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.376 × 10⁹⁵(96-digit number)
23761945082535115934…28969809327455692801
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.376 × 10⁹⁵(96-digit number)
23761945082535115934…28969809327455692801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.752 × 10⁹⁵(96-digit number)
47523890165070231869…57939618654911385601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.504 × 10⁹⁵(96-digit number)
95047780330140463739…15879237309822771201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.900 × 10⁹⁶(97-digit number)
19009556066028092747…31758474619645542401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.801 × 10⁹⁶(97-digit number)
38019112132056185495…63516949239291084801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.603 × 10⁹⁶(97-digit number)
76038224264112370991…27033898478582169601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.520 × 10⁹⁷(98-digit number)
15207644852822474198…54067796957164339201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.041 × 10⁹⁷(98-digit number)
30415289705644948396…08135593914328678401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.083 × 10⁹⁷(98-digit number)
60830579411289896792…16271187828657356801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.216 × 10⁹⁸(99-digit number)
12166115882257979358…32542375657314713601
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,721,637 XPM·at block #6,809,694 · 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