Block #2,451,566

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/31/2017, 9:03:33 PM · Difficulty 10.9498 · 4,391,656 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
693fd98a2df5e157452c9e12d0eb622006fbffdac7ee0d7a371eb7ff713cef16

Height

#2,451,566

Difficulty

10.949772

Transactions

3

Size

1.03 KB

Version

2

Bits

0af32449

Nonce

9,393,698

Timestamp

12/31/2017, 9:03:33 PM

Confirmations

4,391,656

Merkle Root

a74f096dc6fe5e38fd6f03e22b0ad70af227bf420c4d00a5b997e53128218da8
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.903 × 10⁹⁵(96-digit number)
29037993668970792977…32152620873640640481
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.903 × 10⁹⁵(96-digit number)
29037993668970792977…32152620873640640481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.807 × 10⁹⁵(96-digit number)
58075987337941585955…64305241747281280961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.161 × 10⁹⁶(97-digit number)
11615197467588317191…28610483494562561921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.323 × 10⁹⁶(97-digit number)
23230394935176634382…57220966989125123841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.646 × 10⁹⁶(97-digit number)
46460789870353268764…14441933978250247681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.292 × 10⁹⁶(97-digit number)
92921579740706537529…28883867956500495361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.858 × 10⁹⁷(98-digit number)
18584315948141307505…57767735913000990721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.716 × 10⁹⁷(98-digit number)
37168631896282615011…15535471826001981441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.433 × 10⁹⁷(98-digit number)
74337263792565230023…31070943652003962881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.486 × 10⁹⁸(99-digit number)
14867452758513046004…62141887304007925761
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,990,150 XPM·at block #6,843,221 · 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