Block #495,318

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2014, 2:07:16 PM · Difficulty 10.7347 · 6,321,746 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7c3db66a73c52ec6ba9fe264837ed0e9fbd68b4bee5af2052e208d695d872c24

Height

#495,318

Difficulty

10.734689

Transactions

2

Size

19.64 KB

Version

2

Bits

0abc1498

Nonce

156,094,419

Timestamp

4/16/2014, 2:07:16 PM

Confirmations

6,321,746

Merkle Root

9a786d9eeb7f90bf333b2d5ebe1561bfe0b9e263d38555aab5494a62d516fd0b
Transactions (2)
1 in → 1 out8.8700 XPM116 B
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.786 × 10⁹⁷(98-digit number)
17864482976301856972…73466562226999677251
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.786 × 10⁹⁷(98-digit number)
17864482976301856972…73466562226999677251
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.572 × 10⁹⁷(98-digit number)
35728965952603713945…46933124453999354501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.145 × 10⁹⁷(98-digit number)
71457931905207427891…93866248907998709001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.429 × 10⁹⁸(99-digit number)
14291586381041485578…87732497815997418001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.858 × 10⁹⁸(99-digit number)
28583172762082971156…75464995631994836001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.716 × 10⁹⁸(99-digit number)
57166345524165942313…50929991263989672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.143 × 10⁹⁹(100-digit number)
11433269104833188462…01859982527979344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.286 × 10⁹⁹(100-digit number)
22866538209666376925…03719965055958688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.573 × 10⁹⁹(100-digit number)
45733076419332753850…07439930111917376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.146 × 10⁹⁹(100-digit number)
91466152838665507701…14879860223834752001
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,780,547 XPM·at block #6,817,063 · 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