Block #2,160,142

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/14/2017, 8:55:52 AM · Difficulty 10.9022 · 4,666,583 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9de8aa2ec9ed55c22e3fa824abe70718cefd7489ea48747f70a40d2c040a2bc9

Height

#2,160,142

Difficulty

10.902246

Transactions

2

Size

1.71 KB

Version

2

Bits

0ae6f994

Nonce

1,000,121,618

Timestamp

6/14/2017, 8:55:52 AM

Confirmations

4,666,583

Merkle Root

b580ad3afc5ca1211497409529791b0a38ebcd154134199bc07bd6dbc3f3a7cb
Transactions (2)
1 in → 1 out8.4400 XPM109 B
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.

1.017 × 10⁹²(93-digit number)
10177084619578177588…29981545245407238321
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
1.017 × 10⁹²(93-digit number)
10177084619578177588…29981545245407238321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.035 × 10⁹²(93-digit number)
20354169239156355176…59963090490814476641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.070 × 10⁹²(93-digit number)
40708338478312710352…19926180981628953281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.141 × 10⁹²(93-digit number)
81416676956625420704…39852361963257906561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.628 × 10⁹³(94-digit number)
16283335391325084140…79704723926515813121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.256 × 10⁹³(94-digit number)
32566670782650168281…59409447853031626241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.513 × 10⁹³(94-digit number)
65133341565300336563…18818895706063252481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.302 × 10⁹⁴(95-digit number)
13026668313060067312…37637791412126504961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.605 × 10⁹⁴(95-digit number)
26053336626120134625…75275582824253009921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.210 × 10⁹⁴(95-digit number)
52106673252240269250…50551165648506019841
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,857,953 XPM·at block #6,826,724 · 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