Block #494,439

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2014, 4:24:29 AM · Difficulty 10.7184 · 6,320,507 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
851d6c3385da543de66074678428a14911ca4a7ca51baf856510cd2aee28cb19

Height

#494,439

Difficulty

10.718391

Transactions

6

Size

1.31 KB

Version

2

Bits

0ab7e879

Nonce

341,104,193

Timestamp

4/16/2014, 4:24:29 AM

Confirmations

6,320,507

Merkle Root

98c784a1f31847d661d27308e5b622de10d718b3933f9a7651317562f9ad0dee
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.290 × 10⁹⁸(99-digit number)
82905531843469216271…66147360983521901441
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.290 × 10⁹⁸(99-digit number)
82905531843469216271…66147360983521901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.658 × 10⁹⁹(100-digit number)
16581106368693843254…32294721967043802881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.316 × 10⁹⁹(100-digit number)
33162212737387686508…64589443934087605761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.632 × 10⁹⁹(100-digit number)
66324425474775373017…29178887868175211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.326 × 10¹⁰⁰(101-digit number)
13264885094955074603…58357775736350423041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.652 × 10¹⁰⁰(101-digit number)
26529770189910149206…16715551472700846081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.305 × 10¹⁰⁰(101-digit number)
53059540379820298413…33431102945401692161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.061 × 10¹⁰¹(102-digit number)
10611908075964059682…66862205890803384321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.122 × 10¹⁰¹(102-digit number)
21223816151928119365…33724411781606768641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.244 × 10¹⁰¹(102-digit number)
42447632303856238731…67448823563213537281
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,763,664 XPM·at block #6,814,945 · 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