Block #858,206

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 10:48:48 AM · Difficulty 10.9669 · 5,985,009 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
28b5d59e4f87279f80d735c2a7195f3b2bba2780e3bc82df77f9bccf060d28df

Height

#858,206

Difficulty

10.966890

Transactions

6

Size

1.88 KB

Version

2

Bits

0af7861d

Nonce

59,181,923

Timestamp

12/18/2014, 10:48:48 AM

Confirmations

5,985,009

Merkle Root

4d3209b03fa5618b6331d57f012368e5e02538401bec29dacb9c7e6022708ebe
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.393 × 10⁹⁷(98-digit number)
23935299362290416692…18185910325025351681
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.393 × 10⁹⁷(98-digit number)
23935299362290416692…18185910325025351681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.787 × 10⁹⁷(98-digit number)
47870598724580833385…36371820650050703361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.574 × 10⁹⁷(98-digit number)
95741197449161666771…72743641300101406721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.914 × 10⁹⁸(99-digit number)
19148239489832333354…45487282600202813441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.829 × 10⁹⁸(99-digit number)
38296478979664666708…90974565200405626881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.659 × 10⁹⁸(99-digit number)
76592957959329333417…81949130400811253761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.531 × 10⁹⁹(100-digit number)
15318591591865866683…63898260801622507521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.063 × 10⁹⁹(100-digit number)
30637183183731733366…27796521603245015041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.127 × 10⁹⁹(100-digit number)
61274366367463466733…55593043206490030081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.225 × 10¹⁰⁰(101-digit number)
12254873273492693346…11186086412980060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.450 × 10¹⁰⁰(101-digit number)
24509746546985386693…22372172825960120321
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,990,093 XPM·at block #6,843,214 · 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