Block #426,215

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/2/2014, 11:26:43 AM · Difficulty 10.3589 · 6,383,953 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e04b59f9e99d5c88467fac0ac97fa34fdca6126e5c0a143c0c3641421276981

Height

#426,215

Difficulty

10.358880

Transactions

2

Size

2.06 KB

Version

2

Bits

0a5bdf89

Nonce

80,353

Timestamp

3/2/2014, 11:26:43 AM

Confirmations

6,383,953

Merkle Root

b29f4ee2e489f04de9c08a7f89f593066e0852bc07e6d852065f4553f282c809
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.

7.667 × 10⁹⁴(95-digit number)
76674777028234232876…65108687795539979201
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
7.667 × 10⁹⁴(95-digit number)
76674777028234232876…65108687795539979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.533 × 10⁹⁵(96-digit number)
15334955405646846575…30217375591079958401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.066 × 10⁹⁵(96-digit number)
30669910811293693150…60434751182159916801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.133 × 10⁹⁵(96-digit number)
61339821622587386301…20869502364319833601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.226 × 10⁹⁶(97-digit number)
12267964324517477260…41739004728639667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.453 × 10⁹⁶(97-digit number)
24535928649034954520…83478009457279334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.907 × 10⁹⁶(97-digit number)
49071857298069909040…66956018914558668801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.814 × 10⁹⁶(97-digit number)
98143714596139818081…33912037829117337601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.962 × 10⁹⁷(98-digit number)
19628742919227963616…67824075658234675201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.925 × 10⁹⁷(98-digit number)
39257485838455927232…35648151316469350401
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,725,411 XPM·at block #6,810,167 · 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.

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