Block #502,154

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 5:56:00 AM · Difficulty 10.8065 · 6,314,601 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d6d293988911bd0f491cdde5d0716c8cb6a84cddb502e12954bd043da867f07c

Height

#502,154

Difficulty

10.806539

Transactions

10

Size

2.52 KB

Version

2

Bits

0ace7957

Nonce

744,822,935

Timestamp

4/20/2014, 5:56:00 AM

Confirmations

6,314,601

Merkle Root

5f0d8bdd10f969fe946534c0ad7b8e862ad518ff6668cf908e73880b80fa2e7e
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.959 × 10⁹⁸(99-digit number)
49590264190876127852…91712259864057903681
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.959 × 10⁹⁸(99-digit number)
49590264190876127852…91712259864057903681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.918 × 10⁹⁸(99-digit number)
99180528381752255704…83424519728115807361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.983 × 10⁹⁹(100-digit number)
19836105676350451140…66849039456231614721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.967 × 10⁹⁹(100-digit number)
39672211352700902281…33698078912463229441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.934 × 10⁹⁹(100-digit number)
79344422705401804563…67396157824926458881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.586 × 10¹⁰⁰(101-digit number)
15868884541080360912…34792315649852917761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.173 × 10¹⁰⁰(101-digit number)
31737769082160721825…69584631299705835521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.347 × 10¹⁰⁰(101-digit number)
63475538164321443650…39169262599411671041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.269 × 10¹⁰¹(102-digit number)
12695107632864288730…78338525198823342081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.539 × 10¹⁰¹(102-digit number)
25390215265728577460…56677050397646684161
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,778,071 XPM·at block #6,816,754 · 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