Block #175,917

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/22/2013, 2:59:03 PM · Difficulty 9.8644 · 6,640,142 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7b18b0040ac7b4b6a17ee4e4ecba67c3e7925624060ccf7d496388d1c22487ed

Height

#175,917

Difficulty

9.864352

Transactions

5

Size

4.51 KB

Version

2

Bits

09dd4626

Nonce

152,806

Timestamp

9/22/2013, 2:59:03 PM

Confirmations

6,640,142

Merkle Root

1b39d733c986b8bc63f14b63c88e3eae30246ade130dc28fa41f11daca9d99e8
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.957 × 10⁹¹(92-digit number)
79570359432760799073…40498505377110992981
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.957 × 10⁹¹(92-digit number)
79570359432760799073…40498505377110992981
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.591 × 10⁹²(93-digit number)
15914071886552159814…80997010754221985961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.182 × 10⁹²(93-digit number)
31828143773104319629…61994021508443971921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.365 × 10⁹²(93-digit number)
63656287546208639258…23988043016887943841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.273 × 10⁹³(94-digit number)
12731257509241727851…47976086033775887681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.546 × 10⁹³(94-digit number)
25462515018483455703…95952172067551775361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.092 × 10⁹³(94-digit number)
50925030036966911407…91904344135103550721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.018 × 10⁹⁴(95-digit number)
10185006007393382281…83808688270207101441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.037 × 10⁹⁴(95-digit number)
20370012014786764562…67617376540414202881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.074 × 10⁹⁴(95-digit number)
40740024029573529125…35234753080828405761
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,772,588 XPM·at block #6,816,058 · 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