Block #2,142,067

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/2/2017, 4:34:38 PM · Difficulty 10.8739 · 4,701,427 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6a260d46d2ec8ca2951b6e37ca477ef67293d1a6d602cbd924c38258f182baa1

Height

#2,142,067

Difficulty

10.873902

Transactions

4

Size

1.15 KB

Version

2

Bits

0adfb811

Nonce

1,570,843,144

Timestamp

6/2/2017, 4:34:38 PM

Confirmations

4,701,427

Merkle Root

04251541a82ad09126b90b7eff97277347c1ddbbec255c1c5aadc83d4d788de3
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.744 × 10⁹³(94-digit number)
67447730986439186553…36522433127711201281
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.744 × 10⁹³(94-digit number)
67447730986439186553…36522433127711201281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.348 × 10⁹⁴(95-digit number)
13489546197287837310…73044866255422402561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.697 × 10⁹⁴(95-digit number)
26979092394575674621…46089732510844805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.395 × 10⁹⁴(95-digit number)
53958184789151349242…92179465021689610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.079 × 10⁹⁵(96-digit number)
10791636957830269848…84358930043379220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.158 × 10⁹⁵(96-digit number)
21583273915660539697…68717860086758440961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.316 × 10⁹⁵(96-digit number)
43166547831321079394…37435720173516881921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.633 × 10⁹⁵(96-digit number)
86333095662642158788…74871440347033763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.726 × 10⁹⁶(97-digit number)
17266619132528431757…49742880694067527681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.453 × 10⁹⁶(97-digit number)
34533238265056863515…99485761388135055361
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,992,324 XPM·at block #6,843,493 · 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