Block #2,236,941

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/4/2017, 5:48:50 PM · Difficulty 10.9463 · 4,605,388 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9b5b798c3eaef10db863ca26378b68328209c4677a7817337145946920306c01

Height

#2,236,941

Difficulty

10.946335

Transactions

6

Size

3.18 KB

Version

2

Bits

0af24302

Nonce

102,318,620

Timestamp

8/4/2017, 5:48:50 PM

Confirmations

4,605,388

Merkle Root

0d252c5bef05fb8a5444cb5fc84f1584dea78211d2a608f62c8197f8b244f4a8
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.

6.037 × 10⁹⁵(96-digit number)
60376036508685019091…48042751858762009601
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
6.037 × 10⁹⁵(96-digit number)
60376036508685019091…48042751858762009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.207 × 10⁹⁶(97-digit number)
12075207301737003818…96085503717524019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.415 × 10⁹⁶(97-digit number)
24150414603474007636…92171007435048038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.830 × 10⁹⁶(97-digit number)
48300829206948015273…84342014870096076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.660 × 10⁹⁶(97-digit number)
96601658413896030546…68684029740192153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.932 × 10⁹⁷(98-digit number)
19320331682779206109…37368059480384307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.864 × 10⁹⁷(98-digit number)
38640663365558412218…74736118960768614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.728 × 10⁹⁷(98-digit number)
77281326731116824437…49472237921537228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.545 × 10⁹⁸(99-digit number)
15456265346223364887…98944475843074457601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.091 × 10⁹⁸(99-digit number)
30912530692446729774…97888951686148915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.182 × 10⁹⁸(99-digit number)
61825061384893459549…95777903372297830401
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,983,040 XPM·at block #6,842,328 · 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