Block #2,003,855

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/1/2017, 5:47:08 AM · Difficulty 10.7303 · 4,811,284 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
daa0e5b1b8300f9e69a0f246b2f29cc1bc33a7d1190ef403429ecea3be708745

Height

#2,003,855

Difficulty

10.730289

Transactions

2

Size

2.01 KB

Version

2

Bits

0abaf43e

Nonce

9,133,566

Timestamp

3/1/2017, 5:47:08 AM

Confirmations

4,811,284

Merkle Root

34b50d2d84f208a4a252587c6acba0621a75e071e0c5b1d46181842fcb236b37
Transactions (2)
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.

5.600 × 10⁹⁶(97-digit number)
56006093009366829717…84029024581023744001
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
5.600 × 10⁹⁶(97-digit number)
56006093009366829717…84029024581023744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.120 × 10⁹⁷(98-digit number)
11201218601873365943…68058049162047488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.240 × 10⁹⁷(98-digit number)
22402437203746731886…36116098324094976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.480 × 10⁹⁷(98-digit number)
44804874407493463773…72232196648189952001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.960 × 10⁹⁷(98-digit number)
89609748814986927547…44464393296379904001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.792 × 10⁹⁸(99-digit number)
17921949762997385509…88928786592759808001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.584 × 10⁹⁸(99-digit number)
35843899525994771019…77857573185519616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.168 × 10⁹⁸(99-digit number)
71687799051989542038…55715146371039232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.433 × 10⁹⁹(100-digit number)
14337559810397908407…11430292742078464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.867 × 10⁹⁹(100-digit number)
28675119620795816815…22860585484156928001
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 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
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 2CC formula:

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