Block #2,641,334

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 7:45:40 AM · Difficulty 11.6164 · 4,189,293 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5ffbd86ed4feb02e00115dab951b81f439b19a9ef569ab598f8fc46babae6238

Height

#2,641,334

Difficulty

11.616414

Transactions

4

Size

842 B

Version

2

Bits

0b9dcd49

Nonce

618,918,638

Timestamp

5/1/2018, 7:45:40 AM

Confirmations

4,189,293

Merkle Root

671980889bf9503ed38bb844f5904ae7a2b410b051628aed03c5ac5f92bd30d9
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.205 × 10⁹³(94-digit number)
72050851750831757178…01986853971978950401
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.205 × 10⁹³(94-digit number)
72050851750831757178…01986853971978950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.441 × 10⁹⁴(95-digit number)
14410170350166351435…03973707943957900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.882 × 10⁹⁴(95-digit number)
28820340700332702871…07947415887915801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.764 × 10⁹⁴(95-digit number)
57640681400665405742…15894831775831603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.152 × 10⁹⁵(96-digit number)
11528136280133081148…31789663551663206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.305 × 10⁹⁵(96-digit number)
23056272560266162297…63579327103326412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.611 × 10⁹⁵(96-digit number)
46112545120532324594…27158654206652825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.222 × 10⁹⁵(96-digit number)
92225090241064649188…54317308413305651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.844 × 10⁹⁶(97-digit number)
18445018048212929837…08634616826611302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.689 × 10⁹⁶(97-digit number)
36890036096425859675…17269233653222604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.378 × 10⁹⁶(97-digit number)
73780072192851719350…34538467306445209601
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,889,137 XPM·at block #6,830,626 · 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