Block #294,578

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/4/2013, 10:56:22 PM · Difficulty 9.9911 · 6,530,614 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
721a25c4fd5c82aa8c083a066844e1f4ebd184b4cd978199b3831abfa7b3bcfb

Height

#294,578

Difficulty

9.991092

Transactions

3

Size

1.41 KB

Version

2

Bits

09fdb832

Nonce

9,446

Timestamp

12/4/2013, 10:56:22 PM

Confirmations

6,530,614

Merkle Root

dbc3338a44f45a622eaab07f33a643f50e1c33ee8fcfaf3d54552ac78301c8d1
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.216 × 10¹⁰⁰(101-digit number)
72168526999539463283…37085347213779419499
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.216 × 10¹⁰⁰(101-digit number)
72168526999539463283…37085347213779419499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.443 × 10¹⁰¹(102-digit number)
14433705399907892656…74170694427558838999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.886 × 10¹⁰¹(102-digit number)
28867410799815785313…48341388855117677999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.773 × 10¹⁰¹(102-digit number)
57734821599631570627…96682777710235355999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.154 × 10¹⁰²(103-digit number)
11546964319926314125…93365555420470711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.309 × 10¹⁰²(103-digit number)
23093928639852628250…86731110840941423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.618 × 10¹⁰²(103-digit number)
46187857279705256501…73462221681882847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.237 × 10¹⁰²(103-digit number)
92375714559410513003…46924443363765695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.847 × 10¹⁰³(104-digit number)
18475142911882102600…93848886727531391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.695 × 10¹⁰³(104-digit number)
36950285823764205201…87697773455062783999
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,845,627 XPM·at block #6,825,191 · 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