Block #2,647,918

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2018, 4:44:44 AM · Difficulty 11.7641 · 4,183,598 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a04eb9d22b00b804e3caea1e78e187c366e6c47dfacc388766ce0457675a5d09

Height

#2,647,918

Difficulty

11.764088

Transactions

53

Size

16.17 KB

Version

2

Bits

0bc39b44

Nonce

696,509,944

Timestamp

5/4/2018, 4:44:44 AM

Confirmations

4,183,598

Merkle Root

f23370c478854f19fa55974fbfeffe14b4e475e1ddc61d5628568df1619ff9a3
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.556 × 10⁹⁵(96-digit number)
35569585279353902849…98137274845807594241
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.556 × 10⁹⁵(96-digit number)
35569585279353902849…98137274845807594241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.113 × 10⁹⁵(96-digit number)
71139170558707805698…96274549691615188481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.422 × 10⁹⁶(97-digit number)
14227834111741561139…92549099383230376961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.845 × 10⁹⁶(97-digit number)
28455668223483122279…85098198766460753921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.691 × 10⁹⁶(97-digit number)
56911336446966244558…70196397532921507841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.138 × 10⁹⁷(98-digit number)
11382267289393248911…40392795065843015681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.276 × 10⁹⁷(98-digit number)
22764534578786497823…80785590131686031361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.552 × 10⁹⁷(98-digit number)
45529069157572995646…61571180263372062721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.105 × 10⁹⁷(98-digit number)
91058138315145991293…23142360526744125441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.821 × 10⁹⁸(99-digit number)
18211627663029198258…46284721053488250881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.642 × 10⁹⁸(99-digit number)
36423255326058396517…92569442106976501761
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,896,217 XPM·at block #6,831,515 · 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