Block #2,712,352

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/19/2018, 7:47:27 PM · Difficulty 11.5990 · 4,132,693 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e69461aabedf7dca5f446bb8aa5a155dd78882f9f479b9580ac1531e391be209

Height

#2,712,352

Difficulty

11.599011

Transactions

8

Size

2.92 KB

Version

2

Bits

0b9958cd

Nonce

84,076,946

Timestamp

6/19/2018, 7:47:27 PM

Confirmations

4,132,693

Merkle Root

b6ac2faf0896ca88c813daf7b72801208ef1eca15d271e380e7c8e08b7665d53
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.657 × 10⁹³(94-digit number)
26571263989838205575…11283023844589523841
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.657 × 10⁹³(94-digit number)
26571263989838205575…11283023844589523841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.314 × 10⁹³(94-digit number)
53142527979676411150…22566047689179047681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.062 × 10⁹⁴(95-digit number)
10628505595935282230…45132095378358095361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.125 × 10⁹⁴(95-digit number)
21257011191870564460…90264190756716190721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.251 × 10⁹⁴(95-digit number)
42514022383741128920…80528381513432381441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.502 × 10⁹⁴(95-digit number)
85028044767482257840…61056763026864762881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.700 × 10⁹⁵(96-digit number)
17005608953496451568…22113526053729525761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.401 × 10⁹⁵(96-digit number)
34011217906992903136…44227052107459051521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.802 × 10⁹⁵(96-digit number)
68022435813985806272…88454104214918103041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.360 × 10⁹⁶(97-digit number)
13604487162797161254…76908208429836206081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.720 × 10⁹⁶(97-digit number)
27208974325594322508…53816416859672412161
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,004,783 XPM·at block #6,845,044 · 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