Block #342,654

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 5:24:59 AM · Difficulty 10.1586 · 6,475,026 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3e8c857a6a41e5910d97309259335b9431de1812faaa39935d0478b3cb370d07

Height

#342,654

Difficulty

10.158615

Transactions

13

Size

3.42 KB

Version

2

Bits

0a289b01

Nonce

64,551

Timestamp

1/4/2014, 5:24:59 AM

Confirmations

6,475,026

Merkle Root

4f767a562e1511e30bc3e25842fb4f31d1ea1d9a2bad3859bed61b95fb6e18ff
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.

6.249 × 10⁹⁴(95-digit number)
62495992860105650851…73638582881987872001
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
6.249 × 10⁹⁴(95-digit number)
62495992860105650851…73638582881987872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.249 × 10⁹⁵(96-digit number)
12499198572021130170…47277165763975744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.499 × 10⁹⁵(96-digit number)
24998397144042260340…94554331527951488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.999 × 10⁹⁵(96-digit number)
49996794288084520681…89108663055902976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.999 × 10⁹⁵(96-digit number)
99993588576169041362…78217326111805952001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.999 × 10⁹⁶(97-digit number)
19998717715233808272…56434652223611904001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.999 × 10⁹⁶(97-digit number)
39997435430467616544…12869304447223808001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.999 × 10⁹⁶(97-digit number)
79994870860935233089…25738608894447616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.599 × 10⁹⁷(98-digit number)
15998974172187046617…51477217788895232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.199 × 10⁹⁷(98-digit number)
31997948344374093235…02954435577790464001
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,785,497 XPM·at block #6,817,679 · 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