Block #1,167,185

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/23/2015, 7:45:18 PM · Difficulty 10.9339 · 5,674,209 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dc7b435cfd897838cdf88a8636bbe457b5a70638cacb2f5416420d946caec896

Height

#1,167,185

Difficulty

10.933864

Transactions

20

Size

5.90 KB

Version

2

Bits

0aef11af

Nonce

941,681,632

Timestamp

7/23/2015, 7:45:18 PM

Confirmations

5,674,209

Merkle Root

3e27f9ddc84b83503e8f223cd0ccf20989b6ac609f52b269cd86a55cd62f4283
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.317 × 10⁹⁶(97-digit number)
63173224389550422770…89115539165284276481
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.317 × 10⁹⁶(97-digit number)
63173224389550422770…89115539165284276481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.263 × 10⁹⁷(98-digit number)
12634644877910084554…78231078330568552961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.526 × 10⁹⁷(98-digit number)
25269289755820169108…56462156661137105921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.053 × 10⁹⁷(98-digit number)
50538579511640338216…12924313322274211841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.010 × 10⁹⁸(99-digit number)
10107715902328067643…25848626644548423681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.021 × 10⁹⁸(99-digit number)
20215431804656135286…51697253289096847361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.043 × 10⁹⁸(99-digit number)
40430863609312270573…03394506578193694721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.086 × 10⁹⁸(99-digit number)
80861727218624541146…06789013156387389441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.617 × 10⁹⁹(100-digit number)
16172345443724908229…13578026312774778881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.234 × 10⁹⁹(100-digit number)
32344690887449816458…27156052625549557761
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,975,524 XPM·at block #6,841,393 · 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