Block #168,199

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/17/2013, 3:40:25 AM · Difficulty 9.8682 · 6,645,824 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a44dfbea6c788b5a32b4b17f6478ee3f9d1e3ec088cf0057ca4af2310af52254

Height

#168,199

Difficulty

9.868178

Transactions

4

Size

1.43 KB

Version

2

Bits

09de40e6

Nonce

61,666

Timestamp

9/17/2013, 3:40:25 AM

Confirmations

6,645,824

Merkle Root

32e64b236002ac50c68b8f6eb4fb4c5597681260cd8146817a779a12da6baa4d
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.617 × 10⁹¹(92-digit number)
96178292595436236404…61986209138708625601
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.617 × 10⁹¹(92-digit number)
96178292595436236404…61986209138708625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.923 × 10⁹²(93-digit number)
19235658519087247280…23972418277417251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.847 × 10⁹²(93-digit number)
38471317038174494561…47944836554834502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.694 × 10⁹²(93-digit number)
76942634076348989123…95889673109669004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.538 × 10⁹³(94-digit number)
15388526815269797824…91779346219338009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.077 × 10⁹³(94-digit number)
30777053630539595649…83558692438676019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.155 × 10⁹³(94-digit number)
61554107261079191299…67117384877352038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.231 × 10⁹⁴(95-digit number)
12310821452215838259…34234769754704076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.462 × 10⁹⁴(95-digit number)
24621642904431676519…68469539509408153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.924 × 10⁹⁴(95-digit number)
49243285808863353039…36939079018816307201
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,756,265 XPM·at block #6,814,022 · 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