Block #2,652,378

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/7/2018, 1:38:11 PM · Difficulty 11.7452 · 4,180,711 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dd69f1501654a70149703b77eaa23b618a004ec911ff051c1c143fdb98d0208d

Height

#2,652,378

Difficulty

11.745164

Transactions

4

Size

2.16 KB

Version

2

Bits

0bbec30a

Nonce

1,282,383,679

Timestamp

5/7/2018, 1:38:11 PM

Confirmations

4,180,711

Merkle Root

af2f26220093301b12065bf046ef17899393b370ff5810c71248d479c5d9e5e2
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.142 × 10⁹⁵(96-digit number)
11426350990679290310…89700444042458191361
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.142 × 10⁹⁵(96-digit number)
11426350990679290310…89700444042458191361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.285 × 10⁹⁵(96-digit number)
22852701981358580620…79400888084916382721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.570 × 10⁹⁵(96-digit number)
45705403962717161240…58801776169832765441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.141 × 10⁹⁵(96-digit number)
91410807925434322480…17603552339665530881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.828 × 10⁹⁶(97-digit number)
18282161585086864496…35207104679331061761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.656 × 10⁹⁶(97-digit number)
36564323170173728992…70414209358662123521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.312 × 10⁹⁶(97-digit number)
73128646340347457984…40828418717324247041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.462 × 10⁹⁷(98-digit number)
14625729268069491596…81656837434648494081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.925 × 10⁹⁷(98-digit number)
29251458536138983193…63313674869296988161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.850 × 10⁹⁷(98-digit number)
58502917072277966387…26627349738593976321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.170 × 10⁹⁸(99-digit number)
11700583414455593277…53254699477187952641
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,908,887 XPM·at block #6,833,088 · 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