Block #439,669

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2014, 8:31:08 PM · Difficulty 10.3605 · 6,367,073 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3cb430e96ade3b7a20fb749e208b159dd44dfe9400862b5f489430ff30a73ed3

Height

#439,669

Difficulty

10.360484

Transactions

4

Size

879 B

Version

2

Bits

0a5c48b1

Nonce

181,633

Timestamp

3/11/2014, 8:31:08 PM

Confirmations

6,367,073

Merkle Root

3bccbd8fc4ee9dbbe9d8a9ef94306b58fc0fb85c6e0980f93cd9db7f8e5837de
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.

5.590 × 10¹⁰⁰(101-digit number)
55907825314549163627…54918675068371564201
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
5.590 × 10¹⁰⁰(101-digit number)
55907825314549163627…54918675068371564201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.118 × 10¹⁰¹(102-digit number)
11181565062909832725…09837350136743128401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.236 × 10¹⁰¹(102-digit number)
22363130125819665450…19674700273486256801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.472 × 10¹⁰¹(102-digit number)
44726260251639330901…39349400546972513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.945 × 10¹⁰¹(102-digit number)
89452520503278661803…78698801093945027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.789 × 10¹⁰²(103-digit number)
17890504100655732360…57397602187890054401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.578 × 10¹⁰²(103-digit number)
35781008201311464721…14795204375780108801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.156 × 10¹⁰²(103-digit number)
71562016402622929442…29590408751560217601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.431 × 10¹⁰³(104-digit number)
14312403280524585888…59180817503120435201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.862 × 10¹⁰³(104-digit number)
28624806561049171777…18361635006240870401
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,698,033 XPM·at block #6,806,741 · 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