Block #492,563

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2014, 5:35:44 AM · Difficulty 10.6879 · 6,333,581 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
df93a8ae3396f9795620281ad0e6a6c39754507c67d662ff2490860fc0636aa3

Height

#492,563

Difficulty

10.687893

Transactions

3

Size

1.29 KB

Version

2

Bits

0ab019c5

Nonce

159,239,936

Timestamp

4/15/2014, 5:35:44 AM

Confirmations

6,333,581

Merkle Root

1773ab590f31810450d0ad630325a8e80c21f9cbd339956674e397a43c2bb9d7
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.002 × 10⁹⁹(100-digit number)
20027564436356295545…17494172927508579841
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.002 × 10⁹⁹(100-digit number)
20027564436356295545…17494172927508579841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.005 × 10⁹⁹(100-digit number)
40055128872712591090…34988345855017159681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.011 × 10⁹⁹(100-digit number)
80110257745425182181…69976691710034319361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.602 × 10¹⁰⁰(101-digit number)
16022051549085036436…39953383420068638721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.204 × 10¹⁰⁰(101-digit number)
32044103098170072872…79906766840137277441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.408 × 10¹⁰⁰(101-digit number)
64088206196340145745…59813533680274554881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.281 × 10¹⁰¹(102-digit number)
12817641239268029149…19627067360549109761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.563 × 10¹⁰¹(102-digit number)
25635282478536058298…39254134721098219521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.127 × 10¹⁰¹(102-digit number)
51270564957072116596…78508269442196439041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.025 × 10¹⁰²(103-digit number)
10254112991414423319…57016538884392878081
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,853,277 XPM·at block #6,826,143 · 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