Block #1,403,652

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2016, 11:29:44 PM · Difficulty 10.8061 · 5,438,992 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6ae8aea4cd16d92da85ef3f220a2eb35ffd4574ba5c72b6411d22021cf3d1d94

Height

#1,403,652

Difficulty

10.806098

Transactions

2

Size

1.86 KB

Version

2

Bits

0ace5c6d

Nonce

454,425,310

Timestamp

1/7/2016, 11:29:44 PM

Confirmations

5,438,992

Merkle Root

5f5a6029a21108c9602c7e4472af1248dd4e664595c286a3059a0997b9c1610f
Transactions (2)
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.611 × 10⁹⁷(98-digit number)
16114883774260950455…37696297988943749121
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.611 × 10⁹⁷(98-digit number)
16114883774260950455…37696297988943749121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.222 × 10⁹⁷(98-digit number)
32229767548521900910…75392595977887498241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.445 × 10⁹⁷(98-digit number)
64459535097043801820…50785191955774996481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.289 × 10⁹⁸(99-digit number)
12891907019408760364…01570383911549992961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.578 × 10⁹⁸(99-digit number)
25783814038817520728…03140767823099985921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.156 × 10⁹⁸(99-digit number)
51567628077635041456…06281535646199971841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.031 × 10⁹⁹(100-digit number)
10313525615527008291…12563071292399943681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.062 × 10⁹⁹(100-digit number)
20627051231054016582…25126142584799887361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.125 × 10⁹⁹(100-digit number)
41254102462108033164…50252285169599774721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.250 × 10⁹⁹(100-digit number)
82508204924216066329…00504570339199549441
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,985,586 XPM·at block #6,842,643 · 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