Block #248,828

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/7/2013, 2:49:01 PM · Difficulty 9.9662 · 6,584,763 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
974b843bec155c15fab64f7d7a9fc505e57d0d52c2adeb8181b7eeb5ee694660

Height

#248,828

Difficulty

9.966176

Transactions

1

Size

1.64 KB

Version

2

Bits

09f75754

Nonce

13,008

Timestamp

11/7/2013, 2:49:01 PM

Confirmations

6,584,763

Merkle Root

ef2410df3ba82e007332a0138560751ea76bf05c485a48376152e338f8c52551
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.

6.662 × 10⁹⁸(99-digit number)
66621177283532710904…52485317676668552321
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
6.662 × 10⁹⁸(99-digit number)
66621177283532710904…52485317676668552321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.332 × 10⁹⁹(100-digit number)
13324235456706542180…04970635353337104641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.664 × 10⁹⁹(100-digit number)
26648470913413084361…09941270706674209281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.329 × 10⁹⁹(100-digit number)
53296941826826168723…19882541413348418561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.065 × 10¹⁰⁰(101-digit number)
10659388365365233744…39765082826696837121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.131 × 10¹⁰⁰(101-digit number)
21318776730730467489…79530165653393674241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.263 × 10¹⁰⁰(101-digit number)
42637553461460934978…59060331306787348481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.527 × 10¹⁰⁰(101-digit number)
85275106922921869957…18120662613574696961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.705 × 10¹⁰¹(102-digit number)
17055021384584373991…36241325227149393921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.411 × 10¹⁰¹(102-digit number)
34110042769168747982…72482650454298787841
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,912,935 XPM·at block #6,833,590 · 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