Block #2,110,100

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/10/2017, 1:45:55 PM · Difficulty 10.9020 · 4,729,690 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bde4fcc3a0b0be47779ab97c851f31566ea7d203c89e791af8631703ac86a038

Height

#2,110,100

Difficulty

10.901970

Transactions

3

Size

1.80 KB

Version

2

Bits

0ae6e77b

Nonce

670,477,269

Timestamp

5/10/2017, 1:45:55 PM

Confirmations

4,729,690

Merkle Root

3e479c282a019fd9e0619a1538c0e0c6f3b5e32c7d4512a22a8de058683f224e
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.

4.891 × 10⁹⁵(96-digit number)
48919845464922459643…95842037728046460801
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
4.891 × 10⁹⁵(96-digit number)
48919845464922459643…95842037728046460801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.783 × 10⁹⁵(96-digit number)
97839690929844919286…91684075456092921601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.956 × 10⁹⁶(97-digit number)
19567938185968983857…83368150912185843201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.913 × 10⁹⁶(97-digit number)
39135876371937967714…66736301824371686401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.827 × 10⁹⁶(97-digit number)
78271752743875935429…33472603648743372801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.565 × 10⁹⁷(98-digit number)
15654350548775187085…66945207297486745601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.130 × 10⁹⁷(98-digit number)
31308701097550374171…33890414594973491201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.261 × 10⁹⁷(98-digit number)
62617402195100748343…67780829189946982401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.252 × 10⁹⁸(99-digit number)
12523480439020149668…35561658379893964801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.504 × 10⁹⁸(99-digit number)
25046960878040299337…71123316759787929601
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,962,611 XPM·at block #6,839,789 · 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