Block #343,487

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 5:11:08 PM · Difficulty 10.1797 · 6,472,551 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c3bd5d5c2da018f513183b2e90d0e1cb85e982204856c7e55705bc90951d1161

Height

#343,487

Difficulty

10.179691

Transactions

11

Size

2.54 KB

Version

2

Bits

0a2e0039

Nonce

9,859

Timestamp

1/4/2014, 5:11:08 PM

Confirmations

6,472,551

Merkle Root

572e1657a5647754c0bd1e68d84948a64e6ac35e48bcefe3468713c3e2cc875f
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.872 × 10⁹⁵(96-digit number)
38720880160998645845…86042573717982142401
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.872 × 10⁹⁵(96-digit number)
38720880160998645845…86042573717982142401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.744 × 10⁹⁵(96-digit number)
77441760321997291690…72085147435964284801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.548 × 10⁹⁶(97-digit number)
15488352064399458338…44170294871928569601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.097 × 10⁹⁶(97-digit number)
30976704128798916676…88340589743857139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.195 × 10⁹⁶(97-digit number)
61953408257597833352…76681179487714278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.239 × 10⁹⁷(98-digit number)
12390681651519566670…53362358975428556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.478 × 10⁹⁷(98-digit number)
24781363303039133341…06724717950857113601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.956 × 10⁹⁷(98-digit number)
49562726606078266682…13449435901714227201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.912 × 10⁹⁷(98-digit number)
99125453212156533364…26898871803428454401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.982 × 10⁹⁸(99-digit number)
19825090642431306672…53797743606856908801
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,772,418 XPM·at block #6,816,037 · 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