Block #3,012,252

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2019, 4:29:50 PM · Difficulty 11.1800 · 3,829,168 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
77ff7dc503c88377f7a0182e510e73c557751b2a6fa7b85433daa34c89932d85

Height

#3,012,252

Difficulty

11.179998

Transactions

32

Size

7.80 KB

Version

2

Bits

0b2e1458

Nonce

756,117,804

Timestamp

1/16/2019, 4:29:50 PM

Confirmations

3,829,168

Merkle Root

fd9cdc0e33f1acf5cc0da147f5885650396159f8134a2e32c5cb34288f9f82ae
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.296 × 10⁹⁷(98-digit number)
12963976639478228650…97751771157725185281
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.296 × 10⁹⁷(98-digit number)
12963976639478228650…97751771157725185281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.592 × 10⁹⁷(98-digit number)
25927953278956457301…95503542315450370561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.185 × 10⁹⁷(98-digit number)
51855906557912914603…91007084630900741121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.037 × 10⁹⁸(99-digit number)
10371181311582582920…82014169261801482241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.074 × 10⁹⁸(99-digit number)
20742362623165165841…64028338523602964481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.148 × 10⁹⁸(99-digit number)
41484725246330331683…28056677047205928961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.296 × 10⁹⁸(99-digit number)
82969450492660663366…56113354094411857921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.659 × 10⁹⁹(100-digit number)
16593890098532132673…12226708188823715841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.318 × 10⁹⁹(100-digit number)
33187780197064265346…24453416377647431681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.637 × 10⁹⁹(100-digit number)
66375560394128530692…48906832755294863361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.327 × 10¹⁰⁰(101-digit number)
13275112078825706138…97813665510589726721
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,975,736 XPM·at block #6,841,419 · 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