Block #408,623

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/17/2014, 7:06:32 PM · Difficulty 10.4308 · 6,405,195 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cf25b0fa331f11363631b01425aa27dc6957fe8af1096cc0e69b8108e82def12

Height

#408,623

Difficulty

10.430820

Transactions

7

Size

2.27 KB

Version

2

Bits

0a6e4a40

Nonce

212,224

Timestamp

2/17/2014, 7:06:32 PM

Confirmations

6,405,195

Merkle Root

709eed4cdf94c8238d54472b53ae15c1ddef38063d83f9ffb729567a1303fa6f
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.

2.617 × 10⁹³(94-digit number)
26172308109453896309…33397463573698596481
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
2.617 × 10⁹³(94-digit number)
26172308109453896309…33397463573698596481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.234 × 10⁹³(94-digit number)
52344616218907792619…66794927147397192961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.046 × 10⁹⁴(95-digit number)
10468923243781558523…33589854294794385921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.093 × 10⁹⁴(95-digit number)
20937846487563117047…67179708589588771841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.187 × 10⁹⁴(95-digit number)
41875692975126234095…34359417179177543681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.375 × 10⁹⁴(95-digit number)
83751385950252468191…68718834358355087361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.675 × 10⁹⁵(96-digit number)
16750277190050493638…37437668716710174721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.350 × 10⁹⁵(96-digit number)
33500554380100987276…74875337433420349441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.700 × 10⁹⁵(96-digit number)
67001108760201974553…49750674866840698881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.340 × 10⁹⁶(97-digit number)
13400221752040394910…99501349733681397761
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,754,612 XPM·at block #6,813,817 · 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