Block #1,852,068

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2016, 7:57:14 PM · Difficulty 10.6328 · 4,963,013 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d2fa124bd252bb98158912cf464075fc6efba67edaf6cfbe72f1cc0b4cab2d05

Height

#1,852,068

Difficulty

10.632759

Transactions

2

Size

2.30 KB

Version

2

Bits

0aa1fc81

Nonce

116,944,412

Timestamp

11/16/2016, 7:57:14 PM

Confirmations

4,963,013

Merkle Root

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

9.261 × 10⁹⁵(96-digit number)
92613373910189117499…42320076918022553601
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
9.261 × 10⁹⁵(96-digit number)
92613373910189117499…42320076918022553601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.852 × 10⁹⁶(97-digit number)
18522674782037823499…84640153836045107201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.704 × 10⁹⁶(97-digit number)
37045349564075646999…69280307672090214401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.409 × 10⁹⁶(97-digit number)
74090699128151293999…38560615344180428801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.481 × 10⁹⁷(98-digit number)
14818139825630258799…77121230688360857601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.963 × 10⁹⁷(98-digit number)
29636279651260517599…54242461376721715201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.927 × 10⁹⁷(98-digit number)
59272559302521035199…08484922753443430401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.185 × 10⁹⁸(99-digit number)
11854511860504207039…16969845506886860801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.370 × 10⁹⁸(99-digit number)
23709023721008414079…33939691013773721601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.741 × 10⁹⁸(99-digit number)
47418047442016828159…67879382027547443201
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,764,734 XPM·at block #6,815,080 · 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