Block #3,324,987

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/24/2019, 12:04:49 PM · Difficulty 11.0211 · 3,517,839 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c0407b85c559ecb37393d99c5195a1220850fea3e8d34f36b903dbdb6411f5e7

Height

#3,324,987

Difficulty

11.021112

Transactions

6

Size

2.04 KB

Version

2

Bits

0b056795

Nonce

460,914,882

Timestamp

8/24/2019, 12:04:49 PM

Confirmations

3,517,839

Merkle Root

b7b1654f708eb5a39b319db9b8b5f41be82dcb1d066226b373195e000974806e
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.463 × 10⁹⁶(97-digit number)
14633622470638071984…02910371587863336961
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.463 × 10⁹⁶(97-digit number)
14633622470638071984…02910371587863336961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.926 × 10⁹⁶(97-digit number)
29267244941276143969…05820743175726673921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.853 × 10⁹⁶(97-digit number)
58534489882552287938…11641486351453347841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.170 × 10⁹⁷(98-digit number)
11706897976510457587…23282972702906695681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.341 × 10⁹⁷(98-digit number)
23413795953020915175…46565945405813391361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.682 × 10⁹⁷(98-digit number)
46827591906041830350…93131890811626782721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.365 × 10⁹⁷(98-digit number)
93655183812083660700…86263781623253565441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.873 × 10⁹⁸(99-digit number)
18731036762416732140…72527563246507130881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.746 × 10⁹⁸(99-digit number)
37462073524833464280…45055126493014261761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.492 × 10⁹⁸(99-digit number)
74924147049666928560…90110252986028523521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.498 × 10⁹⁹(100-digit number)
14984829409933385712…80220505972057047041
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,986,951 XPM·at block #6,842,825 · 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