Block #185,098

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/29/2013, 1:50:35 AM · Difficulty 9.8622 · 6,627,229 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6b02d5b32657903fa6b904bdaa93266e6a695f52841decadc010e81efec41b19

Height

#185,098

Difficulty

9.862214

Transactions

7

Size

2.24 KB

Version

2

Bits

09dcba13

Nonce

17,204

Timestamp

9/29/2013, 1:50:35 AM

Confirmations

6,627,229

Merkle Root

1c85be1d4bf6d7520c5766359c876948d87637731ad824cc066a17c6bd2ddbbe
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.188 × 10⁹⁴(95-digit number)
81885480357604792490…92958512815139305501
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.188 × 10⁹⁴(95-digit number)
81885480357604792490…92958512815139305501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.637 × 10⁹⁵(96-digit number)
16377096071520958498…85917025630278611001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.275 × 10⁹⁵(96-digit number)
32754192143041916996…71834051260557222001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.550 × 10⁹⁵(96-digit number)
65508384286083833992…43668102521114444001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.310 × 10⁹⁶(97-digit number)
13101676857216766798…87336205042228888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.620 × 10⁹⁶(97-digit number)
26203353714433533597…74672410084457776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.240 × 10⁹⁶(97-digit number)
52406707428867067194…49344820168915552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.048 × 10⁹⁷(98-digit number)
10481341485773413438…98689640337831104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.096 × 10⁹⁷(98-digit number)
20962682971546826877…97379280675662208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.192 × 10⁹⁷(98-digit number)
41925365943093653755…94758561351324416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.385 × 10⁹⁷(98-digit number)
83850731886187307510…89517122702648832001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,742,633 XPM·at block #6,812,326 · 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