Block #2,640,082

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2018, 9:13:55 PM · Difficulty 11.5662 · 4,196,410 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dff317c0659cd0e56bef1d4f1046193ef24e40557a00250a150ba1607c09b101

Height

#2,640,082

Difficulty

11.566161

Transactions

11

Size

3.27 KB

Version

2

Bits

0b90efe5

Nonce

23,463,032

Timestamp

4/30/2018, 9:13:55 PM

Confirmations

4,196,410

Merkle Root

c492675e37aad7a0246a47d390cdf27dcb06383f8b5047c976c0df8e69b1d518
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.784 × 10⁹⁴(95-digit number)
77846264423416277103…63095115237918326081
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.784 × 10⁹⁴(95-digit number)
77846264423416277103…63095115237918326081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.556 × 10⁹⁵(96-digit number)
15569252884683255420…26190230475836652161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.113 × 10⁹⁵(96-digit number)
31138505769366510841…52380460951673304321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.227 × 10⁹⁵(96-digit number)
62277011538733021682…04760921903346608641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.245 × 10⁹⁶(97-digit number)
12455402307746604336…09521843806693217281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.491 × 10⁹⁶(97-digit number)
24910804615493208673…19043687613386434561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.982 × 10⁹⁶(97-digit number)
49821609230986417346…38087375226772869121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.964 × 10⁹⁶(97-digit number)
99643218461972834692…76174750453545738241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.992 × 10⁹⁷(98-digit number)
19928643692394566938…52349500907091476481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.985 × 10⁹⁷(98-digit number)
39857287384789133876…04699001814182952961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.971 × 10⁹⁷(98-digit number)
79714574769578267753…09398003628365905921
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,936,209 XPM·at block #6,836,491 · 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