Block #2,833,182

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/10/2018, 2:07:36 PM · Difficulty 11.7145 · 4,000,028 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fef9301eb40a6b5a568cca98c3f7778cd46dca80db122b470fc5d3d22b49d9fd

Height

#2,833,182

Difficulty

11.714523

Transactions

14

Size

3.89 KB

Version

2

Bits

0bb6eafa

Nonce

696,518,954

Timestamp

9/10/2018, 2:07:36 PM

Confirmations

4,000,028

Merkle Root

0030865ab9b88c91bf9d5c6381282cdf1877d0ca46cdea6d9ae4021456910316
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.580 × 10⁹⁶(97-digit number)
15801820828787659747…50244976019567541761
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.580 × 10⁹⁶(97-digit number)
15801820828787659747…50244976019567541761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.160 × 10⁹⁶(97-digit number)
31603641657575319495…00489952039135083521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.320 × 10⁹⁶(97-digit number)
63207283315150638990…00979904078270167041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.264 × 10⁹⁷(98-digit number)
12641456663030127798…01959808156540334081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.528 × 10⁹⁷(98-digit number)
25282913326060255596…03919616313080668161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.056 × 10⁹⁷(98-digit number)
50565826652120511192…07839232626161336321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.011 × 10⁹⁸(99-digit number)
10113165330424102238…15678465252322672641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.022 × 10⁹⁸(99-digit number)
20226330660848204476…31356930504645345281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.045 × 10⁹⁸(99-digit number)
40452661321696408953…62713861009290690561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.090 × 10⁹⁸(99-digit number)
80905322643392817907…25427722018581381121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.618 × 10⁹⁹(100-digit number)
16181064528678563581…50855444037162762241
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,909,865 XPM·at block #6,833,209 · 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