Block #2,513,454

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/10/2018, 1:15:40 AM · Difficulty 10.9788 · 4,319,585 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3657258f955e26080350b325209b5b4c5d271bc830f2ad849f73ed62e3228c86

Height

#2,513,454

Difficulty

10.978769

Transactions

2

Size

869 B

Version

2

Bits

0afa9097

Nonce

1,847,032,428

Timestamp

2/10/2018, 1:15:40 AM

Confirmations

4,319,585

Merkle Root

43ae9f908e31301bf4338ddef625c8dc50dbf43cd90a7a67dca39a3f1d88d1ca
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.

1.575 × 10⁹⁶(97-digit number)
15758550870809082644…44500065683740385281
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.575 × 10⁹⁶(97-digit number)
15758550870809082644…44500065683740385281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.151 × 10⁹⁶(97-digit number)
31517101741618165288…89000131367480770561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.303 × 10⁹⁶(97-digit number)
63034203483236330577…78000262734961541121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.260 × 10⁹⁷(98-digit number)
12606840696647266115…56000525469923082241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.521 × 10⁹⁷(98-digit number)
25213681393294532230…12001050939846164481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.042 × 10⁹⁷(98-digit number)
50427362786589064461…24002101879692328961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.008 × 10⁹⁸(99-digit number)
10085472557317812892…48004203759384657921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.017 × 10⁹⁸(99-digit number)
20170945114635625784…96008407518769315841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.034 × 10⁹⁸(99-digit number)
40341890229271251569…92016815037538631681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.068 × 10⁹⁸(99-digit number)
80683780458542503138…84033630075077263361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.613 × 10⁹⁹(100-digit number)
16136756091708500627…68067260150154526721
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:57,908,490 XPM·at block #6,833,038 · 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