Block #248,665

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/7/2013, 12:35:50 PM · Difficulty 9.9660 · 6,588,794 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f7e42a32728c730e5d1c0a6e7c636a91870bd9365d32bf42f93ecbf25532f847

Height

#248,665

Difficulty

9.965967

Transactions

4

Size

2.70 KB

Version

2

Bits

09f7499d

Nonce

34,608

Timestamp

11/7/2013, 12:35:50 PM

Confirmations

6,588,794

Merkle Root

24d2a60c1627eb525d74c7790ac13e0a46a4d19c0f85ee350d3b9fae094c0ae1
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.723 × 10⁸⁹(90-digit number)
87239189319028843203…20251891162148630051
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.723 × 10⁸⁹(90-digit number)
87239189319028843203…20251891162148630051
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.744 × 10⁹⁰(91-digit number)
17447837863805768640…40503782324297260101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.489 × 10⁹⁰(91-digit number)
34895675727611537281…81007564648594520201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.979 × 10⁹⁰(91-digit number)
69791351455223074562…62015129297189040401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.395 × 10⁹¹(92-digit number)
13958270291044614912…24030258594378080801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.791 × 10⁹¹(92-digit number)
27916540582089229824…48060517188756161601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.583 × 10⁹¹(92-digit number)
55833081164178459649…96121034377512323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.116 × 10⁹²(93-digit number)
11166616232835691929…92242068755024646401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.233 × 10⁹²(93-digit number)
22333232465671383859…84484137510049292801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.466 × 10⁹²(93-digit number)
44666464931342767719…68968275020098585601
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,943,990 XPM·at block #6,837,458 · 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