Block #492,441

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2014, 3:37:37 AM · Difficulty 10.6875 · 6,315,664 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e101a979528016e2bd558f83a7109cae9efaf777e24437b71ceec847a8679dc8

Height

#492,441

Difficulty

10.687500

Transactions

2

Size

725 B

Version

2

Bits

0ab00005

Nonce

41,406

Timestamp

4/15/2014, 3:37:37 AM

Confirmations

6,315,664

Merkle Root

243e55325fb225dbee8232d521a79c3311127288f7c66668cc98ee52527b3474
Transactions (2)
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.459 × 10⁹⁷(98-digit number)
14591355282701648851…18525116487219504321
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.459 × 10⁹⁷(98-digit number)
14591355282701648851…18525116487219504321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.918 × 10⁹⁷(98-digit number)
29182710565403297703…37050232974439008641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.836 × 10⁹⁷(98-digit number)
58365421130806595407…74100465948878017281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.167 × 10⁹⁸(99-digit number)
11673084226161319081…48200931897756034561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.334 × 10⁹⁸(99-digit number)
23346168452322638163…96401863795512069121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.669 × 10⁹⁸(99-digit number)
46692336904645276326…92803727591024138241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.338 × 10⁹⁸(99-digit number)
93384673809290552652…85607455182048276481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.867 × 10⁹⁹(100-digit number)
18676934761858110530…71214910364096552961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.735 × 10⁹⁹(100-digit number)
37353869523716221061…42429820728193105921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.470 × 10⁹⁹(100-digit number)
74707739047432442122…84859641456386211841
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,708,886 XPM·at block #6,808,104 · 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