Block #2,636,505

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2018, 2:55:52 PM · Difficulty 11.3849 · 4,203,493 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a0304fbe3b2882c19b1d2b06097c1aa74e32d8bdde2c7921e20ab63331fd2afd

Height

#2,636,505

Difficulty

11.384922

Transactions

2

Size

1.14 KB

Version

2

Bits

0b628a46

Nonce

73,073,893

Timestamp

4/29/2018, 2:55:52 PM

Confirmations

4,203,493

Merkle Root

6e3d3a2893f6704f35371d260044f9478693ead7484b0855336a3d9de28e0ab5
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.

7.016 × 10⁹⁵(96-digit number)
70169912586116891085…89209319076610974721
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.016 × 10⁹⁵(96-digit number)
70169912586116891085…89209319076610974721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.403 × 10⁹⁶(97-digit number)
14033982517223378217…78418638153221949441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.806 × 10⁹⁶(97-digit number)
28067965034446756434…56837276306443898881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.613 × 10⁹⁶(97-digit number)
56135930068893512868…13674552612887797761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.122 × 10⁹⁷(98-digit number)
11227186013778702573…27349105225775595521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.245 × 10⁹⁷(98-digit number)
22454372027557405147…54698210451551191041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.490 × 10⁹⁷(98-digit number)
44908744055114810294…09396420903102382081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.981 × 10⁹⁷(98-digit number)
89817488110229620589…18792841806204764161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.796 × 10⁹⁸(99-digit number)
17963497622045924117…37585683612409528321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.592 × 10⁹⁸(99-digit number)
35926995244091848235…75171367224819056641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.185 × 10⁹⁸(99-digit number)
71853990488183696471…50342734449638113281
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,964,294 XPM·at block #6,839,997 · 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