Block #549,496

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/17/2014, 2:35:00 PM · Difficulty 10.9608 · 6,265,463 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cf1d8c8b6a01719805c3eaea8c80132abd7d3ba8ac8b71da628e09d9376944b4

Height

#549,496

Difficulty

10.960824

Transactions

2

Size

434 B

Version

2

Bits

0af5f893

Nonce

187,725,485

Timestamp

5/17/2014, 2:35:00 PM

Confirmations

6,265,463

Merkle Root

bc02c5f61b060591edbf4c481604b31e67f11f6aba669c386109570606da8229
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.399 × 10⁹⁹(100-digit number)
13996707622332090452…63001117667449907199
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.399 × 10⁹⁹(100-digit number)
13996707622332090452…63001117667449907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.799 × 10⁹⁹(100-digit number)
27993415244664180904…26002235334899814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.598 × 10⁹⁹(100-digit number)
55986830489328361809…52004470669799628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.119 × 10¹⁰⁰(101-digit number)
11197366097865672361…04008941339599257599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.239 × 10¹⁰⁰(101-digit number)
22394732195731344723…08017882679198515199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.478 × 10¹⁰⁰(101-digit number)
44789464391462689447…16035765358397030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.957 × 10¹⁰⁰(101-digit number)
89578928782925378895…32071530716794060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.791 × 10¹⁰¹(102-digit number)
17915785756585075779…64143061433588121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.583 × 10¹⁰¹(102-digit number)
35831571513170151558…28286122867176243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.166 × 10¹⁰¹(102-digit number)
71663143026340303116…56572245734352486399
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,763,766 XPM·at block #6,814,958 · 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