Block #2,284,315

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/6/2017, 3:05:06 AM · Difficulty 10.9550 · 4,540,640 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4768ee51dd47074039fb97919e9041cf4aaf4c565b3b54640d0146909b325f78

Height

#2,284,315

Difficulty

10.955023

Transactions

13

Size

4.83 KB

Version

2

Bits

0af47c5f

Nonce

1,354,116,313

Timestamp

9/6/2017, 3:05:06 AM

Confirmations

4,540,640

Merkle Root

f18d72fe6707c5731566d306269d837262589706646379e5acc2e13508cb72ed
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.

7.314 × 10⁹⁵(96-digit number)
73146662896854053667…57082709927282365441
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
7.314 × 10⁹⁵(96-digit number)
73146662896854053667…57082709927282365441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.462 × 10⁹⁶(97-digit number)
14629332579370810733…14165419854564730881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.925 × 10⁹⁶(97-digit number)
29258665158741621466…28330839709129461761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.851 × 10⁹⁶(97-digit number)
58517330317483242933…56661679418258923521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.170 × 10⁹⁷(98-digit number)
11703466063496648586…13323358836517847041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.340 × 10⁹⁷(98-digit number)
23406932126993297173…26646717673035694081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.681 × 10⁹⁷(98-digit number)
46813864253986594347…53293435346071388161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.362 × 10⁹⁷(98-digit number)
93627728507973188694…06586870692142776321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.872 × 10⁹⁸(99-digit number)
18725545701594637738…13173741384285552641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.745 × 10⁹⁸(99-digit number)
37451091403189275477…26347482768571105281
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,843,719 XPM·at block #6,824,954 · 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