Block #2,652,340

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/7/2018, 12:45:24 PM · Difficulty 11.7459 · 4,185,976 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
952b64d69c7fbec6030bea79ff62e86d7b2d59925bbc3e11964eb8a03e451fdb

Height

#2,652,340

Difficulty

11.745887

Transactions

3

Size

1.07 KB

Version

2

Bits

0bbef26c

Nonce

911,776,465

Timestamp

5/7/2018, 12:45:24 PM

Confirmations

4,185,976

Merkle Root

6ec4175b4dde95ec7a5d67ec65e54af572f1648a381509ea7829e40ce307a2cc
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.445 × 10⁹⁴(95-digit number)
24455408117910187478…32705101107768102721
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.445 × 10⁹⁴(95-digit number)
24455408117910187478…32705101107768102721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.891 × 10⁹⁴(95-digit number)
48910816235820374957…65410202215536205441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.782 × 10⁹⁴(95-digit number)
97821632471640749914…30820404431072410881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.956 × 10⁹⁵(96-digit number)
19564326494328149982…61640808862144821761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.912 × 10⁹⁵(96-digit number)
39128652988656299965…23281617724289643521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.825 × 10⁹⁵(96-digit number)
78257305977312599931…46563235448579287041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.565 × 10⁹⁶(97-digit number)
15651461195462519986…93126470897158574081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.130 × 10⁹⁶(97-digit number)
31302922390925039972…86252941794317148161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.260 × 10⁹⁶(97-digit number)
62605844781850079945…72505883588634296321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.252 × 10⁹⁷(98-digit number)
12521168956370015989…45011767177268592641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.504 × 10⁹⁷(98-digit number)
25042337912740031978…90023534354537185281
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,950,804 XPM·at block #6,838,315 · 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