Block #845,338

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/8/2014, 7:30:38 PM · Difficulty 10.9725 · 5,988,059 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
41e1ca382a514e085fff9796ce671fb229e0ddea7e010f662bc1fcc70a3cf3d8

Height

#845,338

Difficulty

10.972531

Transactions

6

Size

8.67 KB

Version

2

Bits

0af8f7ce

Nonce

161,961,320

Timestamp

12/8/2014, 7:30:38 PM

Confirmations

5,988,059

Merkle Root

73a01cbaed7cc679ed61308867292cc6088c952496c35b8cc977a59dd77ce652
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.

3.655 × 10⁹⁴(95-digit number)
36552548644758830208…47768728352432668799
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
3.655 × 10⁹⁴(95-digit number)
36552548644758830208…47768728352432668799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.310 × 10⁹⁴(95-digit number)
73105097289517660416…95537456704865337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.462 × 10⁹⁵(96-digit number)
14621019457903532083…91074913409730675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.924 × 10⁹⁵(96-digit number)
29242038915807064166…82149826819461350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.848 × 10⁹⁵(96-digit number)
58484077831614128333…64299653638922700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.169 × 10⁹⁶(97-digit number)
11696815566322825666…28599307277845401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.339 × 10⁹⁶(97-digit number)
23393631132645651333…57198614555690803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.678 × 10⁹⁶(97-digit number)
46787262265291302666…14397229111381606399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.357 × 10⁹⁶(97-digit number)
93574524530582605333…28794458222763212799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.871 × 10⁹⁷(98-digit number)
18714904906116521066…57588916445526425599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.742 × 10⁹⁷(98-digit number)
37429809812233042133…15177832891052851199
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,911,376 XPM·at block #6,833,396 · 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