Block #409,383

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/18/2014, 8:39:12 AM · Difficulty 10.4248 · 6,399,617 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
46e5b4b713d5958de2ab0cc16a616f2e2492a615491604d22e4fe3440ba4620c

Height

#409,383

Difficulty

10.424843

Transactions

12

Size

3.02 KB

Version

2

Bits

0a6cc27d

Nonce

138,897

Timestamp

2/18/2014, 8:39:12 AM

Confirmations

6,399,617

Merkle Root

111228c2957a1b9d107b9988519979a7495e7f632c0df9f05d144ba94fd44c8d
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.107 × 10⁹⁷(98-digit number)
21071026393484454272…28058233596370182401
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.107 × 10⁹⁷(98-digit number)
21071026393484454272…28058233596370182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.214 × 10⁹⁷(98-digit number)
42142052786968908544…56116467192740364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.428 × 10⁹⁷(98-digit number)
84284105573937817088…12232934385480729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.685 × 10⁹⁸(99-digit number)
16856821114787563417…24465868770961459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.371 × 10⁹⁸(99-digit number)
33713642229575126835…48931737541922918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.742 × 10⁹⁸(99-digit number)
67427284459150253670…97863475083845836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.348 × 10⁹⁹(100-digit number)
13485456891830050734…95726950167691673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.697 × 10⁹⁹(100-digit number)
26970913783660101468…91453900335383347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.394 × 10⁹⁹(100-digit number)
53941827567320202936…82907800670766694401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.078 × 10¹⁰⁰(101-digit number)
10788365513464040587…65815601341533388801
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,716,060 XPM·at block #6,808,999 · 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