Block #424,567

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/1/2014, 7:57:06 AM · Difficulty 10.3580 · 6,400,094 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
57325cec067bb8fcc640039cadfe55ea996b0f7df067ac2afde0f4b239f09333

Height

#424,567

Difficulty

10.358026

Transactions

8

Size

5.12 KB

Version

2

Bits

0a5ba795

Nonce

152,352

Timestamp

3/1/2014, 7:57:06 AM

Confirmations

6,400,094

Merkle Root

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

5.919 × 10⁹⁴(95-digit number)
59196849985840066602…13493969081404044851
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
5.919 × 10⁹⁴(95-digit number)
59196849985840066602…13493969081404044851
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.183 × 10⁹⁵(96-digit number)
11839369997168013320…26987938162808089701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.367 × 10⁹⁵(96-digit number)
23678739994336026640…53975876325616179401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.735 × 10⁹⁵(96-digit number)
47357479988672053281…07951752651232358801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.471 × 10⁹⁵(96-digit number)
94714959977344106563…15903505302464717601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.894 × 10⁹⁶(97-digit number)
18942991995468821312…31807010604929435201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.788 × 10⁹⁶(97-digit number)
37885983990937642625…63614021209858870401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.577 × 10⁹⁶(97-digit number)
75771967981875285250…27228042419717740801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.515 × 10⁹⁷(98-digit number)
15154393596375057050…54456084839435481601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.030 × 10⁹⁷(98-digit number)
30308787192750114100…08912169678870963201
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,841,351 XPM·at block #6,824,660 · 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