Block #2,663,478

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/16/2018, 9:49:58 AM · Difficulty 11.6480 · 4,177,658 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ef93abd8a955b27bb5f5d569eda30be1b0e8b41274ad1d57a40a8d540898b283

Height

#2,663,478

Difficulty

11.648010

Transactions

2

Size

572 B

Version

2

Bits

0ba5e3f4

Nonce

601,060,453

Timestamp

5/16/2018, 9:49:58 AM

Confirmations

4,177,658

Merkle Root

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

5.816 × 10⁹²(93-digit number)
58165157003143872378…20286783311738949241
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
5.816 × 10⁹²(93-digit number)
58165157003143872378…20286783311738949241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.163 × 10⁹³(94-digit number)
11633031400628774475…40573566623477898481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.326 × 10⁹³(94-digit number)
23266062801257548951…81147133246955796961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.653 × 10⁹³(94-digit number)
46532125602515097902…62294266493911593921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.306 × 10⁹³(94-digit number)
93064251205030195805…24588532987823187841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.861 × 10⁹⁴(95-digit number)
18612850241006039161…49177065975646375681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.722 × 10⁹⁴(95-digit number)
37225700482012078322…98354131951292751361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.445 × 10⁹⁴(95-digit number)
74451400964024156644…96708263902585502721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.489 × 10⁹⁵(96-digit number)
14890280192804831328…93416527805171005441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.978 × 10⁹⁵(96-digit number)
29780560385609662657…86833055610342010881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.956 × 10⁹⁵(96-digit number)
59561120771219325315…73666111220684021761
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,973,450 XPM·at block #6,841,135 · 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