Block #2,121,287

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/17/2017, 10:27:29 PM · Difficulty 10.9130 · 4,720,399 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6ab42f316626e5fc5af426111eb51d2c4b7f6604746b9ff130e8cc56216e6de1

Height

#2,121,287

Difficulty

10.913032

Transactions

2

Size

868 B

Version

2

Bits

0ae9bc70

Nonce

1,822,678,407

Timestamp

5/17/2017, 10:27:29 PM

Confirmations

4,720,399

Merkle Root

30e95dc3577d73389e0685c347c40095ba6de5ac0b4538cd77b90f3aa560f6e0
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.

2.898 × 10⁹⁴(95-digit number)
28980908965032944277…31448885097541628161
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
2.898 × 10⁹⁴(95-digit number)
28980908965032944277…31448885097541628161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.796 × 10⁹⁴(95-digit number)
57961817930065888555…62897770195083256321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.159 × 10⁹⁵(96-digit number)
11592363586013177711…25795540390166512641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.318 × 10⁹⁵(96-digit number)
23184727172026355422…51591080780333025281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.636 × 10⁹⁵(96-digit number)
46369454344052710844…03182161560666050561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.273 × 10⁹⁵(96-digit number)
92738908688105421689…06364323121332101121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.854 × 10⁹⁶(97-digit number)
18547781737621084337…12728646242664202241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.709 × 10⁹⁶(97-digit number)
37095563475242168675…25457292485328404481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.419 × 10⁹⁶(97-digit number)
74191126950484337351…50914584970656808961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.483 × 10⁹⁷(98-digit number)
14838225390096867470…01829169941313617921
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,977,877 XPM·at block #6,841,685 · 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