Block #424,357

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/1/2014, 4:32:20 AM · Difficulty 10.3574 · 6,391,511 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4fa021712acccff77aed9d98a5d452c041c6893ee54bac327587f5794310ccf1

Height

#424,357

Difficulty

10.357421

Transactions

4

Size

878 B

Version

2

Bits

0a5b7ff0

Nonce

66,077

Timestamp

3/1/2014, 4:32:20 AM

Confirmations

6,391,511

Merkle Root

74d04712b8e2e6d02ff4fb7fbb6ff63ddab343ea15f206bd182ce0786c6d34d4
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.315 × 10⁹¹(92-digit number)
13157024131199590476…82615348472700340321
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.315 × 10⁹¹(92-digit number)
13157024131199590476…82615348472700340321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.631 × 10⁹¹(92-digit number)
26314048262399180952…65230696945400680641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.262 × 10⁹¹(92-digit number)
52628096524798361904…30461393890801361281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.052 × 10⁹²(93-digit number)
10525619304959672380…60922787781602722561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.105 × 10⁹²(93-digit number)
21051238609919344761…21845575563205445121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.210 × 10⁹²(93-digit number)
42102477219838689523…43691151126410890241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.420 × 10⁹²(93-digit number)
84204954439677379046…87382302252821780481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.684 × 10⁹³(94-digit number)
16840990887935475809…74764604505643560961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.368 × 10⁹³(94-digit number)
33681981775870951618…49529209011287121921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.736 × 10⁹³(94-digit number)
67363963551741903237…99058418022574243841
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,771,057 XPM·at block #6,815,867 · 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