Block #2,460,450

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2018, 5:18:15 PM · Difficulty 10.9545 · 4,384,511 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
36602d3956f8297150aa628fafdabae4ac3761a109f455f9563e2cf8c1d65013

Height

#2,460,450

Difficulty

10.954486

Transactions

15

Size

5.37 KB

Version

2

Bits

0af45936

Nonce

111,503,591

Timestamp

1/6/2018, 5:18:15 PM

Confirmations

4,384,511

Merkle Root

18b23e6cd2237eccb2e6cffdbd85b6c64d73115d1676a89f9c4ad5efdff10812
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.398 × 10⁹⁵(96-digit number)
23989150152849965336…77119779074096864001
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.398 × 10⁹⁵(96-digit number)
23989150152849965336…77119779074096864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.797 × 10⁹⁵(96-digit number)
47978300305699930672…54239558148193728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.595 × 10⁹⁵(96-digit number)
95956600611399861344…08479116296387456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.919 × 10⁹⁶(97-digit number)
19191320122279972268…16958232592774912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.838 × 10⁹⁶(97-digit number)
38382640244559944537…33916465185549824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.676 × 10⁹⁶(97-digit number)
76765280489119889075…67832930371099648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.535 × 10⁹⁷(98-digit number)
15353056097823977815…35665860742199296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.070 × 10⁹⁷(98-digit number)
30706112195647955630…71331721484398592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.141 × 10⁹⁷(98-digit number)
61412224391295911260…42663442968797184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.228 × 10⁹⁸(99-digit number)
12282444878259182252…85326885937594368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.456 × 10⁹⁸(99-digit number)
24564889756518364504…70653771875188736001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,004,106 XPM·at block #6,844,960 · 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