Block #430,706

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/5/2014, 4:27:14 PM · Difficulty 10.3451 · 6,394,688 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
64f7ac77facd4436468e857ffe39e41cd1919a632df03c84132a0c058a5d8247

Height

#430,706

Difficulty

10.345056

Transactions

2

Size

1.31 KB

Version

2

Bits

0a58559b

Nonce

20,857

Timestamp

3/5/2014, 4:27:14 PM

Confirmations

6,394,688

Merkle Root

3bdaa0bb4b448d9422f034b96d56e10ea77f35b2ab4ba950342b8712da94861e
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.047 × 10⁹⁰(91-digit number)
10479529101760129780…65612795096983235201
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.047 × 10⁹⁰(91-digit number)
10479529101760129780…65612795096983235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.095 × 10⁹⁰(91-digit number)
20959058203520259560…31225590193966470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.191 × 10⁹⁰(91-digit number)
41918116407040519120…62451180387932940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.383 × 10⁹⁰(91-digit number)
83836232814081038240…24902360775865881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.676 × 10⁹¹(92-digit number)
16767246562816207648…49804721551731763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.353 × 10⁹¹(92-digit number)
33534493125632415296…99609443103463526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.706 × 10⁹¹(92-digit number)
67068986251264830592…99218886206927052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.341 × 10⁹²(93-digit number)
13413797250252966118…98437772413854105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.682 × 10⁹²(93-digit number)
26827594500505932237…96875544827708211201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.365 × 10⁹²(93-digit number)
53655189001011864474…93751089655416422401
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,847,252 XPM·at block #6,825,393 · 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