Block #496,737

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/17/2014, 5:59:00 AM · Difficulty 10.7584 · 6,330,560 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a05767c97ccd5bba76aebafa0c82e9ca67f9c47434af53fbb8ea2c3b8530e583

Height

#496,737

Difficulty

10.758443

Transactions

3

Size

1.48 KB

Version

2

Bits

0ac2294b

Nonce

168,125

Timestamp

4/17/2014, 5:59:00 AM

Confirmations

6,330,560

Merkle Root

6529b5f3b5a23f1726fdaa49738c90389e196c68ce351b48587ac2ea5fafb8bc
Transactions (3)
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.

4.495 × 10⁹⁴(95-digit number)
44951707258522351295…63503173036602321121
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
4.495 × 10⁹⁴(95-digit number)
44951707258522351295…63503173036602321121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.990 × 10⁹⁴(95-digit number)
89903414517044702590…27006346073204642241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.798 × 10⁹⁵(96-digit number)
17980682903408940518…54012692146409284481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.596 × 10⁹⁵(96-digit number)
35961365806817881036…08025384292818568961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.192 × 10⁹⁵(96-digit number)
71922731613635762072…16050768585637137921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.438 × 10⁹⁶(97-digit number)
14384546322727152414…32101537171274275841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.876 × 10⁹⁶(97-digit number)
28769092645454304828…64203074342548551681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.753 × 10⁹⁶(97-digit number)
57538185290908609657…28406148685097103361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.150 × 10⁹⁷(98-digit number)
11507637058181721931…56812297370194206721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.301 × 10⁹⁷(98-digit number)
23015274116363443863…13624594740388413441
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,862,486 XPM·at block #6,827,296 · 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