Block #2,634,065

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2018, 6:06:54 PM · Difficulty 11.2210 · 4,204,625 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b93a3ebfc93550de4bad54459ee3ab1455c6bf9331bd9687077848d4dde3511b

Height

#2,634,065

Difficulty

11.221010

Transactions

6

Size

6.29 KB

Version

2

Bits

0b389417

Nonce

132,607,314

Timestamp

4/28/2018, 6:06:54 PM

Confirmations

4,204,625

Merkle Root

3d61dbee19308226f1afcd4a8f9615d3a2444bff2876213c7e3ddc5e8dea1c97
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.

2.147 × 10⁹⁵(96-digit number)
21477508120322537600…96315818018614274081
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
2.147 × 10⁹⁵(96-digit number)
21477508120322537600…96315818018614274081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.295 × 10⁹⁵(96-digit number)
42955016240645075200…92631636037228548161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.591 × 10⁹⁵(96-digit number)
85910032481290150400…85263272074457096321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.718 × 10⁹⁶(97-digit number)
17182006496258030080…70526544148914192641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.436 × 10⁹⁶(97-digit number)
34364012992516060160…41053088297828385281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.872 × 10⁹⁶(97-digit number)
68728025985032120320…82106176595656770561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.374 × 10⁹⁷(98-digit number)
13745605197006424064…64212353191313541121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.749 × 10⁹⁷(98-digit number)
27491210394012848128…28424706382627082241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.498 × 10⁹⁷(98-digit number)
54982420788025696256…56849412765254164481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.099 × 10⁹⁸(99-digit number)
10996484157605139251…13698825530508328961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.199 × 10⁹⁸(99-digit number)
21992968315210278502…27397651061016657921
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,953,783 XPM·at block #6,838,689 · 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