Block #660,611

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/3/2014, 10:30:23 AM · Difficulty 10.9563 · 6,147,418 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b15644780790397dd67bc10b87b340877895b1c6eb0c02d324b472952ca99893

Height

#660,611

Difficulty

10.956313

Transactions

4

Size

3.18 KB

Version

2

Bits

0af4d0e9

Nonce

161,748,302

Timestamp

8/3/2014, 10:30:23 AM

Confirmations

6,147,418

Merkle Root

55f55144ed474a159a27c55c760f0e4a390d14095bf7d41220dc8a50a15fdd71
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.295 × 10⁹⁸(99-digit number)
32950342435988520101…35629863219317516801
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.295 × 10⁹⁸(99-digit number)
32950342435988520101…35629863219317516801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.590 × 10⁹⁸(99-digit number)
65900684871977040203…71259726438635033601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.318 × 10⁹⁹(100-digit number)
13180136974395408040…42519452877270067201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.636 × 10⁹⁹(100-digit number)
26360273948790816081…85038905754540134401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.272 × 10⁹⁹(100-digit number)
52720547897581632162…70077811509080268801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.054 × 10¹⁰⁰(101-digit number)
10544109579516326432…40155623018160537601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.108 × 10¹⁰⁰(101-digit number)
21088219159032652865…80311246036321075201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.217 × 10¹⁰⁰(101-digit number)
42176438318065305730…60622492072642150401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.435 × 10¹⁰⁰(101-digit number)
84352876636130611460…21244984145284300801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.687 × 10¹⁰¹(102-digit number)
16870575327226122292…42489968290568601601
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,708,276 XPM·at block #6,808,028 · 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.

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