Block #2,100,496

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/5/2017, 6:04:41 AM · Difficulty 10.8555 · 4,744,761 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
18bfed2d570a9e140f192f531e56afb0d71bfd3449980d2b5407b48893c58747

Height

#2,100,496

Difficulty

10.855463

Transactions

2

Size

427 B

Version

2

Bits

0adaff9f

Nonce

268,311,829

Timestamp

5/5/2017, 6:04:41 AM

Confirmations

4,744,761

Merkle Root

26e90f6baf2091e9a6fc1d7a4b87975acd4844f711f0de4852d2d33c1b1ce770
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.

9.686 × 10⁹⁵(96-digit number)
96863235781053150673…15336154316975358721
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
9.686 × 10⁹⁵(96-digit number)
96863235781053150673…15336154316975358721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.937 × 10⁹⁶(97-digit number)
19372647156210630134…30672308633950717441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.874 × 10⁹⁶(97-digit number)
38745294312421260269…61344617267901434881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.749 × 10⁹⁶(97-digit number)
77490588624842520539…22689234535802869761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.549 × 10⁹⁷(98-digit number)
15498117724968504107…45378469071605739521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.099 × 10⁹⁷(98-digit number)
30996235449937008215…90756938143211479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.199 × 10⁹⁷(98-digit number)
61992470899874016431…81513876286422958081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.239 × 10⁹⁸(99-digit number)
12398494179974803286…63027752572845916161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.479 × 10⁹⁸(99-digit number)
24796988359949606572…26055505145691832321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.959 × 10⁹⁸(99-digit number)
49593976719899213145…52111010291383664641
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:58,006,489 XPM·at block #6,845,256 · 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