Block #2,654,136

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2018, 12:35:40 AM · Difficulty 11.7275 · 4,177,502 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
39717bb9bab46b9a1ec61b24230e02eafec116d3c51286921342b46bf3a25f01

Height

#2,654,136

Difficulty

11.727480

Transactions

3

Size

1.07 KB

Version

2

Bits

0bba3c22

Nonce

861,745,644

Timestamp

5/9/2018, 12:35:40 AM

Confirmations

4,177,502

Merkle Root

98cc24cb2858af790b1ebfbafbf9f5065952f89e8f1d1cf21d6213c439411fba
Transactions (3)
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.

1.181 × 10⁹⁴(95-digit number)
11814439159024364444…31058419719276844801
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
1.181 × 10⁹⁴(95-digit number)
11814439159024364444…31058419719276844801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.362 × 10⁹⁴(95-digit number)
23628878318048728889…62116839438553689601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.725 × 10⁹⁴(95-digit number)
47257756636097457779…24233678877107379201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.451 × 10⁹⁴(95-digit number)
94515513272194915558…48467357754214758401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.890 × 10⁹⁵(96-digit number)
18903102654438983111…96934715508429516801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.780 × 10⁹⁵(96-digit number)
37806205308877966223…93869431016859033601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.561 × 10⁹⁵(96-digit number)
75612410617755932446…87738862033718067201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.512 × 10⁹⁶(97-digit number)
15122482123551186489…75477724067436134401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.024 × 10⁹⁶(97-digit number)
30244964247102372978…50955448134872268801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.048 × 10⁹⁶(97-digit number)
60489928494204745957…01910896269744537601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.209 × 10⁹⁷(98-digit number)
12097985698840949191…03821792539489075201
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,897,208 XPM·at block #6,831,637 · 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