Block #494,767

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 8:01:01 AM · Difficulty 10.7248 · 6,315,052 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
184095d5b68c5a180ecb6e5c1589f04d9276e5e5e37902db6aaa07e09b042dec

Height

#494,767

Difficulty

10.724817

Transactions

11

Size

2.99 KB

Version

2

Bits

0ab98da0

Nonce

99,133,330

Timestamp

4/16/2014, 8:01:01 AM

Confirmations

6,315,052

Merkle Root

4b9610fcf413d7fffd2589e21ade31ab43e378d8d972c59e7b00262f392e5ac3
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.

3.445 × 10⁹⁷(98-digit number)
34451357474521505176…89712457134994959999
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
3.445 × 10⁹⁷(98-digit number)
34451357474521505176…89712457134994959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.890 × 10⁹⁷(98-digit number)
68902714949043010352…79424914269989919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.378 × 10⁹⁸(99-digit number)
13780542989808602070…58849828539979839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.756 × 10⁹⁸(99-digit number)
27561085979617204140…17699657079959679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.512 × 10⁹⁸(99-digit number)
55122171959234408281…35399314159919359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.102 × 10⁹⁹(100-digit number)
11024434391846881656…70798628319838719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.204 × 10⁹⁹(100-digit number)
22048868783693763312…41597256639677439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.409 × 10⁹⁹(100-digit number)
44097737567387526625…83194513279354879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.819 × 10⁹⁹(100-digit number)
88195475134775053250…66389026558709759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.763 × 10¹⁰⁰(101-digit number)
17639095026955010650…32778053117419519999
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,722,636 XPM·at block #6,809,818 · 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