Block #292,796

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/3/2013, 10:53:56 PM · Difficulty 9.9904 · 6,521,100 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a844a88aef15ea95b61c37b4913ffb02ab61b000f51963fb8f2ae0f113f9acde

Height

#292,796

Difficulty

9.990413

Transactions

1

Size

1.11 KB

Version

2

Bits

09fd8bb9

Nonce

175,607

Timestamp

12/3/2013, 10:53:56 PM

Confirmations

6,521,100

Merkle Root

2820e86614200dbcee191c921babc49e5886c355766fba8c1a9ce67f01fda241
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.

2.542 × 10⁹⁴(95-digit number)
25425640973896914717…43712871616855161919
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
2.542 × 10⁹⁴(95-digit number)
25425640973896914717…43712871616855161919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.085 × 10⁹⁴(95-digit number)
50851281947793829434…87425743233710323839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.017 × 10⁹⁵(96-digit number)
10170256389558765886…74851486467420647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.034 × 10⁹⁵(96-digit number)
20340512779117531773…49702972934841295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.068 × 10⁹⁵(96-digit number)
40681025558235063547…99405945869682590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.136 × 10⁹⁵(96-digit number)
81362051116470127094…98811891739365181439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.627 × 10⁹⁶(97-digit number)
16272410223294025418…97623783478730362879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.254 × 10⁹⁶(97-digit number)
32544820446588050837…95247566957460725759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.508 × 10⁹⁶(97-digit number)
65089640893176101675…90495133914921451519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.301 × 10⁹⁷(98-digit number)
13017928178635220335…80990267829842903039
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,755,245 XPM·at block #6,813,895 · 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