Block #2,271,896

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2017, 1:16:56 PM · Difficulty 10.9540 · 4,572,841 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd5ba2bba9b320389c2c38ccb20b981c65ca98d54cdafe6045a7820f92dd4c6c

Height

#2,271,896

Difficulty

10.953992

Transactions

3

Size

1.51 KB

Version

2

Bits

0af438ce

Nonce

473,613,407

Timestamp

8/28/2017, 1:16:56 PM

Confirmations

4,572,841

Merkle Root

594fc3b37ac452ad3ac2dcddcc21397884791ea343f5c507fedde33870c0c0a3
Transactions (3)
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.753 × 10⁹³(94-digit number)
87530168406161821072…04465507303443366401
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.753 × 10⁹³(94-digit number)
87530168406161821072…04465507303443366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.750 × 10⁹⁴(95-digit number)
17506033681232364214…08931014606886732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.501 × 10⁹⁴(95-digit number)
35012067362464728428…17862029213773465601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.002 × 10⁹⁴(95-digit number)
70024134724929456857…35724058427546931201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.400 × 10⁹⁵(96-digit number)
14004826944985891371…71448116855093862401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.800 × 10⁹⁵(96-digit number)
28009653889971782743…42896233710187724801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.601 × 10⁹⁵(96-digit number)
56019307779943565486…85792467420375449601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.120 × 10⁹⁶(97-digit number)
11203861555988713097…71584934840750899201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.240 × 10⁹⁶(97-digit number)
22407723111977426194…43169869681501798401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.481 × 10⁹⁶(97-digit number)
44815446223954852388…86339739363003596801
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:58,002,307 XPM·at block #6,844,736 · 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