Block #858,601

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2014, 6:20:46 PM · Difficulty 10.9665 · 5,983,359 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
54fa70274b0011e0fbec28d91414fa7b3738a2b4c98bf10094c0f57f753f4048

Height

#858,601

Difficulty

10.966513

Transactions

3

Size

728 B

Version

2

Bits

0af76d60

Nonce

1,015,084,384

Timestamp

12/18/2014, 6:20:46 PM

Confirmations

5,983,359

Merkle Root

28456199b7d56329fb5931a05f945bb25d55af9ec35807b73ce9ab1215e5f813
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.

2.434 × 10⁹⁶(97-digit number)
24344119656517946422…04145743859140107199
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
2.434 × 10⁹⁶(97-digit number)
24344119656517946422…04145743859140107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.868 × 10⁹⁶(97-digit number)
48688239313035892845…08291487718280214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.737 × 10⁹⁶(97-digit number)
97376478626071785691…16582975436560428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.947 × 10⁹⁷(98-digit number)
19475295725214357138…33165950873120857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.895 × 10⁹⁷(98-digit number)
38950591450428714276…66331901746241715199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.790 × 10⁹⁷(98-digit number)
77901182900857428553…32663803492483430399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.558 × 10⁹⁸(99-digit number)
15580236580171485710…65327606984966860799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.116 × 10⁹⁸(99-digit number)
31160473160342971421…30655213969933721599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.232 × 10⁹⁸(99-digit number)
62320946320685942842…61310427939867443199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.246 × 10⁹⁹(100-digit number)
12464189264137188568…22620855879734886399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.492 × 10⁹⁹(100-digit number)
24928378528274377137…45241711759469772799
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,980,061 XPM·at block #6,841,959 · 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