Block #491,322

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2014, 10:50:46 AM · Difficulty 10.6806 · 6,317,124 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5b37c6d5a9f40cf6632b191203b8ed448bae7c33d60510f6f27cffbc4f78f695

Height

#491,322

Difficulty

10.680575

Transactions

1

Size

866 B

Version

2

Bits

0aae3a2f

Nonce

250,965

Timestamp

4/14/2014, 10:50:46 AM

Confirmations

6,317,124

Merkle Root

4a6ff3745909c66ebe90f660e1f30b6d844dd8927c92fe84cee947031dc9bf31
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.537 × 10⁹³(94-digit number)
15372882715271785351…41085742651378132841
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.537 × 10⁹³(94-digit number)
15372882715271785351…41085742651378132841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.074 × 10⁹³(94-digit number)
30745765430543570703…82171485302756265681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.149 × 10⁹³(94-digit number)
61491530861087141407…64342970605512531361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.229 × 10⁹⁴(95-digit number)
12298306172217428281…28685941211025062721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.459 × 10⁹⁴(95-digit number)
24596612344434856562…57371882422050125441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.919 × 10⁹⁴(95-digit number)
49193224688869713125…14743764844100250881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.838 × 10⁹⁴(95-digit number)
98386449377739426251…29487529688200501761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.967 × 10⁹⁵(96-digit number)
19677289875547885250…58975059376401003521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.935 × 10⁹⁵(96-digit number)
39354579751095770500…17950118752802007041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.870 × 10⁹⁵(96-digit number)
78709159502191541001…35900237505604014081
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,711,629 XPM·at block #6,808,445 · 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