Block #2,101,854

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/5/2017, 11:08:52 PM · Difficulty 10.8648 · 4,735,072 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
178154dec6a22a58c52f8f682973cedb695ad05170d4b5161df4b350fc4db19d

Height

#2,101,854

Difficulty

10.864811

Transactions

2

Size

722 B

Version

2

Bits

0add6440

Nonce

101,160,861

Timestamp

5/5/2017, 11:08:52 PM

Confirmations

4,735,072

Merkle Root

924d07b6bfdaf7f18c4ccf3c9307cbf9341ac326198e0205ce25e1f38a329038
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.624 × 10⁹⁴(95-digit number)
56241895907538795332…38975158581279225601
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.624 × 10⁹⁴(95-digit number)
56241895907538795332…38975158581279225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.124 × 10⁹⁵(96-digit number)
11248379181507759066…77950317162558451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.249 × 10⁹⁵(96-digit number)
22496758363015518133…55900634325116902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.499 × 10⁹⁵(96-digit number)
44993516726031036266…11801268650233804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.998 × 10⁹⁵(96-digit number)
89987033452062072532…23602537300467609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.799 × 10⁹⁶(97-digit number)
17997406690412414506…47205074600935219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.599 × 10⁹⁶(97-digit number)
35994813380824829012…94410149201870438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.198 × 10⁹⁶(97-digit number)
71989626761649658025…88820298403740876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.439 × 10⁹⁷(98-digit number)
14397925352329931605…77640596807481753601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.879 × 10⁹⁷(98-digit number)
28795850704659863210…55281193614963507201
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,939,704 XPM·at block #6,836,925 · 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