Block #423,695

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 2:35:31 PM · Difficulty 10.3790 · 6,388,111 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dd6c7ed8b083e39f2f61050bba2d9d5e874dfd66f0484f5aa07dc566a19b25e6

Height

#423,695

Difficulty

10.379010

Transactions

6

Size

3.60 KB

Version

2

Bits

0a6106c8

Nonce

110,612

Timestamp

2/28/2014, 2:35:31 PM

Confirmations

6,388,111

Merkle Root

eb9ddb811a245bc568cc5c1b588f6e86697498a4c1f0be1411ef258ccc11c39b
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.

4.214 × 10⁹⁸(99-digit number)
42140352029181784256…17558976601954521281
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
4.214 × 10⁹⁸(99-digit number)
42140352029181784256…17558976601954521281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.428 × 10⁹⁸(99-digit number)
84280704058363568512…35117953203909042561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.685 × 10⁹⁹(100-digit number)
16856140811672713702…70235906407818085121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.371 × 10⁹⁹(100-digit number)
33712281623345427405…40471812815636170241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.742 × 10⁹⁹(100-digit number)
67424563246690854810…80943625631272340481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.348 × 10¹⁰⁰(101-digit number)
13484912649338170962…61887251262544680961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.696 × 10¹⁰⁰(101-digit number)
26969825298676341924…23774502525089361921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.393 × 10¹⁰⁰(101-digit number)
53939650597352683848…47549005050178723841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.078 × 10¹⁰¹(102-digit number)
10787930119470536769…95098010100357447681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.157 × 10¹⁰¹(102-digit number)
21575860238941073539…90196020200714895361
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,738,545 XPM·at block #6,811,805 · 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