Block #845,151

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2014, 4:08:53 PM · Difficulty 10.9726 · 5,996,114 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
38500142807da323bcdc8578ee8d47d1a962a606da0858e4c8ee4cd84fd9407a

Height

#845,151

Difficulty

10.972606

Transactions

3

Size

659 B

Version

2

Bits

0af8fcb5

Nonce

2,527,331,482

Timestamp

12/8/2014, 4:08:53 PM

Confirmations

5,996,114

Merkle Root

445b6ae19598ce6780ecf4f62e2a08f1bb786a48b700376ede96e6e98a0d7007
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.

6.246 × 10⁹³(94-digit number)
62468216393971494211…30933474608352579701
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
6.246 × 10⁹³(94-digit number)
62468216393971494211…30933474608352579701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.249 × 10⁹⁴(95-digit number)
12493643278794298842…61866949216705159401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.498 × 10⁹⁴(95-digit number)
24987286557588597684…23733898433410318801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.997 × 10⁹⁴(95-digit number)
49974573115177195369…47467796866820637601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.994 × 10⁹⁴(95-digit number)
99949146230354390738…94935593733641275201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.998 × 10⁹⁵(96-digit number)
19989829246070878147…89871187467282550401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.997 × 10⁹⁵(96-digit number)
39979658492141756295…79742374934565100801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.995 × 10⁹⁵(96-digit number)
79959316984283512590…59484749869130201601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.599 × 10⁹⁶(97-digit number)
15991863396856702518…18969499738260403201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.198 × 10⁹⁶(97-digit number)
31983726793713405036…37938999476520806401
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,974,485 XPM·at block #6,841,264 · 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