Block #3,003,084

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2019, 5:20:33 AM · Difficulty 11.2025 · 3,842,246 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2a183e11e79c4b7cf0eb33e4887e151274674f9be66871641a2cdba4384d4ded

Height

#3,003,084

Difficulty

11.202451

Transactions

32

Size

8.05 KB

Version

2

Bits

0b33d3ce

Nonce

601,472,058

Timestamp

1/10/2019, 5:20:33 AM

Confirmations

3,842,246

Merkle Root

cfc4cba84999663a7dc11688e1e62ebc839f99c48a1ed1214700458d9a099e09
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.762 × 10⁹⁴(95-digit number)
17621434932025589871…14218309619480660281
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.762 × 10⁹⁴(95-digit number)
17621434932025589871…14218309619480660281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.524 × 10⁹⁴(95-digit number)
35242869864051179742…28436619238961320561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.048 × 10⁹⁴(95-digit number)
70485739728102359485…56873238477922641121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.409 × 10⁹⁵(96-digit number)
14097147945620471897…13746476955845282241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.819 × 10⁹⁵(96-digit number)
28194295891240943794…27492953911690564481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.638 × 10⁹⁵(96-digit number)
56388591782481887588…54985907823381128961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.127 × 10⁹⁶(97-digit number)
11277718356496377517…09971815646762257921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.255 × 10⁹⁶(97-digit number)
22555436712992755035…19943631293524515841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.511 × 10⁹⁶(97-digit number)
45110873425985510070…39887262587049031681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.022 × 10⁹⁶(97-digit number)
90221746851971020141…79774525174098063361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.804 × 10⁹⁷(98-digit number)
18044349370394204028…59549050348196126721
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:58,007,080 XPM·at block #6,845,329 · 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