Block #501,333

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 5:38:51 PM · Difficulty 10.8032 · 6,309,041 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e72dc6039d97275032c468c45d1576d61b64c3e021233088fe590b5b3dea52c6

Height

#501,333

Difficulty

10.803154

Transactions

1

Size

835 B

Version

2

Bits

0acd9b7f

Nonce

352,881

Timestamp

4/19/2014, 5:38:51 PM

Confirmations

6,309,041

Merkle Root

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

8.976 × 10⁹⁸(99-digit number)
89766624596906067735…93493611555095774041
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
8.976 × 10⁹⁸(99-digit number)
89766624596906067735…93493611555095774041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.795 × 10⁹⁹(100-digit number)
17953324919381213547…86987223110191548081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.590 × 10⁹⁹(100-digit number)
35906649838762427094…73974446220383096161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.181 × 10⁹⁹(100-digit number)
71813299677524854188…47948892440766192321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.436 × 10¹⁰⁰(101-digit number)
14362659935504970837…95897784881532384641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.872 × 10¹⁰⁰(101-digit number)
28725319871009941675…91795569763064769281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.745 × 10¹⁰⁰(101-digit number)
57450639742019883350…83591139526129538561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.149 × 10¹⁰¹(102-digit number)
11490127948403976670…67182279052259077121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.298 × 10¹⁰¹(102-digit number)
22980255896807953340…34364558104518154241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.596 × 10¹⁰¹(102-digit number)
45960511793615906680…68729116209036308481
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,727,068 XPM·at block #6,810,373 · 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