Block #2,608,144

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2018, 2:53:01 PM · Difficulty 11.2495 · 4,233,850 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6536939fe8a5da58f8f4cc10c0177222fabab6e0bbf02f895b34e9de311a85a9

Height

#2,608,144

Difficulty

11.249521

Transactions

41

Size

10.86 KB

Version

2

Bits

0b3fe0a4

Nonce

549,346,942

Timestamp

4/10/2018, 2:53:01 PM

Confirmations

4,233,850

Merkle Root

d3a47048fe45e67503cc87d11f89a26bdd07761000bbdb826ecce80467257035
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.

8.819 × 10⁹¹(92-digit number)
88196937246185441692…94938492114886012501
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
8.819 × 10⁹¹(92-digit number)
88196937246185441692…94938492114886012501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.763 × 10⁹²(93-digit number)
17639387449237088338…89876984229772025001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.527 × 10⁹²(93-digit number)
35278774898474176677…79753968459544050001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.055 × 10⁹²(93-digit number)
70557549796948353354…59507936919088100001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.411 × 10⁹³(94-digit number)
14111509959389670670…19015873838176200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.822 × 10⁹³(94-digit number)
28223019918779341341…38031747676352400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.644 × 10⁹³(94-digit number)
56446039837558682683…76063495352704800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.128 × 10⁹⁴(95-digit number)
11289207967511736536…52126990705409600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.257 × 10⁹⁴(95-digit number)
22578415935023473073…04253981410819200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.515 × 10⁹⁴(95-digit number)
45156831870046946146…08507962821638400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.031 × 10⁹⁴(95-digit number)
90313663740093892293…17015925643276800001
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,980,340 XPM·at block #6,841,993 · 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