Block #2,655,317

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/10/2018, 2:17:21 AM · Difficulty 11.7072 · 4,185,206 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
008b4dd76141ca81507f4bc8bca1c977c65b4b67161b9398885ae1f8f925fdb7

Height

#2,655,317

Difficulty

11.707240

Transactions

27

Size

8.39 KB

Version

2

Bits

0bb50da7

Nonce

688,928,388

Timestamp

5/10/2018, 2:17:21 AM

Confirmations

4,185,206

Merkle Root

4262a04f9cdd9d400b7398cc53fec3f6a2038c1945017e41eecd1e40369f8757
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.235 × 10⁹⁵(96-digit number)
32355554958947648395…46668590463958521601
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.235 × 10⁹⁵(96-digit number)
32355554958947648395…46668590463958521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.471 × 10⁹⁵(96-digit number)
64711109917895296791…93337180927917043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.294 × 10⁹⁶(97-digit number)
12942221983579059358…86674361855834086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.588 × 10⁹⁶(97-digit number)
25884443967158118716…73348723711668172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.176 × 10⁹⁶(97-digit number)
51768887934316237433…46697447423336345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.035 × 10⁹⁷(98-digit number)
10353777586863247486…93394894846672691201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.070 × 10⁹⁷(98-digit number)
20707555173726494973…86789789693345382401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.141 × 10⁹⁷(98-digit number)
41415110347452989946…73579579386690764801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.283 × 10⁹⁷(98-digit number)
82830220694905979893…47159158773381529601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.656 × 10⁹⁸(99-digit number)
16566044138981195978…94318317546763059201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.313 × 10⁹⁸(99-digit number)
33132088277962391957…88636635093526118401
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,968,513 XPM·at block #6,840,522 · 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