Block #2,592,114

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/30/2018, 3:18:49 AM · Difficulty 11.3201 · 4,239,991 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
83cccaaa3027ee3eef497e44ca33f3ada0178c0330f359d314bc174ff5496ebe

Height

#2,592,114

Difficulty

11.320107

Transactions

2

Size

5.46 KB

Version

2

Bits

0b51f290

Nonce

578,465,971

Timestamp

3/30/2018, 3:18:49 AM

Confirmations

4,239,991

Merkle Root

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

1.119 × 10⁹⁶(97-digit number)
11199530503529396350…45751084799162260481
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.119 × 10⁹⁶(97-digit number)
11199530503529396350…45751084799162260481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.239 × 10⁹⁶(97-digit number)
22399061007058792700…91502169598324520961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.479 × 10⁹⁶(97-digit number)
44798122014117585400…83004339196649041921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.959 × 10⁹⁶(97-digit number)
89596244028235170801…66008678393298083841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.791 × 10⁹⁷(98-digit number)
17919248805647034160…32017356786596167681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.583 × 10⁹⁷(98-digit number)
35838497611294068320…64034713573192335361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.167 × 10⁹⁷(98-digit number)
71676995222588136641…28069427146384670721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.433 × 10⁹⁸(99-digit number)
14335399044517627328…56138854292769341441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.867 × 10⁹⁸(99-digit number)
28670798089035254656…12277708585538682881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.734 × 10⁹⁸(99-digit number)
57341596178070509313…24555417171077365761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.146 × 10⁹⁹(100-digit number)
11468319235614101862…49110834342154731521
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,900,970 XPM·at block #6,832,104 · 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