Block #2,992,881

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2019, 8:09:13 PM · Difficulty 11.2665 · 3,839,497 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2f895789202e4110f1b5507f54e4396e564dda6b80e2ce33b1ce6ca2584bfc2d

Height

#2,992,881

Difficulty

11.266508

Transactions

5

Size

2.11 KB

Version

2

Bits

0b4439e0

Nonce

1,047,643,521

Timestamp

1/2/2019, 8:09:13 PM

Confirmations

3,839,497

Merkle Root

bf8d71ceb0983378d3940b2e0cceace4c5361a7a533ea1d9627bf5ff04977416
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.

6.622 × 10⁹³(94-digit number)
66227432515057917194…91819138663737589761
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
6.622 × 10⁹³(94-digit number)
66227432515057917194…91819138663737589761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.324 × 10⁹⁴(95-digit number)
13245486503011583438…83638277327475179521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.649 × 10⁹⁴(95-digit number)
26490973006023166877…67276554654950359041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.298 × 10⁹⁴(95-digit number)
52981946012046333755…34553109309900718081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.059 × 10⁹⁵(96-digit number)
10596389202409266751…69106218619801436161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.119 × 10⁹⁵(96-digit number)
21192778404818533502…38212437239602872321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.238 × 10⁹⁵(96-digit number)
42385556809637067004…76424874479205744641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.477 × 10⁹⁵(96-digit number)
84771113619274134009…52849748958411489281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.695 × 10⁹⁶(97-digit number)
16954222723854826801…05699497916822978561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.390 × 10⁹⁶(97-digit number)
33908445447709653603…11398995833645957121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.781 × 10⁹⁶(97-digit number)
67816890895419307207…22797991667291914241
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,903,175 XPM·at block #6,832,377 · 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