Block #2,644,630

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 2:06:33 PM · Difficulty 11.7139 · 4,196,132 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0060091ca6311b32eea90f891d9fc50b8bcc19273582f9b28dea3d0809a43880

Height

#2,644,630

Difficulty

11.713858

Transactions

5

Size

1.51 KB

Version

2

Bits

0bb6bf65

Nonce

363,332,174

Timestamp

5/2/2018, 2:06:33 PM

Confirmations

4,196,132

Merkle Root

77bdfc0859b50044e416c232cf68a58ab98e3501bc0419c2e7cf821b57ecd22c
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.233 × 10⁹⁴(95-digit number)
72339778322245740470…01514714165045801281
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.233 × 10⁹⁴(95-digit number)
72339778322245740470…01514714165045801281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.446 × 10⁹⁵(96-digit number)
14467955664449148094…03029428330091602561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.893 × 10⁹⁵(96-digit number)
28935911328898296188…06058856660183205121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.787 × 10⁹⁵(96-digit number)
57871822657796592376…12117713320366410241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.157 × 10⁹⁶(97-digit number)
11574364531559318475…24235426640732820481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.314 × 10⁹⁶(97-digit number)
23148729063118636950…48470853281465640961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.629 × 10⁹⁶(97-digit number)
46297458126237273900…96941706562931281921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.259 × 10⁹⁶(97-digit number)
92594916252474547801…93883413125862563841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.851 × 10⁹⁷(98-digit number)
18518983250494909560…87766826251725127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.703 × 10⁹⁷(98-digit number)
37037966500989819120…75533652503450255361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.407 × 10⁹⁷(98-digit number)
74075933001979638241…51067305006900510721
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,970,438 XPM·at block #6,840,761 · 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