Block #502,594

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/20/2014, 1:02:00 PM · Difficulty 10.8071 · 6,303,689 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e398fe49dbe2b7753f14fcad01585f4dbd9920c4fd6487075e732482dabebe82

Height

#502,594

Difficulty

10.807096

Transactions

1

Size

768 B

Version

2

Bits

0ace9ddb

Nonce

152,523

Timestamp

4/20/2014, 1:02:00 PM

Confirmations

6,303,689

Merkle Root

e54a50d8a64ebf16626ea1445377e737999950c69190a4f6c884a96a913e4814
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.163 × 10¹⁰⁰(101-digit number)
91639822155086974645…95962164140819865599
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.163 × 10¹⁰⁰(101-digit number)
91639822155086974645…95962164140819865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.832 × 10¹⁰¹(102-digit number)
18327964431017394929…91924328281639731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.665 × 10¹⁰¹(102-digit number)
36655928862034789858…83848656563279462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.331 × 10¹⁰¹(102-digit number)
73311857724069579716…67697313126558924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.466 × 10¹⁰²(103-digit number)
14662371544813915943…35394626253117849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.932 × 10¹⁰²(103-digit number)
29324743089627831886…70789252506235699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.864 × 10¹⁰²(103-digit number)
58649486179255663773…41578505012471398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.172 × 10¹⁰³(104-digit number)
11729897235851132754…83157010024942796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.345 × 10¹⁰³(104-digit number)
23459794471702265509…66314020049885593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.691 × 10¹⁰³(104-digit number)
46919588943404531018…32628040099771187199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,694,350 XPM·at block #6,806,282 · 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