Block #2,292,708

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/11/2017, 11:52:38 PM · Difficulty 10.9548 · 4,550,574 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4de7208c08c49270b14ab24dd11568ab7f4c7c5391a1b9acd26ffe4d7295eaba

Height

#2,292,708

Difficulty

10.954763

Transactions

16

Size

7.01 KB

Version

2

Bits

0af46b60

Nonce

955,794,429

Timestamp

9/11/2017, 11:52:38 PM

Confirmations

4,550,574

Merkle Root

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

2.945 × 10⁹¹(92-digit number)
29454608506347602263…45668701327861754881
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
2.945 × 10⁹¹(92-digit number)
29454608506347602263…45668701327861754881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.890 × 10⁹¹(92-digit number)
58909217012695204526…91337402655723509761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.178 × 10⁹²(93-digit number)
11781843402539040905…82674805311447019521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.356 × 10⁹²(93-digit number)
23563686805078081810…65349610622894039041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.712 × 10⁹²(93-digit number)
47127373610156163621…30699221245788078081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.425 × 10⁹²(93-digit number)
94254747220312327242…61398442491576156161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.885 × 10⁹³(94-digit number)
18850949444062465448…22796884983152312321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.770 × 10⁹³(94-digit number)
37701898888124930897…45593769966304624641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.540 × 10⁹³(94-digit number)
75403797776249861794…91187539932609249281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.508 × 10⁹⁴(95-digit number)
15080759555249972358…82375079865218498561
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,990,628 XPM·at block #6,843,281 · 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