Block #491,653

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2014, 3:25:45 PM · Difficulty 10.6840 · 6,315,219 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dc115b76858ba6e6490ec7d5206f0f0385c73f83e4b056558c8cc9ce2e4571c0

Height

#491,653

Difficulty

10.684047

Transactions

7

Size

3.13 KB

Version

2

Bits

0aaf1db0

Nonce

16,375

Timestamp

4/14/2014, 3:25:45 PM

Confirmations

6,315,219

Merkle Root

37b4804c414bc74d1f8fa0e9b5720b42561032b2889cd7c91b49ca89bb672766
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.

7.846 × 10⁹⁷(98-digit number)
78464795133569495593…15707329631800871681
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
7.846 × 10⁹⁷(98-digit number)
78464795133569495593…15707329631800871681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.569 × 10⁹⁸(99-digit number)
15692959026713899118…31414659263601743361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.138 × 10⁹⁸(99-digit number)
31385918053427798237…62829318527203486721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.277 × 10⁹⁸(99-digit number)
62771836106855596474…25658637054406973441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.255 × 10⁹⁹(100-digit number)
12554367221371119294…51317274108813946881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.510 × 10⁹⁹(100-digit number)
25108734442742238589…02634548217627893761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.021 × 10⁹⁹(100-digit number)
50217468885484477179…05269096435255787521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.004 × 10¹⁰⁰(101-digit number)
10043493777096895435…10538192870511575041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.008 × 10¹⁰⁰(101-digit number)
20086987554193790871…21076385741023150081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.017 × 10¹⁰⁰(101-digit number)
40173975108387581743…42152771482046300161
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,699,083 XPM·at block #6,806,871 · 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