Block #2,645,771

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 1:38:39 AM · Difficulty 11.7383 · 4,187,142 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fc0f80564ffa4b12b7f5642edcdd4d80ab24f6c44c01327f050f23700da577bd

Height

#2,645,771

Difficulty

11.738301

Transactions

67

Size

20.86 KB

Version

2

Bits

0bbd0150

Nonce

276,408,884

Timestamp

5/3/2018, 1:38:39 AM

Confirmations

4,187,142

Merkle Root

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

1.967 × 10⁹⁴(95-digit number)
19673275173402214155…85687751306531151681
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
1.967 × 10⁹⁴(95-digit number)
19673275173402214155…85687751306531151681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.934 × 10⁹⁴(95-digit number)
39346550346804428310…71375502613062303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.869 × 10⁹⁴(95-digit number)
78693100693608856620…42751005226124606721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.573 × 10⁹⁵(96-digit number)
15738620138721771324…85502010452249213441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.147 × 10⁹⁵(96-digit number)
31477240277443542648…71004020904498426881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.295 × 10⁹⁵(96-digit number)
62954480554887085296…42008041808996853761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.259 × 10⁹⁶(97-digit number)
12590896110977417059…84016083617993707521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.518 × 10⁹⁶(97-digit number)
25181792221954834118…68032167235987415041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.036 × 10⁹⁶(97-digit number)
50363584443909668237…36064334471974830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.007 × 10⁹⁷(98-digit number)
10072716888781933647…72128668943949660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.014 × 10⁹⁷(98-digit number)
20145433777563867294…44257337887899320321
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,907,477 XPM·at block #6,832,912 · 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