Block #839,691

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/4/2014, 2:32:26 PM · Difficulty 10.9745 · 6,003,335 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eeaf74c9461d582ace1a82596a1f60ec4c3a5c725ee0f989ec182ef62dd716f2

Height

#839,691

Difficulty

10.974521

Transactions

3

Size

9.42 KB

Version

2

Bits

0af97a3a

Nonce

2,013,793,197

Timestamp

12/4/2014, 2:32:26 PM

Confirmations

6,003,335

Merkle Root

45bd3e66adc77c89bf0552eb1c40c204fa61315e1394a8d779bb92c8740c3ca7
Transactions (3)
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.583 × 10⁹⁵(96-digit number)
45836899161639106552…24511835535836994399
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.583 × 10⁹⁵(96-digit number)
45836899161639106552…24511835535836994399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.167 × 10⁹⁵(96-digit number)
91673798323278213104…49023671071673988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.833 × 10⁹⁶(97-digit number)
18334759664655642620…98047342143347977599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.666 × 10⁹⁶(97-digit number)
36669519329311285241…96094684286695955199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.333 × 10⁹⁶(97-digit number)
73339038658622570483…92189368573391910399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.466 × 10⁹⁷(98-digit number)
14667807731724514096…84378737146783820799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.933 × 10⁹⁷(98-digit number)
29335615463449028193…68757474293567641599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.867 × 10⁹⁷(98-digit number)
58671230926898056386…37514948587135283199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.173 × 10⁹⁸(99-digit number)
11734246185379611277…75029897174270566399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.346 × 10⁹⁸(99-digit number)
23468492370759222554…50059794348541132799
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,988,562 XPM·at block #6,843,025 · 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