Block #440,252

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2014, 7:28:33 AM · Difficulty 10.3511 · 6,376,599 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ad5c09efbc138195fd2677d412210220be45c3ebe9f82f6b6fd604856fa87d0f

Height

#440,252

Difficulty

10.351124

Transactions

3

Size

1.14 KB

Version

2

Bits

0a59e340

Nonce

66,300

Timestamp

3/12/2014, 7:28:33 AM

Confirmations

6,376,599

Merkle Root

388df7703bb07e346a836493bd6ba526f70b6cf363c8f0f27175f93559ce6c17
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.622 × 10¹⁰⁶(107-digit number)
26220812961943017569…39536964420882083841
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.622 × 10¹⁰⁶(107-digit number)
26220812961943017569…39536964420882083841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.244 × 10¹⁰⁶(107-digit number)
52441625923886035138…79073928841764167681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.048 × 10¹⁰⁷(108-digit number)
10488325184777207027…58147857683528335361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.097 × 10¹⁰⁷(108-digit number)
20976650369554414055…16295715367056670721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.195 × 10¹⁰⁷(108-digit number)
41953300739108828110…32591430734113341441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.390 × 10¹⁰⁷(108-digit number)
83906601478217656221…65182861468226682881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.678 × 10¹⁰⁸(109-digit number)
16781320295643531244…30365722936453365761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.356 × 10¹⁰⁸(109-digit number)
33562640591287062488…60731445872906731521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.712 × 10¹⁰⁸(109-digit number)
67125281182574124977…21462891745813463041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.342 × 10¹⁰⁹(110-digit number)
13425056236514824995…42925783491626926081
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,778,850 XPM·at block #6,816,850 · 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