Block #2,645,855

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/3/2018, 2:27:56 AM · Difficulty 11.7401 · 4,188,089 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b22cfc3fa5083efdaece9a56e97c51e5b8e1d7835f451f1ae17115219f268de7

Height

#2,645,855

Difficulty

11.740118

Transactions

5

Size

1.04 KB

Version

2

Bits

0bbd7867

Nonce

1,104,192,631

Timestamp

5/3/2018, 2:27:56 AM

Confirmations

4,188,089

Merkle Root

cf521c05427df5efa3646850b9af4258644d9ab341f4a5b471eb14d4a60fb33c
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.

5.824 × 10⁹⁶(97-digit number)
58244687079102312795…46486249158555217919
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
5.824 × 10⁹⁶(97-digit number)
58244687079102312795…46486249158555217919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.164 × 10⁹⁷(98-digit number)
11648937415820462559…92972498317110435839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.329 × 10⁹⁷(98-digit number)
23297874831640925118…85944996634220871679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.659 × 10⁹⁷(98-digit number)
46595749663281850236…71889993268441743359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.319 × 10⁹⁷(98-digit number)
93191499326563700472…43779986536883486719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.863 × 10⁹⁸(99-digit number)
18638299865312740094…87559973073766973439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.727 × 10⁹⁸(99-digit number)
37276599730625480188…75119946147533946879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.455 × 10⁹⁸(99-digit number)
74553199461250960377…50239892295067893759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.491 × 10⁹⁹(100-digit number)
14910639892250192075…00479784590135787519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.982 × 10⁹⁹(100-digit number)
29821279784500384151…00959569180271575039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.964 × 10⁹⁹(100-digit number)
59642559569000768302…01919138360543150079
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:57,915,780 XPM·at block #6,833,943 · 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