Block #2,477,842

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2018, 9:55:48 PM · Difficulty 10.9651 · 4,367,072 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3978f65309e8169f535e28b74dfcbcae47cf96cb127542174d41f28a68258ecd

Height

#2,477,842

Difficulty

10.965122

Transactions

16

Size

3.27 KB

Version

2

Bits

0af7123d

Nonce

260,114,789

Timestamp

1/17/2018, 9:55:48 PM

Confirmations

4,367,072

Merkle Root

183b81fb8f8a0068393c5707bfdc02cd020be9cabe369a3b91b8be0f89c29b59
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.251 × 10⁹⁴(95-digit number)
12519248098650422290…56738099567775300801
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.251 × 10⁹⁴(95-digit number)
12519248098650422290…56738099567775300801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.503 × 10⁹⁴(95-digit number)
25038496197300844580…13476199135550601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.007 × 10⁹⁴(95-digit number)
50076992394601689160…26952398271101203201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.001 × 10⁹⁵(96-digit number)
10015398478920337832…53904796542202406401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.003 × 10⁹⁵(96-digit number)
20030796957840675664…07809593084404812801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.006 × 10⁹⁵(96-digit number)
40061593915681351328…15619186168809625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.012 × 10⁹⁵(96-digit number)
80123187831362702657…31238372337619251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.602 × 10⁹⁶(97-digit number)
16024637566272540531…62476744675238502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.204 × 10⁹⁶(97-digit number)
32049275132545081062…24953489350477004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.409 × 10⁹⁶(97-digit number)
64098550265090162125…49906978700954009601
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:58,003,728 XPM·at block #6,844,913 · 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