Block #508,701

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/24/2014, 1:55:35 PM · Difficulty 10.8187 · 6,301,563 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9362a5680c89d7442f7342db2535159c7c3483414c2c3bb26084ded76bb46aa2

Height

#508,701

Difficulty

10.818712

Transactions

9

Size

2.54 KB

Version

2

Bits

0ad19723

Nonce

12,318

Timestamp

4/24/2014, 1:55:35 PM

Confirmations

6,301,563

Merkle Root

39cf55d4864221fdcc9981a93a15d4763072d4465ce654e08f19852f1c52240c
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.925 × 10⁹⁷(98-digit number)
39252065689006713357…66376780179125174001
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.925 × 10⁹⁷(98-digit number)
39252065689006713357…66376780179125174001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.850 × 10⁹⁷(98-digit number)
78504131378013426714…32753560358250348001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.570 × 10⁹⁸(99-digit number)
15700826275602685342…65507120716500696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.140 × 10⁹⁸(99-digit number)
31401652551205370685…31014241433001392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.280 × 10⁹⁸(99-digit number)
62803305102410741371…62028482866002784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.256 × 10⁹⁹(100-digit number)
12560661020482148274…24056965732005568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.512 × 10⁹⁹(100-digit number)
25121322040964296548…48113931464011136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.024 × 10⁹⁹(100-digit number)
50242644081928593096…96227862928022272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.004 × 10¹⁰⁰(101-digit number)
10048528816385718619…92455725856044544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.009 × 10¹⁰⁰(101-digit number)
20097057632771437238…84911451712089088001
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,726,186 XPM·at block #6,810,263 · 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