Block #2,407,824

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/3/2017, 9:06:14 PM · Difficulty 10.8992 · 4,425,449 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
499b4bba1dd05088b0da1e03d27af0a24d72ff6ec2ce391bba179fedafd7a0f4

Height

#2,407,824

Difficulty

10.899174

Transactions

2

Size

1.49 KB

Version

2

Bits

0ae6304c

Nonce

422,476,889

Timestamp

12/3/2017, 9:06:14 PM

Confirmations

4,425,449

Merkle Root

de9cd1fa2f3738090647fd274206e2cfd03fb627e29571c6403a285cbf4b85a6
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.829 × 10⁹⁵(96-digit number)
18292686362065861218…70409388524476436161
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.829 × 10⁹⁵(96-digit number)
18292686362065861218…70409388524476436161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.658 × 10⁹⁵(96-digit number)
36585372724131722436…40818777048952872321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.317 × 10⁹⁵(96-digit number)
73170745448263444873…81637554097905744641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.463 × 10⁹⁶(97-digit number)
14634149089652688974…63275108195811489281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.926 × 10⁹⁶(97-digit number)
29268298179305377949…26550216391622978561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.853 × 10⁹⁶(97-digit number)
58536596358610755898…53100432783245957121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.170 × 10⁹⁷(98-digit number)
11707319271722151179…06200865566491914241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.341 × 10⁹⁷(98-digit number)
23414638543444302359…12401731132983828481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.682 × 10⁹⁷(98-digit number)
46829277086888604719…24803462265967656961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.365 × 10⁹⁷(98-digit number)
93658554173777209438…49606924531935313921
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,910,378 XPM·at block #6,833,272 · 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