Block #1,898,389

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2016, 1:55:34 PM · Difficulty 10.7565 · 4,928,847 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
75de5052f0289bb7f7a1cd231b825a897e8c7d870dff39f692364aa527dfa7f3

Height

#1,898,389

Difficulty

10.756499

Transactions

2

Size

868 B

Version

2

Bits

0ac1a9e7

Nonce

719,251,113

Timestamp

12/17/2016, 1:55:34 PM

Confirmations

4,928,847

Merkle Root

a72cf8d01ab075b9a97413eab19bcca917b33e44caacfadb655276af570ee8d7
Transactions (2)
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.373 × 10⁹⁵(96-digit number)
63730291703566715588…40866771424969696001
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.373 × 10⁹⁵(96-digit number)
63730291703566715588…40866771424969696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.274 × 10⁹⁶(97-digit number)
12746058340713343117…81733542849939392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.549 × 10⁹⁶(97-digit number)
25492116681426686235…63467085699878784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.098 × 10⁹⁶(97-digit number)
50984233362853372471…26934171399757568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.019 × 10⁹⁷(98-digit number)
10196846672570674494…53868342799515136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.039 × 10⁹⁷(98-digit number)
20393693345141348988…07736685599030272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.078 × 10⁹⁷(98-digit number)
40787386690282697976…15473371198060544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.157 × 10⁹⁷(98-digit number)
81574773380565395953…30946742396121088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.631 × 10⁹⁸(99-digit number)
16314954676113079190…61893484792242176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.262 × 10⁹⁸(99-digit number)
32629909352226158381…23786969584484352001
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,861,989 XPM·at block #6,827,235 · 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