Block #401,310

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/12/2014, 4:16:00 PM · Difficulty 10.4345 · 6,423,720 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e6f498dd18c2d11ccdad01aad7d33091152e00cebf62c5e58e7e614f3687dd85

Height

#401,310

Difficulty

10.434456

Transactions

9

Size

2.80 KB

Version

2

Bits

0a6f3880

Nonce

58,388

Timestamp

2/12/2014, 4:16:00 PM

Confirmations

6,423,720

Merkle Root

9d45f145a42e54bf1b7d696feea374be6ddefcbc40b7ad1f15239b9fcc040bd2
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.

7.843 × 10⁹⁴(95-digit number)
78436193308352986509…72962013471394955521
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
7.843 × 10⁹⁴(95-digit number)
78436193308352986509…72962013471394955521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.568 × 10⁹⁵(96-digit number)
15687238661670597301…45924026942789911041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.137 × 10⁹⁵(96-digit number)
31374477323341194603…91848053885579822081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.274 × 10⁹⁵(96-digit number)
62748954646682389207…83696107771159644161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.254 × 10⁹⁶(97-digit number)
12549790929336477841…67392215542319288321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.509 × 10⁹⁶(97-digit number)
25099581858672955682…34784431084638576641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.019 × 10⁹⁶(97-digit number)
50199163717345911365…69568862169277153281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.003 × 10⁹⁷(98-digit number)
10039832743469182273…39137724338554306561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.007 × 10⁹⁷(98-digit number)
20079665486938364546…78275448677108613121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.015 × 10⁹⁷(98-digit number)
40159330973876729092…56550897354217226241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.031 × 10⁹⁷(98-digit number)
80318661947753458185…13101794708434452481
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,844,323 XPM·at block #6,825,029 · 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