Block #362,983

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 2:29:46 AM · Difficulty 10.4145 · 6,478,931 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8c19cff8f2c34eb768bbb3a834de313d5071fba7ca333b554dae5c6409fb0b0c

Height

#362,983

Difficulty

10.414508

Transactions

7

Size

6.12 KB

Version

2

Bits

0a6a1d2c

Nonce

19,150

Timestamp

1/17/2014, 2:29:46 AM

Confirmations

6,478,931

Merkle Root

080458fa06a4de1845fe23ad119e251fb6485b654ba4b33e3e3dff4619520e9f
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.

7.878 × 10¹¹⁰(111-digit number)
78780672259018832885…33456742585388236801
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
7.878 × 10¹¹⁰(111-digit number)
78780672259018832885…33456742585388236801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.575 × 10¹¹¹(112-digit number)
15756134451803766577…66913485170776473601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.151 × 10¹¹¹(112-digit number)
31512268903607533154…33826970341552947201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.302 × 10¹¹¹(112-digit number)
63024537807215066308…67653940683105894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.260 × 10¹¹²(113-digit number)
12604907561443013261…35307881366211788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.520 × 10¹¹²(113-digit number)
25209815122886026523…70615762732423577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.041 × 10¹¹²(113-digit number)
50419630245772053046…41231525464847155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.008 × 10¹¹³(114-digit number)
10083926049154410609…82463050929694310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.016 × 10¹¹³(114-digit number)
20167852098308821218…64926101859388620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.033 × 10¹¹³(114-digit number)
40335704196617642437…29852203718777241601
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,979,687 XPM·at block #6,841,913 · 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