Block #3,054,040

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/15/2019, 2:39:30 PM · Difficulty 11.0017 · 3,788,665 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
58806a17e33538a72caf16a07f64ffd35bb3c5d625c20c2073185ded04c609bd

Height

#3,054,040

Difficulty

11.001687

Transactions

2

Size

1.86 KB

Version

2

Bits

0b006e87

Nonce

1,041,034,564

Timestamp

2/15/2019, 2:39:30 PM

Confirmations

3,788,665

Merkle Root

84589fd9ab1dc81330b5e609c0c754e0f2f7a34b58fe3190137cf60d6d7cb113
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.

7.960 × 10⁹⁶(97-digit number)
79605865327824149818…43257195944297758721
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
7.960 × 10⁹⁶(97-digit number)
79605865327824149818…43257195944297758721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.592 × 10⁹⁷(98-digit number)
15921173065564829963…86514391888595517441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.184 × 10⁹⁷(98-digit number)
31842346131129659927…73028783777191034881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.368 × 10⁹⁷(98-digit number)
63684692262259319854…46057567554382069761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.273 × 10⁹⁸(99-digit number)
12736938452451863970…92115135108764139521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.547 × 10⁹⁸(99-digit number)
25473876904903727941…84230270217528279041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.094 × 10⁹⁸(99-digit number)
50947753809807455883…68460540435056558081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.018 × 10⁹⁹(100-digit number)
10189550761961491176…36921080870113116161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.037 × 10⁹⁹(100-digit number)
20379101523922982353…73842161740226232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.075 × 10⁹⁹(100-digit number)
40758203047845964706…47684323480452464641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.151 × 10⁹⁹(100-digit number)
81516406095691929413…95368646960904929281
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,985,989 XPM·at block #6,842,704 · 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