Block #2,146,494

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/5/2017, 5:46:17 AM · Difficulty 10.8916 · 4,698,763 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
62e3a85c9ebec158fbd3fa712680a1a8b55d7c5502cc5a1cd07566a330436abf

Height

#2,146,494

Difficulty

10.891593

Transactions

2

Size

426 B

Version

2

Bits

0ae43f78

Nonce

219,942,227

Timestamp

6/5/2017, 5:46:17 AM

Confirmations

4,698,763

Merkle Root

0edd862be2427ae5b6b938fc3cc7fdd6aae93d080082902c21092af16405c5d3
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.

3.867 × 10⁹⁵(96-digit number)
38678907313157424473…48031771968018159041
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
3.867 × 10⁹⁵(96-digit number)
38678907313157424473…48031771968018159041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.735 × 10⁹⁵(96-digit number)
77357814626314848947…96063543936036318081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.547 × 10⁹⁶(97-digit number)
15471562925262969789…92127087872072636161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.094 × 10⁹⁶(97-digit number)
30943125850525939579…84254175744145272321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.188 × 10⁹⁶(97-digit number)
61886251701051879158…68508351488290544641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.237 × 10⁹⁷(98-digit number)
12377250340210375831…37016702976581089281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.475 × 10⁹⁷(98-digit number)
24754500680420751663…74033405953162178561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.950 × 10⁹⁷(98-digit number)
49509001360841503326…48066811906324357121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.901 × 10⁹⁷(98-digit number)
99018002721683006652…96133623812648714241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.980 × 10⁹⁸(99-digit number)
19803600544336601330…92267247625297428481
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