Block #858,599

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2014, 6:19:37 PM · Difficulty 10.9665 · 5,982,822 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2a265a3908458be4b954f3eca7a9e787c99fd65f4587f14804c6e1dbf4341492

Height

#858,599

Difficulty

10.966531

Transactions

10

Size

2.40 KB

Version

2

Bits

0af76e8e

Nonce

433,583,970

Timestamp

12/18/2014, 6:19:37 PM

Confirmations

5,982,822

Merkle Root

2149b6af2d8dc111e606bb9b467fdcdfaf743dd0f3165c5ccd228356326a78c6
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.124 × 10⁹⁶(97-digit number)
11243124444012188000…98360123468854437439
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.124 × 10⁹⁶(97-digit number)
11243124444012188000…98360123468854437439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.248 × 10⁹⁶(97-digit number)
22486248888024376000…96720246937708874879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.497 × 10⁹⁶(97-digit number)
44972497776048752001…93440493875417749759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.994 × 10⁹⁶(97-digit number)
89944995552097504003…86880987750835499519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.798 × 10⁹⁷(98-digit number)
17988999110419500800…73761975501670999039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.597 × 10⁹⁷(98-digit number)
35977998220839001601…47523951003341998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.195 × 10⁹⁷(98-digit number)
71955996441678003202…95047902006683996159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.439 × 10⁹⁸(99-digit number)
14391199288335600640…90095804013367992319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.878 × 10⁹⁸(99-digit number)
28782398576671201281…80191608026735984639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.756 × 10⁹⁸(99-digit number)
57564797153342402562…60383216053471969279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.151 × 10⁹⁹(100-digit number)
11512959430668480512…20766432106943938559
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,975,744 XPM·at block #6,841,420 · 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