Block #2,121,807

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/18/2017, 5:56:41 AM · Difficulty 10.9143 · 4,720,077 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f6b8e01668cc5446525f33584543a24923fc7a69333c45098ccbd83e8f84799b

Height

#2,121,807

Difficulty

10.914270

Transactions

39

Size

11.62 KB

Version

2

Bits

0aea0d94

Nonce

14,263,287

Timestamp

5/18/2017, 5:56:41 AM

Confirmations

4,720,077

Merkle Root

2e4bc742ef460f87832f0e871cbd0c4f40be50cafbf4381ae59da82ab6e24e9b
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.

8.092 × 10⁹⁶(97-digit number)
80920955068851183509…40335913725329653761
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
8.092 × 10⁹⁶(97-digit number)
80920955068851183509…40335913725329653761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.618 × 10⁹⁷(98-digit number)
16184191013770236701…80671827450659307521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.236 × 10⁹⁷(98-digit number)
32368382027540473403…61343654901318615041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.473 × 10⁹⁷(98-digit number)
64736764055080946807…22687309802637230081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.294 × 10⁹⁸(99-digit number)
12947352811016189361…45374619605274460161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.589 × 10⁹⁸(99-digit number)
25894705622032378723…90749239210548920321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.178 × 10⁹⁸(99-digit number)
51789411244064757446…81498478421097840641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.035 × 10⁹⁹(100-digit number)
10357882248812951489…62996956842195681281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.071 × 10⁹⁹(100-digit number)
20715764497625902978…25993913684391362561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.143 × 10⁹⁹(100-digit number)
41431528995251805956…51987827368782725121
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,979,448 XPM·at block #6,841,883 · 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