Block #459,502

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/25/2014, 8:48:06 AM · Difficulty 10.4178 · 6,349,979 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0d2e8dec3c86f754888e161f7262f8ee5cf3f03c13a20f39fdd08fce83b4ccd0

Height

#459,502

Difficulty

10.417802

Transactions

3

Size

1.04 KB

Version

2

Bits

0a6af51a

Nonce

293,531

Timestamp

3/25/2014, 8:48:06 AM

Confirmations

6,349,979

Merkle Root

773cdbb4f87489ace0e4f3eeb7f8561043890525f16d2603d64cc66e43068fb0
Transactions (3)
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.

9.212 × 10⁹²(93-digit number)
92124049480612563373…32438468640021325881
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
9.212 × 10⁹²(93-digit number)
92124049480612563373…32438468640021325881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.842 × 10⁹³(94-digit number)
18424809896122512674…64876937280042651761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.684 × 10⁹³(94-digit number)
36849619792245025349…29753874560085303521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.369 × 10⁹³(94-digit number)
73699239584490050699…59507749120170607041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.473 × 10⁹⁴(95-digit number)
14739847916898010139…19015498240341214081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.947 × 10⁹⁴(95-digit number)
29479695833796020279…38030996480682428161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.895 × 10⁹⁴(95-digit number)
58959391667592040559…76061992961364856321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.179 × 10⁹⁵(96-digit number)
11791878333518408111…52123985922729712641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.358 × 10⁹⁵(96-digit number)
23583756667036816223…04247971845459425281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.716 × 10⁹⁵(96-digit number)
47167513334073632447…08495943690918850561
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,719,919 XPM·at block #6,809,480 · 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