Block #497,813

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/17/2014, 6:54:06 PM · Difficulty 10.7726 · 6,318,919 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e7b01d8ae7fe21c5fa3e4f90a8092f4def868ac8de2a49c01cfb13ac2ad38af5

Height

#497,813

Difficulty

10.772565

Transactions

5

Size

1.09 KB

Version

2

Bits

0ac5c6ca

Nonce

250,573,331

Timestamp

4/17/2014, 6:54:06 PM

Confirmations

6,318,919

Merkle Root

90eca6978835d6525c835e977dfc245a01c93db92868df530445a4cf62d8265e
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.735 × 10⁹⁸(99-digit number)
27352596899172356581…14849802099157304641
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.735 × 10⁹⁸(99-digit number)
27352596899172356581…14849802099157304641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.470 × 10⁹⁸(99-digit number)
54705193798344713163…29699604198314609281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.094 × 10⁹⁹(100-digit number)
10941038759668942632…59399208396629218561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.188 × 10⁹⁹(100-digit number)
21882077519337885265…18798416793258437121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.376 × 10⁹⁹(100-digit number)
43764155038675770530…37596833586516874241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.752 × 10⁹⁹(100-digit number)
87528310077351541061…75193667173033748481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.750 × 10¹⁰⁰(101-digit number)
17505662015470308212…50387334346067496961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.501 × 10¹⁰⁰(101-digit number)
35011324030940616424…00774668692134993921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.002 × 10¹⁰⁰(101-digit number)
70022648061881232849…01549337384269987841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.400 × 10¹⁰¹(102-digit number)
14004529612376246569…03098674768539975681
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,777,891 XPM·at block #6,816,731 · 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.
Privacy Policy·

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