Block #440,687

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2014, 2:46:57 PM · Difficulty 10.3508 · 6,368,995 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5493ecb8c15fab9287060de5b63048bb13c656d8a2618393e23964f1132644c1

Height

#440,687

Difficulty

10.350845

Transactions

2

Size

644 B

Version

2

Bits

0a59d0fd

Nonce

105,148

Timestamp

3/12/2014, 2:46:57 PM

Confirmations

6,368,995

Merkle Root

708d58be9c046c649e61310c5a637a5a938dbde881b2aac984b52f835908eba3
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.173 × 10⁹⁹(100-digit number)
11732388171746081056…98736025823759549441
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.173 × 10⁹⁹(100-digit number)
11732388171746081056…98736025823759549441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.346 × 10⁹⁹(100-digit number)
23464776343492162113…97472051647519098881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.692 × 10⁹⁹(100-digit number)
46929552686984324226…94944103295038197761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.385 × 10⁹⁹(100-digit number)
93859105373968648452…89888206590076395521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.877 × 10¹⁰⁰(101-digit number)
18771821074793729690…79776413180152791041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.754 × 10¹⁰⁰(101-digit number)
37543642149587459380…59552826360305582081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.508 × 10¹⁰⁰(101-digit number)
75087284299174918761…19105652720611164161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.501 × 10¹⁰¹(102-digit number)
15017456859834983752…38211305441222328321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.003 × 10¹⁰¹(102-digit number)
30034913719669967504…76422610882444656641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.006 × 10¹⁰¹(102-digit number)
60069827439339935009…52845221764889313281
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,721,531 XPM·at block #6,809,681 · 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