Block #175,167

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/22/2013, 2:58:47 AM · Difficulty 9.8635 · 6,632,971 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c688978ac87038c6bf2b171be622855384cb077a5c47cf77d1bc949ee4935038

Height

#175,167

Difficulty

9.863462

Transactions

3

Size

799 B

Version

2

Bits

09dd0bde

Nonce

18,436

Timestamp

9/22/2013, 2:58:47 AM

Confirmations

6,632,971

Merkle Root

c3ca6bd9cb5310d60e5f7ea47d9d73806d565f35d143904cf3f3f51d11c491b6
Transactions (3)
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.

3.699 × 10⁹³(94-digit number)
36998049193577578696…52410884592619395861
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
3.699 × 10⁹³(94-digit number)
36998049193577578696…52410884592619395861
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.399 × 10⁹³(94-digit number)
73996098387155157392…04821769185238791721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.479 × 10⁹⁴(95-digit number)
14799219677431031478…09643538370477583441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.959 × 10⁹⁴(95-digit number)
29598439354862062957…19287076740955166881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.919 × 10⁹⁴(95-digit number)
59196878709724125914…38574153481910333761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.183 × 10⁹⁵(96-digit number)
11839375741944825182…77148306963820667521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.367 × 10⁹⁵(96-digit number)
23678751483889650365…54296613927641335041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.735 × 10⁹⁵(96-digit number)
47357502967779300731…08593227855282670081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.471 × 10⁹⁵(96-digit number)
94715005935558601462…17186455710565340161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.894 × 10⁹⁶(97-digit number)
18943001187111720292…34372911421130680321
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,709,146 XPM·at block #6,808,137 · 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.

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