Block #2,180,165

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/27/2017, 1:46:09 AM · Difficulty 10.9312 · 4,665,108 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7f3ca868c3cd50eb20d9f50e96c98817d585e6a6e492ef0f3317c87c9cbadc0a

Height

#2,180,165

Difficulty

10.931168

Transactions

40

Size

12.61 KB

Version

2

Bits

0aee6105

Nonce

67,209,803

Timestamp

6/27/2017, 1:46:09 AM

Confirmations

4,665,108

Merkle Root

a0b7094451f99e574699ec77c5bad4323d1a6ff36131cc7cf6d90077493cfd05
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.055 × 10⁹⁵(96-digit number)
30555077910823247423…07670390312151377921
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.055 × 10⁹⁵(96-digit number)
30555077910823247423…07670390312151377921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.111 × 10⁹⁵(96-digit number)
61110155821646494846…15340780624302755841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.222 × 10⁹⁶(97-digit number)
12222031164329298969…30681561248605511681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.444 × 10⁹⁶(97-digit number)
24444062328658597938…61363122497211023361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.888 × 10⁹⁶(97-digit number)
48888124657317195877…22726244994422046721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.777 × 10⁹⁶(97-digit number)
97776249314634391754…45452489988844093441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.955 × 10⁹⁷(98-digit number)
19555249862926878350…90904979977688186881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.911 × 10⁹⁷(98-digit number)
39110499725853756701…81809959955376373761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.822 × 10⁹⁷(98-digit number)
78220999451707513403…63619919910752747521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.564 × 10⁹⁸(99-digit number)
15644199890341502680…27239839821505495041
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:58,006,618 XPM·at block #6,845,272 · 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