Block #497,582

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/17/2014, 4:16:22 PM · Difficulty 10.7691 · 6,313,130 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eb8e99065b55424eb24c9318d22de2469577d44613842736c46279ae64763d08

Height

#497,582

Difficulty

10.769113

Transactions

2

Size

617 B

Version

2

Bits

0ac4e493

Nonce

54,972

Timestamp

4/17/2014, 4:16:22 PM

Confirmations

6,313,130

Merkle Root

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

4.045 × 10⁹⁸(99-digit number)
40454717895103166736…18392626838036790081
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
4.045 × 10⁹⁸(99-digit number)
40454717895103166736…18392626838036790081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.090 × 10⁹⁸(99-digit number)
80909435790206333473…36785253676073580161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.618 × 10⁹⁹(100-digit number)
16181887158041266694…73570507352147160321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.236 × 10⁹⁹(100-digit number)
32363774316082533389…47141014704294320641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.472 × 10⁹⁹(100-digit number)
64727548632165066778…94282029408588641281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.294 × 10¹⁰⁰(101-digit number)
12945509726433013355…88564058817177282561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.589 × 10¹⁰⁰(101-digit number)
25891019452866026711…77128117634354565121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.178 × 10¹⁰⁰(101-digit number)
51782038905732053423…54256235268709130241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.035 × 10¹⁰¹(102-digit number)
10356407781146410684…08512470537418260481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.071 × 10¹⁰¹(102-digit number)
20712815562292821369…17024941074836520961
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,729,783 XPM·at block #6,810,711 · 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