Block #2,633,384

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 10:13:20 AM · Difficulty 11.1882 · 4,211,781 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3cb00faad35fe5c480c1c349b25f50e6a98100afa071c8de0ea3a33806cff25a

Height

#2,633,384

Difficulty

11.188249

Transactions

10

Size

3.33 KB

Version

2

Bits

0b30310e

Nonce

101,567,087

Timestamp

4/28/2018, 10:13:20 AM

Confirmations

4,211,781

Merkle Root

445f5b5565b2a2857177d15046e36cbd81daa6a64ca4edfeec072adf02d9e4ca
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.811 × 10⁹⁵(96-digit number)
18110248409244245618…67657547465487482879
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.811 × 10⁹⁵(96-digit number)
18110248409244245618…67657547465487482879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.622 × 10⁹⁵(96-digit number)
36220496818488491236…35315094930974965759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.244 × 10⁹⁵(96-digit number)
72440993636976982473…70630189861949931519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.448 × 10⁹⁶(97-digit number)
14488198727395396494…41260379723899863039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.897 × 10⁹⁶(97-digit number)
28976397454790792989…82520759447799726079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.795 × 10⁹⁶(97-digit number)
57952794909581585978…65041518895599452159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.159 × 10⁹⁷(98-digit number)
11590558981916317195…30083037791198904319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.318 × 10⁹⁷(98-digit number)
23181117963832634391…60166075582397808639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.636 × 10⁹⁷(98-digit number)
46362235927665268782…20332151164795617279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.272 × 10⁹⁷(98-digit number)
92724471855330537565…40664302329591234559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.854 × 10⁹⁸(99-digit number)
18544894371066107513…81328604659182469119
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:58,005,750 XPM·at block #6,845,164 · 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