Block #247,990

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/7/2013, 2:50:19 AM · Difficulty 9.9653 · 6,559,352 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
67fc33ce34c8c42d85cd3fd55149afc5307c798f6457450525dd48a22187ca9b

Height

#247,990

Difficulty

9.965339

Transactions

4

Size

1.73 KB

Version

2

Bits

09f72078

Nonce

133,195

Timestamp

11/7/2013, 2:50:19 AM

Confirmations

6,559,352

Merkle Root

4be0a45669a2510006c6d682d70da28a228c69109c8f7d1dfc353d21dbff16b9
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.

9.022 × 10⁹⁸(99-digit number)
90229598858688390331…58810955563275964721
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
9.022 × 10⁹⁸(99-digit number)
90229598858688390331…58810955563275964721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.804 × 10⁹⁹(100-digit number)
18045919771737678066…17621911126551929441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.609 × 10⁹⁹(100-digit number)
36091839543475356132…35243822253103858881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.218 × 10⁹⁹(100-digit number)
72183679086950712264…70487644506207717761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.443 × 10¹⁰⁰(101-digit number)
14436735817390142452…40975289012415435521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.887 × 10¹⁰⁰(101-digit number)
28873471634780284905…81950578024830871041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.774 × 10¹⁰⁰(101-digit number)
57746943269560569811…63901156049661742081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.154 × 10¹⁰¹(102-digit number)
11549388653912113962…27802312099323484161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.309 × 10¹⁰¹(102-digit number)
23098777307824227924…55604624198646968321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.619 × 10¹⁰¹(102-digit number)
46197554615648455849…11209248397293936641
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,702,755 XPM·at block #6,807,341 · 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