Block #439,435

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2014, 4:37:57 PM · Difficulty 10.3591 · 6,370,283 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2e5c0996d561959a0534a7b2a1455e634cc09e17e228e1dcb060ccda32eb2d21

Height

#439,435

Difficulty

10.359129

Transactions

5

Size

1.70 KB

Version

2

Bits

0a5befe7

Nonce

23,862

Timestamp

3/11/2014, 4:37:57 PM

Confirmations

6,370,283

Merkle Root

7b6846dbf020cebf10484512e305250cb6023ed7bf84989ae7711d309a50a5c0
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.559 × 10⁹⁹(100-digit number)
25596839198428654685…85006387714441760001
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.559 × 10⁹⁹(100-digit number)
25596839198428654685…85006387714441760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.119 × 10⁹⁹(100-digit number)
51193678396857309370…70012775428883520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.023 × 10¹⁰⁰(101-digit number)
10238735679371461874…40025550857767040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.047 × 10¹⁰⁰(101-digit number)
20477471358742923748…80051101715534080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.095 × 10¹⁰⁰(101-digit number)
40954942717485847496…60102203431068160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.190 × 10¹⁰⁰(101-digit number)
81909885434971694992…20204406862136320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.638 × 10¹⁰¹(102-digit number)
16381977086994338998…40408813724272640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.276 × 10¹⁰¹(102-digit number)
32763954173988677996…80817627448545280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.552 × 10¹⁰¹(102-digit number)
65527908347977355993…61635254897090560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.310 × 10¹⁰²(103-digit number)
13105581669595471198…23270509794181120001
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,824 XPM·at block #6,809,717 · 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