Block #2,288,870

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/9/2017, 6:12:56 AM · Difficulty 10.9555 · 4,550,629 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5ab0faf428f879a5c32fff9160cf53a4fc334baa43a95f80ae1d88f0f20ca6d1

Height

#2,288,870

Difficulty

10.955549

Transactions

2

Size

425 B

Version

2

Bits

0af49ee3

Nonce

250,612,984

Timestamp

9/9/2017, 6:12:56 AM

Confirmations

4,550,629

Merkle Root

50f37449b88dc50cc978ebdb917c3583715c5182b63aacaf7cd07afe267a6195
Transactions (2)
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.015 × 10⁹⁴(95-digit number)
30155056603411149814…83927026359466803201
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.015 × 10⁹⁴(95-digit number)
30155056603411149814…83927026359466803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.031 × 10⁹⁴(95-digit number)
60310113206822299628…67854052718933606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.206 × 10⁹⁵(96-digit number)
12062022641364459925…35708105437867212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.412 × 10⁹⁵(96-digit number)
24124045282728919851…71416210875734425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.824 × 10⁹⁵(96-digit number)
48248090565457839702…42832421751468851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.649 × 10⁹⁵(96-digit number)
96496181130915679405…85664843502937702401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.929 × 10⁹⁶(97-digit number)
19299236226183135881…71329687005875404801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.859 × 10⁹⁶(97-digit number)
38598472452366271762…42659374011750809601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.719 × 10⁹⁶(97-digit number)
77196944904732543524…85318748023501619201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.543 × 10⁹⁷(98-digit number)
15439388980946508704…70637496047003238401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.087 × 10⁹⁷(98-digit number)
30878777961893017409…41274992094006476801
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,960,289 XPM·at block #6,839,498 · 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