Block #2,631,413

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/27/2018, 2:57:03 AM · Difficulty 11.1730 · 4,210,501 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
40bde20f81abef79cc2ed596ee1a9c7c6fcb52e1e852c04497b7f1995e004d2b

Height

#2,631,413

Difficulty

11.172985

Transactions

51

Size

15.07 KB

Version

2

Bits

0b2c48c7

Nonce

829,732,415

Timestamp

4/27/2018, 2:57:03 AM

Confirmations

4,210,501

Merkle Root

8aaa177bc918faeba4607bedc6396efc69e711b1a4efa04b84193fa1cf6cbbf8
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.158 × 10⁹⁴(95-digit number)
21581949347104735142…80251174168295296241
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.158 × 10⁹⁴(95-digit number)
21581949347104735142…80251174168295296241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.316 × 10⁹⁴(95-digit number)
43163898694209470284…60502348336590592481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.632 × 10⁹⁴(95-digit number)
86327797388418940568…21004696673181184961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.726 × 10⁹⁵(96-digit number)
17265559477683788113…42009393346362369921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.453 × 10⁹⁵(96-digit number)
34531118955367576227…84018786692724739841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.906 × 10⁹⁵(96-digit number)
69062237910735152454…68037573385449479681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.381 × 10⁹⁶(97-digit number)
13812447582147030490…36075146770898959361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.762 × 10⁹⁶(97-digit number)
27624895164294060981…72150293541797918721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.524 × 10⁹⁶(97-digit number)
55249790328588121963…44300587083595837441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.104 × 10⁹⁷(98-digit number)
11049958065717624392…88601174167191674881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.209 × 10⁹⁷(98-digit number)
22099916131435248785…77202348334383349761
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,979,687 XPM·at block #6,841,913 · 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