Block #504,142

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/21/2014, 2:29:11 PM · Difficulty 10.8079 · 6,306,017 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
32cf15d8610bda300d8b31953eac6cc7f79dfbae24cebeb022f4e09a1aacc0df

Height

#504,142

Difficulty

10.807940

Transactions

14

Size

8.19 KB

Version

2

Bits

0aced52a

Nonce

274,910,948

Timestamp

4/21/2014, 2:29:11 PM

Confirmations

6,306,017

Merkle Root

35f2817d90e163ebc119df7f729a71dd7190ab3ce385afd83e379f751fb6a43a
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.144 × 10⁹⁷(98-digit number)
21447985908654707250…88968839445336922241
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.144 × 10⁹⁷(98-digit number)
21447985908654707250…88968839445336922241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.289 × 10⁹⁷(98-digit number)
42895971817309414500…77937678890673844481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.579 × 10⁹⁷(98-digit number)
85791943634618829000…55875357781347688961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.715 × 10⁹⁸(99-digit number)
17158388726923765800…11750715562695377921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.431 × 10⁹⁸(99-digit number)
34316777453847531600…23501431125390755841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.863 × 10⁹⁸(99-digit number)
68633554907695063200…47002862250781511681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.372 × 10⁹⁹(100-digit number)
13726710981539012640…94005724501563023361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.745 × 10⁹⁹(100-digit number)
27453421963078025280…88011449003126046721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.490 × 10⁹⁹(100-digit number)
54906843926156050560…76022898006252093441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.098 × 10¹⁰⁰(101-digit number)
10981368785231210112…52045796012504186881
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,725,338 XPM·at block #6,810,158 · 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