Block #2,051,488

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/3/2017, 1:08:58 PM · Difficulty 10.7154 · 4,785,029 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7c2b88499a1e9aa9486e9bdbdeb47d69ca555ca013ea59980946da3e552f7fdc

Height

#2,051,488

Difficulty

10.715424

Transactions

2

Size

12.56 KB

Version

2

Bits

0ab7260a

Nonce

444,691,083

Timestamp

4/3/2017, 1:08:58 PM

Confirmations

4,785,029

Merkle Root

eaefde441420d6018c7d230fdada2c707f83bf84a609b647216c201ccd8d4310
Transactions (2)
1 in → 1 out8.8300 XPM109 B
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.

4.533 × 10⁹⁵(96-digit number)
45335093573012177224…38570944143551760641
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
4.533 × 10⁹⁵(96-digit number)
45335093573012177224…38570944143551760641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.067 × 10⁹⁵(96-digit number)
90670187146024354449…77141888287103521281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.813 × 10⁹⁶(97-digit number)
18134037429204870889…54283776574207042561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.626 × 10⁹⁶(97-digit number)
36268074858409741779…08567553148414085121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.253 × 10⁹⁶(97-digit number)
72536149716819483559…17135106296828170241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.450 × 10⁹⁷(98-digit number)
14507229943363896711…34270212593656340481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.901 × 10⁹⁷(98-digit number)
29014459886727793423…68540425187312680961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.802 × 10⁹⁷(98-digit number)
58028919773455586847…37080850374625361921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.160 × 10⁹⁸(99-digit number)
11605783954691117369…74161700749250723841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.321 × 10⁹⁸(99-digit number)
23211567909382234739…48323401498501447681
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,936,413 XPM·at block #6,836,516 · 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