Block #483,292

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/9/2014, 11:29:50 PM · Difficulty 10.5603 · 6,323,858 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2c41444d54f0a8fa40a4b9169094dbf0ff2c197bb0c1d9d503c2b541ec0d52a9

Height

#483,292

Difficulty

10.560347

Transactions

7

Size

1.81 KB

Version

2

Bits

0a8f72e1

Nonce

433,639,941

Timestamp

4/9/2014, 11:29:50 PM

Confirmations

6,323,858

Merkle Root

79668d303994e18b31e5c1516cc242a43253a1d41622dda41bc27ed458a70b50
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.869 × 10⁹⁷(98-digit number)
18695080895832590601…31389984676792884851
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.869 × 10⁹⁷(98-digit number)
18695080895832590601…31389984676792884851
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.739 × 10⁹⁷(98-digit number)
37390161791665181203…62779969353585769701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.478 × 10⁹⁷(98-digit number)
74780323583330362406…25559938707171539401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.495 × 10⁹⁸(99-digit number)
14956064716666072481…51119877414343078801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.991 × 10⁹⁸(99-digit number)
29912129433332144962…02239754828686157601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.982 × 10⁹⁸(99-digit number)
59824258866664289924…04479509657372315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.196 × 10⁹⁹(100-digit number)
11964851773332857984…08959019314744630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.392 × 10⁹⁹(100-digit number)
23929703546665715969…17918038629489260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.785 × 10⁹⁹(100-digit number)
47859407093331431939…35836077258978521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.571 × 10⁹⁹(100-digit number)
95718814186662863879…71672154517957043201
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,701,206 XPM·at block #6,807,149 · 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.

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