Block #492,053

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/14/2014, 9:11:25 PM · Difficulty 10.6875 · 6,318,362 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c664f2b0d72267bdeef2aecfaa6647f97f5fb7c3eaa0aa758172a42b681055fd

Height

#492,053

Difficulty

10.687459

Transactions

3

Size

592 B

Version

2

Bits

0aaffd4b

Nonce

2,371

Timestamp

4/14/2014, 9:11:25 PM

Confirmations

6,318,362

Merkle Root

36086515409b4d778d9643023603535f11487454a320362e6df1d87ee0913b33
Transactions (3)
1 in → 1 out8.7600 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.760 × 10⁹⁶(97-digit number)
17602527384207799674…46289769887363569599
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.760 × 10⁹⁶(97-digit number)
17602527384207799674…46289769887363569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.520 × 10⁹⁶(97-digit number)
35205054768415599349…92579539774727139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.041 × 10⁹⁶(97-digit number)
70410109536831198698…85159079549454278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.408 × 10⁹⁷(98-digit number)
14082021907366239739…70318159098908556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.816 × 10⁹⁷(98-digit number)
28164043814732479479…40636318197817113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.632 × 10⁹⁷(98-digit number)
56328087629464958959…81272636395634227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.126 × 10⁹⁸(99-digit number)
11265617525892991791…62545272791268454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.253 × 10⁹⁸(99-digit number)
22531235051785983583…25090545582536908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.506 × 10⁹⁸(99-digit number)
45062470103571967167…50181091165073817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.012 × 10⁹⁸(99-digit number)
90124940207143934334…00362182330147635199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,727,400 XPM·at block #6,810,414 · 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