Block #440,134

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2014, 5:26:24 AM · Difficulty 10.3515 · 6,376,047 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f0a290a7a4e4bf2185974b3c3b839acc2ce4ee1485c0eb099afbb83e4dbb96cb

Height

#440,134

Difficulty

10.351514

Transactions

15

Size

5.66 KB

Version

2

Bits

0a59fccf

Nonce

202,943

Timestamp

3/12/2014, 5:26:24 AM

Confirmations

6,376,047

Merkle Root

82cef1c47c9e09242a2a0851d76fcea60ae59bfa84556c51f7e0e9fc6b6ea174
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.

8.900 × 10⁹⁷(98-digit number)
89006453925195255691…06791420596840824321
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
8.900 × 10⁹⁷(98-digit number)
89006453925195255691…06791420596840824321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.780 × 10⁹⁸(99-digit number)
17801290785039051138…13582841193681648641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.560 × 10⁹⁸(99-digit number)
35602581570078102276…27165682387363297281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.120 × 10⁹⁸(99-digit number)
71205163140156204553…54331364774726594561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.424 × 10⁹⁹(100-digit number)
14241032628031240910…08662729549453189121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.848 × 10⁹⁹(100-digit number)
28482065256062481821…17325459098906378241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.696 × 10⁹⁹(100-digit number)
56964130512124963642…34650918197812756481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.139 × 10¹⁰⁰(101-digit number)
11392826102424992728…69301836395625512961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.278 × 10¹⁰⁰(101-digit number)
22785652204849985457…38603672791251025921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.557 × 10¹⁰⁰(101-digit number)
45571304409699970914…77207345582502051841
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,773,573 XPM·at block #6,816,180 · 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