Block #502,088

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 4:55:42 AM · Difficulty 10.8063 · 6,324,487 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e086113107ef06803cb5a5522c3e0a97ca01bb8b2a8292f337bc53bcc8455051

Height

#502,088

Difficulty

10.806286

Transactions

1

Size

834 B

Version

2

Bits

0ace68ba

Nonce

201,495

Timestamp

4/20/2014, 4:55:42 AM

Confirmations

6,324,487

Merkle Root

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

1.263 × 10⁹⁸(99-digit number)
12634941001792890559…64980189366806773761
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
1.263 × 10⁹⁸(99-digit number)
12634941001792890559…64980189366806773761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.526 × 10⁹⁸(99-digit number)
25269882003585781119…29960378733613547521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.053 × 10⁹⁸(99-digit number)
50539764007171562238…59920757467227095041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.010 × 10⁹⁹(100-digit number)
10107952801434312447…19841514934454190081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.021 × 10⁹⁹(100-digit number)
20215905602868624895…39683029868908380161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.043 × 10⁹⁹(100-digit number)
40431811205737249790…79366059737816760321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.086 × 10⁹⁹(100-digit number)
80863622411474499581…58732119475633520641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.617 × 10¹⁰⁰(101-digit number)
16172724482294899916…17464238951267041281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.234 × 10¹⁰⁰(101-digit number)
32345448964589799832…34928477902534082561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.469 × 10¹⁰⁰(101-digit number)
64690897929179599665…69856955805068165121
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,856,749 XPM·at block #6,826,574 · 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