Block #498,500

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/18/2014, 3:25:47 AM · Difficulty 10.7804 · 6,291,470 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3116dc798ed33caed69d2af7d06f20b167b6dccb98fd4cb5f78a70cf9804fc33

Height

#498,500

Difficulty

10.780401

Transactions

7

Size

2.42 KB

Version

2

Bits

0ac7c85b

Nonce

64,010

Timestamp

4/18/2014, 3:25:47 AM

Confirmations

6,291,470

Merkle Root

42e60b202f7fe72916c68eae26d016d40da2babf989b765824169de45299b628
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.

5.251 × 10⁹⁸(99-digit number)
52517824182731656675…24739669353792971201
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
5.251 × 10⁹⁸(99-digit number)
52517824182731656675…24739669353792971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.050 × 10⁹⁹(100-digit number)
10503564836546331335…49479338707585942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.100 × 10⁹⁹(100-digit number)
21007129673092662670…98958677415171884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.201 × 10⁹⁹(100-digit number)
42014259346185325340…97917354830343769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.402 × 10⁹⁹(100-digit number)
84028518692370650681…95834709660687539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.680 × 10¹⁰⁰(101-digit number)
16805703738474130136…91669419321375078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.361 × 10¹⁰⁰(101-digit number)
33611407476948260272…83338838642750156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.722 × 10¹⁰⁰(101-digit number)
67222814953896520544…66677677285500313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.344 × 10¹⁰¹(102-digit number)
13444562990779304108…33355354571000627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.688 × 10¹⁰¹(102-digit number)
26889125981558608217…66710709142001254401
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,563,737 XPM·at block #6,789,969 · updates every 60s