Block #494,537

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 5:29:12 AM · Difficulty 10.7203 · 6,319,835 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bd9f96d054453250d869aa84cc1835131776679907b52fa59a0282bd96fdd1d9

Height

#494,537

Difficulty

10.720318

Transactions

5

Size

2.64 KB

Version

2

Bits

0ab866c3

Nonce

155,833,870

Timestamp

4/16/2014, 5:29:12 AM

Confirmations

6,319,835

Merkle Root

27cde80fcba038840b38404e44dfd568554bba76869ead1efd5c9af3575602a1
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.219 × 10⁹⁹(100-digit number)
32195980957003850166…49014150878416340479
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.219 × 10⁹⁹(100-digit number)
32195980957003850166…49014150878416340479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.439 × 10⁹⁹(100-digit number)
64391961914007700332…98028301756832680959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.287 × 10¹⁰⁰(101-digit number)
12878392382801540066…96056603513665361919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.575 × 10¹⁰⁰(101-digit number)
25756784765603080132…92113207027330723839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.151 × 10¹⁰⁰(101-digit number)
51513569531206160265…84226414054661447679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.030 × 10¹⁰¹(102-digit number)
10302713906241232053…68452828109322895359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.060 × 10¹⁰¹(102-digit number)
20605427812482464106…36905656218645790719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.121 × 10¹⁰¹(102-digit number)
41210855624964928212…73811312437291581439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.242 × 10¹⁰¹(102-digit number)
82421711249929856425…47622624874583162879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.648 × 10¹⁰²(103-digit number)
16484342249985971285…95245249749166325759
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,759,034 XPM·at block #6,814,371 · 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