Block #518,441

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2014, 2:36:19 PM · Difficulty 10.8535 · 6,298,266 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1dafb7844f448becc8ae286331e37eb3c824f0c9e9a6378af0ecb74b234ae9b0

Height

#518,441

Difficulty

10.853455

Transactions

13

Size

4.49 KB

Version

2

Bits

0ada7c06

Nonce

353,487,127

Timestamp

4/30/2014, 2:36:19 PM

Confirmations

6,298,266

Merkle Root

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

3.670 × 10⁹⁸(99-digit number)
36707131547704443884…23380716374407516401
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
3.670 × 10⁹⁸(99-digit number)
36707131547704443884…23380716374407516401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.341 × 10⁹⁸(99-digit number)
73414263095408887768…46761432748815032801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.468 × 10⁹⁹(100-digit number)
14682852619081777553…93522865497630065601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.936 × 10⁹⁹(100-digit number)
29365705238163555107…87045730995260131201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.873 × 10⁹⁹(100-digit number)
58731410476327110214…74091461990520262401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.174 × 10¹⁰⁰(101-digit number)
11746282095265422042…48182923981040524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.349 × 10¹⁰⁰(101-digit number)
23492564190530844085…96365847962081049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.698 × 10¹⁰⁰(101-digit number)
46985128381061688171…92731695924162099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.397 × 10¹⁰⁰(101-digit number)
93970256762123376343…85463391848324198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.879 × 10¹⁰¹(102-digit number)
18794051352424675268…70926783696648396801
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,777,779 XPM·at block #6,816,706 · 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