Block #2,142,066

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/2/2017, 4:34:12 PM · Difficulty 10.8739 · 4,696,944 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9753f3ce2592fe17ac6ff8edfa40017ba8b2544f5b77e30091f37e749b69b87c

Height

#2,142,066

Difficulty

10.873941

Transactions

3

Size

946 B

Version

2

Bits

0adfba9b

Nonce

580,837,621

Timestamp

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

Confirmations

4,696,944

Merkle Root

14bd5ca9843f427da6bef074e803a7fc28c5cb1a8a9d8f4881c2951dc12bb87e
Transactions (3)
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.

2.507 × 10⁹³(94-digit number)
25072817369582753746…72264722781388630901
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
2.507 × 10⁹³(94-digit number)
25072817369582753746…72264722781388630901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.014 × 10⁹³(94-digit number)
50145634739165507492…44529445562777261801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.002 × 10⁹⁴(95-digit number)
10029126947833101498…89058891125554523601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.005 × 10⁹⁴(95-digit number)
20058253895666202996…78117782251109047201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.011 × 10⁹⁴(95-digit number)
40116507791332405993…56235564502218094401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.023 × 10⁹⁴(95-digit number)
80233015582664811987…12471129004436188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.604 × 10⁹⁵(96-digit number)
16046603116532962397…24942258008872377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.209 × 10⁹⁵(96-digit number)
32093206233065924795…49884516017744755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.418 × 10⁹⁵(96-digit number)
64186412466131849590…99769032035489510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.283 × 10⁹⁶(97-digit number)
12837282493226369918…99538064070979020801
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,956,347 XPM·at block #6,839,009 · 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