Block #2,153,684

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/9/2017, 7:57:52 PM · Difficulty 10.9036 · 4,690,824 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c0736856f806478e50401c18d7060d816d9ead6ae67325760bc46248f570821d

Height

#2,153,684

Difficulty

10.903555

Transactions

13

Size

4.13 KB

Version

2

Bits

0ae74f66

Nonce

673,847,282

Timestamp

6/9/2017, 7:57:52 PM

Confirmations

4,690,824

Merkle Root

384db3f8471a0dce4be1cefac3fd4a5117f2bc930736cef31b9331ac4b1abc1e
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.

1.276 × 10⁹⁴(95-digit number)
12765357834105987523…84304993045079121041
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
1.276 × 10⁹⁴(95-digit number)
12765357834105987523…84304993045079121041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.553 × 10⁹⁴(95-digit number)
25530715668211975047…68609986090158242081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.106 × 10⁹⁴(95-digit number)
51061431336423950094…37219972180316484161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.021 × 10⁹⁵(96-digit number)
10212286267284790018…74439944360632968321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.042 × 10⁹⁵(96-digit number)
20424572534569580037…48879888721265936641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.084 × 10⁹⁵(96-digit number)
40849145069139160075…97759777442531873281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.169 × 10⁹⁵(96-digit number)
81698290138278320151…95519554885063746561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.633 × 10⁹⁶(97-digit number)
16339658027655664030…91039109770127493121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.267 × 10⁹⁶(97-digit number)
32679316055311328060…82078219540254986241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.535 × 10⁹⁶(97-digit number)
65358632110622656121…64156439080509972481
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,000,461 XPM·at block #6,844,507 · 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