Block #423,959

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 7:41:36 PM · Difficulty 10.3741 · 6,390,005 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ebe745052cf8ec20e4371b9722ab7a061687cbcebdbd7ec9cfa9ba1cc7a8332c

Height

#423,959

Difficulty

10.374144

Transactions

5

Size

1.24 KB

Version

2

Bits

0a5fc7e6

Nonce

154,916

Timestamp

2/28/2014, 7:41:36 PM

Confirmations

6,390,005

Merkle Root

4f949ee0415dde44f618bb4d8239bb5031decff25e14d9399ee252849ea175ed
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.177 × 10⁹¹(92-digit number)
11772201515273338047…58729191992631810081
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.177 × 10⁹¹(92-digit number)
11772201515273338047…58729191992631810081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.354 × 10⁹¹(92-digit number)
23544403030546676095…17458383985263620161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.708 × 10⁹¹(92-digit number)
47088806061093352190…34916767970527240321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.417 × 10⁹¹(92-digit number)
94177612122186704380…69833535941054480641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.883 × 10⁹²(93-digit number)
18835522424437340876…39667071882108961281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.767 × 10⁹²(93-digit number)
37671044848874681752…79334143764217922561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.534 × 10⁹²(93-digit number)
75342089697749363504…58668287528435845121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.506 × 10⁹³(94-digit number)
15068417939549872700…17336575056871690241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.013 × 10⁹³(94-digit number)
30136835879099745401…34673150113743380481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.027 × 10⁹³(94-digit number)
60273671758199490803…69346300227486760961
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,755,789 XPM·at block #6,813,963 · 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