Block #502,942

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 6:15:43 PM · Difficulty 10.8083 · 6,303,572 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a651a71701403a8b1c4c74083d15fe76a3c16fd13d2cedc381a0d96859c6481

Height

#502,942

Difficulty

10.808333

Transactions

5

Size

2.08 KB

Version

2

Bits

0aceeeee

Nonce

216,638,814

Timestamp

4/20/2014, 6:15:43 PM

Confirmations

6,303,572

Merkle Root

a48147e3a4b625055b4e5071fd73d7060badadd2471fcb3f49f46c90b41ceb67
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.521 × 10⁹⁹(100-digit number)
25211736747558681799…90423193716933100801
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.521 × 10⁹⁹(100-digit number)
25211736747558681799…90423193716933100801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.042 × 10⁹⁹(100-digit number)
50423473495117363599…80846387433866201601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.008 × 10¹⁰⁰(101-digit number)
10084694699023472719…61692774867732403201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.016 × 10¹⁰⁰(101-digit number)
20169389398046945439…23385549735464806401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.033 × 10¹⁰⁰(101-digit number)
40338778796093890879…46771099470929612801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.067 × 10¹⁰⁰(101-digit number)
80677557592187781758…93542198941859225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.613 × 10¹⁰¹(102-digit number)
16135511518437556351…87084397883718451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.227 × 10¹⁰¹(102-digit number)
32271023036875112703…74168795767436902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.454 × 10¹⁰¹(102-digit number)
64542046073750225407…48337591534873804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.290 × 10¹⁰²(103-digit number)
12908409214750045081…96675183069747609601
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,696,210 XPM·at block #6,806,513 · 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