Block #2,601,040

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/5/2018, 7:17:04 AM · Difficulty 11.3268 · 4,241,983 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
38531836b2de62b9f94c8feba62794132fe4108d1c9537201b0f08bd62fa53f8

Height

#2,601,040

Difficulty

11.326755

Transactions

23

Size

5.70 KB

Version

2

Bits

0b53a63c

Nonce

352,090,146

Timestamp

4/5/2018, 7:17:04 AM

Confirmations

4,241,983

Merkle Root

75fa3113ac0c2a56197000b63e09f1d9527e3d893ec4e87f8b0c696e30b8a10f
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.269 × 10⁹⁴(95-digit number)
22698368478227861456…50262968456998103201
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.269 × 10⁹⁴(95-digit number)
22698368478227861456…50262968456998103201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.539 × 10⁹⁴(95-digit number)
45396736956455722913…00525936913996206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.079 × 10⁹⁴(95-digit number)
90793473912911445827…01051873827992412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.815 × 10⁹⁵(96-digit number)
18158694782582289165…02103747655984825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.631 × 10⁹⁵(96-digit number)
36317389565164578331…04207495311969651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.263 × 10⁹⁵(96-digit number)
72634779130329156662…08414990623939302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.452 × 10⁹⁶(97-digit number)
14526955826065831332…16829981247878604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.905 × 10⁹⁶(97-digit number)
29053911652131662664…33659962495757209601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.810 × 10⁹⁶(97-digit number)
58107823304263325329…67319924991514419201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.162 × 10⁹⁷(98-digit number)
11621564660852665065…34639849983028838401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.324 × 10⁹⁷(98-digit number)
23243129321705330131…69279699966057676801
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,988,537 XPM·at block #6,843,022 · 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