Block #2,425,074

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2017, 7:02:25 AM · Difficulty 10.9147 · 4,405,908 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fef2a3677c486e28dddafeec12e09cb20866050fbc75a69cad104310854f4342

Height

#2,425,074

Difficulty

10.914676

Transactions

2

Size

6.77 KB

Version

2

Bits

0aea283a

Nonce

187,376,829

Timestamp

12/15/2017, 7:02:25 AM

Confirmations

4,405,908

Merkle Root

90395ee0ddc84600f1d02280572478e600b86557984c90eccb0bb6940fca5578
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.

3.025 × 10⁹⁶(97-digit number)
30259455746448792146…29854225137582215681
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
3.025 × 10⁹⁶(97-digit number)
30259455746448792146…29854225137582215681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.051 × 10⁹⁶(97-digit number)
60518911492897584293…59708450275164431361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.210 × 10⁹⁷(98-digit number)
12103782298579516858…19416900550328862721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.420 × 10⁹⁷(98-digit number)
24207564597159033717…38833801100657725441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.841 × 10⁹⁷(98-digit number)
48415129194318067434…77667602201315450881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.683 × 10⁹⁷(98-digit number)
96830258388636134869…55335204402630901761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.936 × 10⁹⁸(99-digit number)
19366051677727226973…10670408805261803521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.873 × 10⁹⁸(99-digit number)
38732103355454453947…21340817610523607041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.746 × 10⁹⁸(99-digit number)
77464206710908907895…42681635221047214081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.549 × 10⁹⁹(100-digit number)
15492841342181781579…85363270442094428161
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,891,996 XPM·at block #6,830,981 · 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