Block #1,808,339

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/14/2016, 6:10:04 PM · Difficulty 10.8292 · 4,999,723 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5d484c17dac1b01e606a635d53890119b08b90842ffce215bdfad466d8db6156

Height

#1,808,339

Difficulty

10.829249

Transactions

6

Size

9.41 KB

Version

2

Bits

0ad449a9

Nonce

320,045,360

Timestamp

10/14/2016, 6:10:04 PM

Confirmations

4,999,723

Merkle Root

df443d3c0f12ac96ef7717aaaa1b91e61b78fc441c7e15ae249ad6f24dcc5967
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.734 × 10⁹³(94-digit number)
57342646344755750499…74855208603626763241
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.734 × 10⁹³(94-digit number)
57342646344755750499…74855208603626763241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.146 × 10⁹⁴(95-digit number)
11468529268951150099…49710417207253526481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.293 × 10⁹⁴(95-digit number)
22937058537902300199…99420834414507052961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.587 × 10⁹⁴(95-digit number)
45874117075804600399…98841668829014105921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.174 × 10⁹⁴(95-digit number)
91748234151609200799…97683337658028211841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.834 × 10⁹⁵(96-digit number)
18349646830321840159…95366675316056423681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.669 × 10⁹⁵(96-digit number)
36699293660643680319…90733350632112847361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.339 × 10⁹⁵(96-digit number)
73398587321287360639…81466701264225694721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.467 × 10⁹⁶(97-digit number)
14679717464257472127…62933402528451389441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.935 × 10⁹⁶(97-digit number)
29359434928514944255…25866805056902778881
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,708,540 XPM·at block #6,808,061 · 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.

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