Block #2,297,102

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/15/2017, 12:27:51 PM · Difficulty 10.9484 · 4,539,241 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2cf7039f65527c6fd97fe2b71816bd6e5152cbe2f50ed1aed10881e991ee4c59

Height

#2,297,102

Difficulty

10.948369

Transactions

3

Size

654 B

Version

2

Bits

0af2c854

Nonce

1,524,423,552

Timestamp

9/15/2017, 12:27:51 PM

Confirmations

4,539,241

Merkle Root

9c03281810c9940c04ef8a75461eccb69b5744c886dedb95521484a38e1d1753
Transactions (3)
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.347 × 10⁹⁶(97-digit number)
13478097461930865729…03972324421953221121
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.347 × 10⁹⁶(97-digit number)
13478097461930865729…03972324421953221121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.695 × 10⁹⁶(97-digit number)
26956194923861731458…07944648843906442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.391 × 10⁹⁶(97-digit number)
53912389847723462916…15889297687812884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.078 × 10⁹⁷(98-digit number)
10782477969544692583…31778595375625768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.156 × 10⁹⁷(98-digit number)
21564955939089385166…63557190751251537921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.312 × 10⁹⁷(98-digit number)
43129911878178770333…27114381502503075841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.625 × 10⁹⁷(98-digit number)
86259823756357540666…54228763005006151681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.725 × 10⁹⁸(99-digit number)
17251964751271508133…08457526010012303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.450 × 10⁹⁸(99-digit number)
34503929502543016266…16915052020024606721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.900 × 10⁹⁸(99-digit number)
69007859005086032532…33830104040049213441
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,935,002 XPM·at block #6,836,342 · 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