Block #2,643,726

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 5:26:38 AM · Difficulty 11.6912 · 4,198,664 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
60240fe4fb019efd6f5c23aa2006f2340f2d361b704670c559e18e08520b4bad

Height

#2,643,726

Difficulty

11.691212

Transactions

38

Size

13.09 KB

Version

2

Bits

0bb0f341

Nonce

31,577,214

Timestamp

5/2/2018, 5:26:38 AM

Confirmations

4,198,664

Merkle Root

5acca87b289fe993f813a2b2aa5bc96f62eae1f9c7ff6155fdc3bf28395927ab
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.

7.715 × 10⁹⁴(95-digit number)
77150722928953846358…69765761179312128001
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
7.715 × 10⁹⁴(95-digit number)
77150722928953846358…69765761179312128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.543 × 10⁹⁵(96-digit number)
15430144585790769271…39531522358624256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.086 × 10⁹⁵(96-digit number)
30860289171581538543…79063044717248512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.172 × 10⁹⁵(96-digit number)
61720578343163077086…58126089434497024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.234 × 10⁹⁶(97-digit number)
12344115668632615417…16252178868994048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.468 × 10⁹⁶(97-digit number)
24688231337265230834…32504357737988096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.937 × 10⁹⁶(97-digit number)
49376462674530461669…65008715475976192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.875 × 10⁹⁶(97-digit number)
98752925349060923338…30017430951952384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.975 × 10⁹⁷(98-digit number)
19750585069812184667…60034861903904768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.950 × 10⁹⁷(98-digit number)
39501170139624369335…20069723807809536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.900 × 10⁹⁷(98-digit number)
79002340279248738670…40139447615619072001
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,983,530 XPM·at block #6,842,389 · 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