Block #406,287

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2014, 4:14:07 AM · Difficulty 10.4296 · 6,404,075 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dfd3f9927ea116366706055a874ab3916b14644e323c510344f75c01c2b9a59b

Height

#406,287

Difficulty

10.429616

Transactions

9

Size

3.13 KB

Version

2

Bits

0a6dfb4b

Nonce

167,938

Timestamp

2/16/2014, 4:14:07 AM

Confirmations

6,404,075

Merkle Root

74aea0a150b34100121038624e94eaa73a1dbae99f9aef09144496fdd8c87c07
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.249 × 10⁹⁷(98-digit number)
12494721715975096874…87422966512775850711
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.249 × 10⁹⁷(98-digit number)
12494721715975096874…87422966512775850711
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.498 × 10⁹⁷(98-digit number)
24989443431950193748…74845933025551701421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.997 × 10⁹⁷(98-digit number)
49978886863900387496…49691866051103402841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.995 × 10⁹⁷(98-digit number)
99957773727800774993…99383732102206805681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.999 × 10⁹⁸(99-digit number)
19991554745560154998…98767464204413611361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.998 × 10⁹⁸(99-digit number)
39983109491120309997…97534928408827222721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.996 × 10⁹⁸(99-digit number)
79966218982240619994…95069856817654445441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.599 × 10⁹⁹(100-digit number)
15993243796448123998…90139713635308890881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.198 × 10⁹⁹(100-digit number)
31986487592896247997…80279427270617781761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.397 × 10⁹⁹(100-digit number)
63972975185792495995…60558854541235563521
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,726,971 XPM·at block #6,810,361 · 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