Block #839,787

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/4/2014, 4:01:13 PM · Difficulty 10.9746 · 6,003,057 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2f3a8d558b0402978e84692661c0748a6cc1b128d86da252d5a36d2fe6df4630

Height

#839,787

Difficulty

10.974564

Transactions

5

Size

1.12 KB

Version

2

Bits

0af97d02

Nonce

375,637,858

Timestamp

12/4/2014, 4:01:13 PM

Confirmations

6,003,057

Merkle Root

aa5b1a6a774276322a038666cb932873d001055a3c6632ddfabb9a93b1b42bb5
Transactions (5)
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.674 × 10⁹³(94-digit number)
76743726434796655420…62838195274531252599
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.674 × 10⁹³(94-digit number)
76743726434796655420…62838195274531252599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.534 × 10⁹⁴(95-digit number)
15348745286959331084…25676390549062505199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.069 × 10⁹⁴(95-digit number)
30697490573918662168…51352781098125010399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.139 × 10⁹⁴(95-digit number)
61394981147837324336…02705562196250020799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.227 × 10⁹⁵(96-digit number)
12278996229567464867…05411124392500041599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.455 × 10⁹⁵(96-digit number)
24557992459134929734…10822248785000083199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.911 × 10⁹⁵(96-digit number)
49115984918269859468…21644497570000166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.823 × 10⁹⁵(96-digit number)
98231969836539718937…43288995140000332799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.964 × 10⁹⁶(97-digit number)
19646393967307943787…86577990280000665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.929 × 10⁹⁶(97-digit number)
39292787934615887575…73155980560001331199
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,987,097 XPM·at block #6,842,843 · 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