Block #538,643

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/12/2014, 9:44:27 AM · Difficulty 10.9232 · 6,306,748 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3afd6a994b06255e1a4c19700a161681feecb8133e96f89da35f6847ab63df9c

Height

#538,643

Difficulty

10.923154

Transactions

3

Size

775 B

Version

2

Bits

0aec53cc

Nonce

259,106,368

Timestamp

5/12/2014, 9:44:27 AM

Confirmations

6,306,748

Merkle Root

6506f544e71ca82dab44bd33de35d34db44b6918c7f57924124cf4207e734c23
Transactions (3)
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.

7.919 × 10⁹⁹(100-digit number)
79197072138973352721…20691074536378071039
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
7.919 × 10⁹⁹(100-digit number)
79197072138973352721…20691074536378071039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.583 × 10¹⁰⁰(101-digit number)
15839414427794670544…41382149072756142079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.167 × 10¹⁰⁰(101-digit number)
31678828855589341088…82764298145512284159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.335 × 10¹⁰⁰(101-digit number)
63357657711178682177…65528596291024568319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.267 × 10¹⁰¹(102-digit number)
12671531542235736435…31057192582049136639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.534 × 10¹⁰¹(102-digit number)
25343063084471472870…62114385164098273279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.068 × 10¹⁰¹(102-digit number)
50686126168942945741…24228770328196546559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.013 × 10¹⁰²(103-digit number)
10137225233788589148…48457540656393093119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.027 × 10¹⁰²(103-digit number)
20274450467577178296…96915081312786186239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.054 × 10¹⁰²(103-digit number)
40548900935154356593…93830162625572372479
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:58,007,574 XPM·at block #6,845,390 · 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