Block #2,075,439

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/18/2017, 3:29:29 AM · Difficulty 10.8419 · 4,749,453 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6892c1bc3cccdc746bba569c7ea3b71816638c38dc5077549df1b0de329c1442

Height

#2,075,439

Difficulty

10.841924

Transactions

2

Size

574 B

Version

2

Bits

0ad78852

Nonce

147,632,929

Timestamp

4/18/2017, 3:29:29 AM

Confirmations

4,749,453

Merkle Root

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

5.997 × 10⁹⁶(97-digit number)
59972069438736443631…11688802302507151361
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
5.997 × 10⁹⁶(97-digit number)
59972069438736443631…11688802302507151361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.199 × 10⁹⁷(98-digit number)
11994413887747288726…23377604605014302721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.398 × 10⁹⁷(98-digit number)
23988827775494577452…46755209210028605441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.797 × 10⁹⁷(98-digit number)
47977655550989154905…93510418420057210881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.595 × 10⁹⁷(98-digit number)
95955311101978309810…87020836840114421761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.919 × 10⁹⁸(99-digit number)
19191062220395661962…74041673680228843521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.838 × 10⁹⁸(99-digit number)
38382124440791323924…48083347360457687041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.676 × 10⁹⁸(99-digit number)
76764248881582647848…96166694720915374081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.535 × 10⁹⁹(100-digit number)
15352849776316529569…92333389441830748161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.070 × 10⁹⁹(100-digit number)
30705699552633059139…84666778883661496321
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,843,217 XPM·at block #6,824,891 · 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