Block #2,176,252

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/24/2017, 10:05:11 PM · Difficulty 10.9190 · 4,655,295 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fa2147ae9cc3d73359e81b06bdaaf8b42dac27b781e3a2fe48cbf299f895a54a

Height

#2,176,252

Difficulty

10.918971

Transactions

16

Size

7.29 KB

Version

2

Bits

0aeb41ac

Nonce

196,773,555

Timestamp

6/24/2017, 10:05:11 PM

Confirmations

4,655,295

Merkle Root

0b3ded537d2fbefe01a314b7ac2e21dae3d6f1f245df663bda915b03b89a844f
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.

8.398 × 10⁹⁰(91-digit number)
83983100523753733187…39987404542474906901
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
8.398 × 10⁹⁰(91-digit number)
83983100523753733187…39987404542474906901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.679 × 10⁹¹(92-digit number)
16796620104750746637…79974809084949813801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.359 × 10⁹¹(92-digit number)
33593240209501493274…59949618169899627601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.718 × 10⁹¹(92-digit number)
67186480419002986549…19899236339799255201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.343 × 10⁹²(93-digit number)
13437296083800597309…39798472679598510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.687 × 10⁹²(93-digit number)
26874592167601194619…79596945359197020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.374 × 10⁹²(93-digit number)
53749184335202389239…59193890718394041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.074 × 10⁹³(94-digit number)
10749836867040477847…18387781436788083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.149 × 10⁹³(94-digit number)
21499673734080955695…36775562873576166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.299 × 10⁹³(94-digit number)
42999347468161911391…73551125747152332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.599 × 10⁹³(94-digit number)
85998694936323822783…47102251494304665601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,896,467 XPM·at block #6,831,546 · 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