Block #499,519

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/18/2014, 4:00:48 PM · Difficulty 10.7916 · 6,326,729 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
135860064c3e88eaa52926cf8f875a2eb36d486871deb80af0735b7d8b1475c4

Height

#499,519

Difficulty

10.791620

Transactions

4

Size

1.00 KB

Version

2

Bits

0acaa797

Nonce

117,014

Timestamp

4/18/2014, 4:00:48 PM

Confirmations

6,326,729

Merkle Root

5ce1ac9402802a8352e858bf73f960ef9139201c4c9347d06098dccb1dd3e94a
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.749 × 10⁹⁶(97-digit number)
37497150425460131201…29919972805290737921
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.749 × 10⁹⁶(97-digit number)
37497150425460131201…29919972805290737921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.499 × 10⁹⁶(97-digit number)
74994300850920262403…59839945610581475841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.499 × 10⁹⁷(98-digit number)
14998860170184052480…19679891221162951681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.999 × 10⁹⁷(98-digit number)
29997720340368104961…39359782442325903361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.999 × 10⁹⁷(98-digit number)
59995440680736209923…78719564884651806721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.199 × 10⁹⁸(99-digit number)
11999088136147241984…57439129769303613441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.399 × 10⁹⁸(99-digit number)
23998176272294483969…14878259538607226881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.799 × 10⁹⁸(99-digit number)
47996352544588967938…29756519077214453761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.599 × 10⁹⁸(99-digit number)
95992705089177935877…59513038154428907521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.919 × 10⁹⁹(100-digit number)
19198541017835587175…19026076308857815041
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,854,116 XPM·at block #6,826,247 · 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