Block #294,731

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2013, 1:05:08 AM · Difficulty 9.9911 · 6,521,815 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
143daed3b84476d36a6990b12a6de236f3fb6c4ca6bb668321e130acf5882a18

Height

#294,731

Difficulty

9.991143

Transactions

8

Size

2.88 KB

Version

2

Bits

09fdbb8d

Nonce

83,454

Timestamp

12/5/2013, 1:05:08 AM

Confirmations

6,521,815

Merkle Root

78c01a52294dff8cc49aeff5febff92893cecf2a2d3333914df734a050697d7e
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.884 × 10⁹³(94-digit number)
78844260078140336474…77141361820797369919
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.884 × 10⁹³(94-digit number)
78844260078140336474…77141361820797369919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.576 × 10⁹⁴(95-digit number)
15768852015628067294…54282723641594739839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.153 × 10⁹⁴(95-digit number)
31537704031256134589…08565447283189479679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.307 × 10⁹⁴(95-digit number)
63075408062512269179…17130894566378959359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.261 × 10⁹⁵(96-digit number)
12615081612502453835…34261789132757918719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.523 × 10⁹⁵(96-digit number)
25230163225004907671…68523578265515837439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.046 × 10⁹⁵(96-digit number)
50460326450009815343…37047156531031674879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.009 × 10⁹⁶(97-digit number)
10092065290001963068…74094313062063349759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.018 × 10⁹⁶(97-digit number)
20184130580003926137…48188626124126699519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.036 × 10⁹⁶(97-digit number)
40368261160007852274…96377252248253399039
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,776,497 XPM·at block #6,816,545 · 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