Block #492,642

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 6:52:20 AM · Difficulty 10.6882 · 6,317,584 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1fdaf5bfb41ac23fa27cd074a4858665af481df5ab8b57b15d01c4d85bffae9e

Height

#492,642

Difficulty

10.688199

Transactions

5

Size

1.81 KB

Version

2

Bits

0ab02dd4

Nonce

8,495

Timestamp

4/15/2014, 6:52:20 AM

Confirmations

6,317,584

Merkle Root

e8741f33956a6f1b2653df72e096fa1a67941f9377f0026db41b8eeb6f73bb29
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.200 × 10¹⁰¹(102-digit number)
92002117897402788829…99651567278023331839
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.200 × 10¹⁰¹(102-digit number)
92002117897402788829…99651567278023331839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.840 × 10¹⁰²(103-digit number)
18400423579480557765…99303134556046663679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.680 × 10¹⁰²(103-digit number)
36800847158961115531…98606269112093327359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.360 × 10¹⁰²(103-digit number)
73601694317922231063…97212538224186654719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.472 × 10¹⁰³(104-digit number)
14720338863584446212…94425076448373309439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.944 × 10¹⁰³(104-digit number)
29440677727168892425…88850152896746618879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.888 × 10¹⁰³(104-digit number)
58881355454337784850…77700305793493237759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.177 × 10¹⁰⁴(105-digit number)
11776271090867556970…55400611586986475519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.355 × 10¹⁰⁴(105-digit number)
23552542181735113940…10801223173972951039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.710 × 10¹⁰⁴(105-digit number)
47105084363470227880…21602446347945902079
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,725,884 XPM·at block #6,810,225 · 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