Block #440,780

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2014, 4:07:05 PM · Difficulty 10.3530 · 6,386,613 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d6fa40224875ebe5d543f63ecd6fab32ff035a6797e901f54ca10aa56468bd74

Height

#440,780

Difficulty

10.352951

Transactions

2

Size

1.13 KB

Version

2

Bits

0a5a5b01

Nonce

100,148

Timestamp

3/12/2014, 4:07:05 PM

Confirmations

6,386,613

Merkle Root

ff091786a84fc421c0a873f6d4775fc468eca74860b2d491ce6933ab8da0a31f
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.

6.689 × 10⁹²(93-digit number)
66892107352000280985…00906200953022609121
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
6.689 × 10⁹²(93-digit number)
66892107352000280985…00906200953022609121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.337 × 10⁹³(94-digit number)
13378421470400056197…01812401906045218241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.675 × 10⁹³(94-digit number)
26756842940800112394…03624803812090436481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.351 × 10⁹³(94-digit number)
53513685881600224788…07249607624180872961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.070 × 10⁹⁴(95-digit number)
10702737176320044957…14499215248361745921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.140 × 10⁹⁴(95-digit number)
21405474352640089915…28998430496723491841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.281 × 10⁹⁴(95-digit number)
42810948705280179830…57996860993446983681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.562 × 10⁹⁴(95-digit number)
85621897410560359661…15993721986893967361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.712 × 10⁹⁵(96-digit number)
17124379482112071932…31987443973787934721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.424 × 10⁹⁵(96-digit number)
34248758964224143864…63974887947575869441
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,863,247 XPM·at block #6,827,392 · 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