Block #494,078

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 12:08:07 AM · Difficulty 10.7124 · 6,323,954 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
de68a5a09f5dec6c9219599ec2aa085fc5ef3c19359d41337bc90a3b869670d1

Height

#494,078

Difficulty

10.712372

Transactions

9

Size

5.09 KB

Version

2

Bits

0ab65e0a

Nonce

691,456,218

Timestamp

4/16/2014, 12:08:07 AM

Confirmations

6,323,954

Merkle Root

722d0f32fe4b82a2c8a6cd6c42f56a4a5823a4641200a66187ff2d68d2961314
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.

4.194 × 10⁹⁹(100-digit number)
41947321442870824660…61759394968273064959
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
4.194 × 10⁹⁹(100-digit number)
41947321442870824660…61759394968273064959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.389 × 10⁹⁹(100-digit number)
83894642885741649320…23518789936546129919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.677 × 10¹⁰⁰(101-digit number)
16778928577148329864…47037579873092259839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.355 × 10¹⁰⁰(101-digit number)
33557857154296659728…94075159746184519679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.711 × 10¹⁰⁰(101-digit number)
67115714308593319456…88150319492369039359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.342 × 10¹⁰¹(102-digit number)
13423142861718663891…76300638984738078719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.684 × 10¹⁰¹(102-digit number)
26846285723437327782…52601277969476157439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.369 × 10¹⁰¹(102-digit number)
53692571446874655565…05202555938952314879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.073 × 10¹⁰²(103-digit number)
10738514289374931113…10405111877904629759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.147 × 10¹⁰²(103-digit number)
21477028578749862226…20810223755809259519
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,788,325 XPM·at block #6,818,031 · 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