Block #839,104

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/4/2014, 3:56:47 AM · Difficulty 10.9748 · 5,975,708 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5ac1d0c8e7af57f12a3c1c695250a9934d7dce4735c914bbc528dc95141c41fa

Height

#839,104

Difficulty

10.974750

Transactions

3

Size

942 B

Version

2

Bits

0af9893a

Nonce

1,932,392,683

Timestamp

12/4/2014, 3:56:47 AM

Confirmations

5,975,708

Merkle Root

895a4ea675cb6f29c97bfbc026495f4fbb5eb9056d546f1e0dd46732b2fc8ae5
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.

1.393 × 10⁹⁶(97-digit number)
13937745466495311195…89263544952870569599
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
1.393 × 10⁹⁶(97-digit number)
13937745466495311195…89263544952870569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.787 × 10⁹⁶(97-digit number)
27875490932990622391…78527089905741139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.575 × 10⁹⁶(97-digit number)
55750981865981244783…57054179811482278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.115 × 10⁹⁷(98-digit number)
11150196373196248956…14108359622964556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.230 × 10⁹⁷(98-digit number)
22300392746392497913…28216719245929113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.460 × 10⁹⁷(98-digit number)
44600785492784995826…56433438491858227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.920 × 10⁹⁷(98-digit number)
89201570985569991653…12866876983716454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.784 × 10⁹⁸(99-digit number)
17840314197113998330…25733753967432908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.568 × 10⁹⁸(99-digit number)
35680628394227996661…51467507934865817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.136 × 10⁹⁸(99-digit number)
71361256788455993322…02935015869731635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.427 × 10⁹⁹(100-digit number)
14272251357691198664…05870031739463270399
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,762,582 XPM·at block #6,814,811 · 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