Block #2,639,796

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2018, 6:56:12 PM · Difficulty 11.5532 · 4,191,323 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
be5c8296df85f8ef2271d2d2d4ec1e1f60a2554d8fc5354b9155d9168a90dce6

Height

#2,639,796

Difficulty

11.553207

Transactions

3

Size

1.39 KB

Version

2

Bits

0b8d9ef8

Nonce

972,906,183

Timestamp

4/30/2018, 6:56:12 PM

Confirmations

4,191,323

Merkle Root

227c3b4b43a067149698eb99cafaa8156e37f76111aa9185800c54b24e8083ad
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.

2.148 × 10⁹⁶(97-digit number)
21487267740877745750…35668334814945712641
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
2.148 × 10⁹⁶(97-digit number)
21487267740877745750…35668334814945712641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.297 × 10⁹⁶(97-digit number)
42974535481755491501…71336669629891425281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.594 × 10⁹⁶(97-digit number)
85949070963510983002…42673339259782850561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.718 × 10⁹⁷(98-digit number)
17189814192702196600…85346678519565701121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.437 × 10⁹⁷(98-digit number)
34379628385404393201…70693357039131402241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.875 × 10⁹⁷(98-digit number)
68759256770808786402…41386714078262804481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.375 × 10⁹⁸(99-digit number)
13751851354161757280…82773428156525608961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.750 × 10⁹⁸(99-digit number)
27503702708323514560…65546856313051217921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.500 × 10⁹⁸(99-digit number)
55007405416647029121…31093712626102435841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.100 × 10⁹⁹(100-digit number)
11001481083329405824…62187425252204871681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.200 × 10⁹⁹(100-digit number)
22002962166658811648…24374850504409743361
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,893,098 XPM·at block #6,831,118 · 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