Block #3,005,375

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2019, 7:47:53 PM · Difficulty 11.1999 · 3,838,753 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ed4d97a7e01b8ab944a04c8be2206bf5a7af217030ec6cbf0c1580009ee6315

Height

#3,005,375

Difficulty

11.199880

Transactions

8

Size

2.76 KB

Version

2

Bits

0b332b50

Nonce

886,371,430

Timestamp

1/11/2019, 7:47:53 PM

Confirmations

3,838,753

Merkle Root

721d25d641463e89859b8b55508d4a7270fd8e6f967607647d633b0097e00983
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.323 × 10⁹⁶(97-digit number)
13230953300370690020…11602084050622223361
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.323 × 10⁹⁶(97-digit number)
13230953300370690020…11602084050622223361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.646 × 10⁹⁶(97-digit number)
26461906600741380040…23204168101244446721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.292 × 10⁹⁶(97-digit number)
52923813201482760081…46408336202488893441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.058 × 10⁹⁷(98-digit number)
10584762640296552016…92816672404977786881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.116 × 10⁹⁷(98-digit number)
21169525280593104032…85633344809955573761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.233 × 10⁹⁷(98-digit number)
42339050561186208065…71266689619911147521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.467 × 10⁹⁷(98-digit number)
84678101122372416130…42533379239822295041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.693 × 10⁹⁸(99-digit number)
16935620224474483226…85066758479644590081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.387 × 10⁹⁸(99-digit number)
33871240448948966452…70133516959289180161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.774 × 10⁹⁸(99-digit number)
67742480897897932904…40267033918578360321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.354 × 10⁹⁹(100-digit number)
13548496179579586580…80534067837156720641
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,997,397 XPM·at block #6,844,127 · 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