Block #420,696

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/26/2014, 1:06:11 PM · Difficulty 10.3746 · 6,388,881 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2b1fd3f8a6e72fc3862c7feb723305d69b54d55f9c3d042dba4a70133e69a653

Height

#420,696

Difficulty

10.374584

Transactions

3

Size

1.90 KB

Version

2

Bits

0a5fe4c4

Nonce

50,332,993

Timestamp

2/26/2014, 1:06:11 PM

Confirmations

6,388,881

Merkle Root

e69b5e1f27de0fea1ad0707cfff89b42ca057ced842d1e7a7c6c219de9f35ec9
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.462 × 10¹⁰¹(102-digit number)
24629085323181400398…64472193931503762241
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.462 × 10¹⁰¹(102-digit number)
24629085323181400398…64472193931503762241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.925 × 10¹⁰¹(102-digit number)
49258170646362800797…28944387863007524481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.851 × 10¹⁰¹(102-digit number)
98516341292725601595…57888775726015048961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.970 × 10¹⁰²(103-digit number)
19703268258545120319…15777551452030097921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.940 × 10¹⁰²(103-digit number)
39406536517090240638…31555102904060195841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.881 × 10¹⁰²(103-digit number)
78813073034180481276…63110205808120391681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.576 × 10¹⁰³(104-digit number)
15762614606836096255…26220411616240783361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.152 × 10¹⁰³(104-digit number)
31525229213672192510…52440823232481566721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.305 × 10¹⁰³(104-digit number)
63050458427344385021…04881646464963133441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.261 × 10¹⁰⁴(105-digit number)
12610091685468877004…09763292929926266881
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,720,693 XPM·at block #6,809,576 · 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