Block #502,614

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 1:19:33 PM · Difficulty 10.8071 · 6,308,359 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
94e7266406f877906200e2a0042147c8b29c5ce886182e39c166af83b6bca2f2

Height

#502,614

Difficulty

10.807143

Transactions

8

Size

2.04 KB

Version

2

Bits

0acea0f0

Nonce

376,981,722

Timestamp

4/20/2014, 1:19:33 PM

Confirmations

6,308,359

Merkle Root

2bb6b7163f8fafbf2fcca6982b37861d8bbbf57dc4b66ac14ed6827511cb0739
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.

3.671 × 10⁹⁸(99-digit number)
36712483006350504043…90002165566818960001
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
3.671 × 10⁹⁸(99-digit number)
36712483006350504043…90002165566818960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.342 × 10⁹⁸(99-digit number)
73424966012701008087…80004331133637920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.468 × 10⁹⁹(100-digit number)
14684993202540201617…60008662267275840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.936 × 10⁹⁹(100-digit number)
29369986405080403235…20017324534551680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.873 × 10⁹⁹(100-digit number)
58739972810160806470…40034649069103360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.174 × 10¹⁰⁰(101-digit number)
11747994562032161294…80069298138206720001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.349 × 10¹⁰⁰(101-digit number)
23495989124064322588…60138596276413440001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.699 × 10¹⁰⁰(101-digit number)
46991978248128645176…20277192552826880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.398 × 10¹⁰⁰(101-digit number)
93983956496257290352…40554385105653760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.879 × 10¹⁰¹(102-digit number)
18796791299251458070…81108770211307520001
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,731,886 XPM·at block #6,810,972 · 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