Block #2,173,051

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/23/2017, 2:00:30 AM · Difficulty 10.9094 · 4,668,251 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bbe787551a09bf9a61c42d7d399dbdd20126a0ef2c6c7ef157f667f8eb371e5c

Height

#2,173,051

Difficulty

10.909419

Transactions

17

Size

9.66 KB

Version

2

Bits

0ae8cfac

Nonce

1,084,168,888

Timestamp

6/23/2017, 2:00:30 AM

Confirmations

4,668,251

Merkle Root

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

6.585 × 10⁹⁵(96-digit number)
65850606147321963741…47678295647350550401
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
6.585 × 10⁹⁵(96-digit number)
65850606147321963741…47678295647350550401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.317 × 10⁹⁶(97-digit number)
13170121229464392748…95356591294701100801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.634 × 10⁹⁶(97-digit number)
26340242458928785496…90713182589402201601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.268 × 10⁹⁶(97-digit number)
52680484917857570993…81426365178804403201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.053 × 10⁹⁷(98-digit number)
10536096983571514198…62852730357608806401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.107 × 10⁹⁷(98-digit number)
21072193967143028397…25705460715217612801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.214 × 10⁹⁷(98-digit number)
42144387934286056794…51410921430435225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.428 × 10⁹⁷(98-digit number)
84288775868572113589…02821842860870451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.685 × 10⁹⁸(99-digit number)
16857755173714422717…05643685721740902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.371 × 10⁹⁸(99-digit number)
33715510347428845435…11287371443481804801
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,974,775 XPM·at block #6,841,301 · 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