Block #2,640,661

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 2:03:27 AM · Difficulty 11.5904 · 4,200,846 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4986bbb53bde9e288dea3dd62bae0eb9bb79de08d632c4c4c4fb3974209b0bd9

Height

#2,640,661

Difficulty

11.590421

Transactions

3

Size

654 B

Version

2

Bits

0b9725d5

Nonce

362,425,990

Timestamp

5/1/2018, 2:03:27 AM

Confirmations

4,200,846

Merkle Root

b67c4d329e9ffb3601aa2a0496442cd4f4e6d31e2be484bc1d400965a6d8fe44
Transactions (3)
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.

3.375 × 10⁹⁷(98-digit number)
33751939858940059163…80993051524976680961
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
3.375 × 10⁹⁷(98-digit number)
33751939858940059163…80993051524976680961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.750 × 10⁹⁷(98-digit number)
67503879717880118327…61986103049953361921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.350 × 10⁹⁸(99-digit number)
13500775943576023665…23972206099906723841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.700 × 10⁹⁸(99-digit number)
27001551887152047330…47944412199813447681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.400 × 10⁹⁸(99-digit number)
54003103774304094661…95888824399626895361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.080 × 10⁹⁹(100-digit number)
10800620754860818932…91777648799253790721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.160 × 10⁹⁹(100-digit number)
21601241509721637864…83555297598507581441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.320 × 10⁹⁹(100-digit number)
43202483019443275729…67110595197015162881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.640 × 10⁹⁹(100-digit number)
86404966038886551458…34221190394030325761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.728 × 10¹⁰⁰(101-digit number)
17280993207777310291…68442380788060651521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.456 × 10¹⁰⁰(101-digit number)
34561986415554620583…36884761576121303041
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,976,435 XPM·at block #6,841,506 · 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