Block #2,716,965

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/22/2018, 9:21:34 PM · Difficulty 11.6147 · 4,126,032 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
30843864f6059241aae1d8d8f8620ab737f49ac61e3d758eeccceca807c99068

Height

#2,716,965

Difficulty

11.614660

Transactions

8

Size

3.06 KB

Version

2

Bits

0b9d5a56

Nonce

702,866,298

Timestamp

6/22/2018, 9:21:34 PM

Confirmations

4,126,032

Merkle Root

8512ce1fd55289b4d6ebe530199f9c4cf444c05e8bc8014e4f5c05d900b77f02
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.

1.377 × 10⁹⁵(96-digit number)
13775925857836001017…24724102920428198401
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
1.377 × 10⁹⁵(96-digit number)
13775925857836001017…24724102920428198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.755 × 10⁹⁵(96-digit number)
27551851715672002034…49448205840856396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.510 × 10⁹⁵(96-digit number)
55103703431344004068…98896411681712793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.102 × 10⁹⁶(97-digit number)
11020740686268800813…97792823363425587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.204 × 10⁹⁶(97-digit number)
22041481372537601627…95585646726851174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.408 × 10⁹⁶(97-digit number)
44082962745075203255…91171293453702348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.816 × 10⁹⁶(97-digit number)
88165925490150406510…82342586907404697601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.763 × 10⁹⁷(98-digit number)
17633185098030081302…64685173814809395201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.526 × 10⁹⁷(98-digit number)
35266370196060162604…29370347629618790401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.053 × 10⁹⁷(98-digit number)
70532740392120325208…58740695259237580801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.410 × 10⁹⁸(99-digit number)
14106548078424065041…17481390518475161601
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:57,988,331 XPM·at block #6,842,996 · 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