Block #498,544

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/18/2014, 3:59:49 AM · Difficulty 10.7809 · 6,319,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
c0ff8970178c64f763b9e7a4e9bad994851c7ed41451a8ea35877afedb54a917

Height

#498,544

Difficulty

10.780863

Transactions

13

Size

3.00 KB

Version

2

Bits

0ac7e6a7

Nonce

309,310,317

Timestamp

4/18/2014, 3:59:49 AM

Confirmations

6,319,463

Merkle Root

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

7.747 × 10⁹⁹(100-digit number)
77473968705168397630…80738966298372469759
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
7.747 × 10⁹⁹(100-digit number)
77473968705168397630…80738966298372469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.549 × 10¹⁰⁰(101-digit number)
15494793741033679526…61477932596744939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.098 × 10¹⁰⁰(101-digit number)
30989587482067359052…22955865193489879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.197 × 10¹⁰⁰(101-digit number)
61979174964134718104…45911730386979758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.239 × 10¹⁰¹(102-digit number)
12395834992826943620…91823460773959516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.479 × 10¹⁰¹(102-digit number)
24791669985653887241…83646921547919032319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.958 × 10¹⁰¹(102-digit number)
49583339971307774483…67293843095838064639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.916 × 10¹⁰¹(102-digit number)
99166679942615548967…34587686191676129279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.983 × 10¹⁰²(103-digit number)
19833335988523109793…69175372383352258559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.966 × 10¹⁰²(103-digit number)
39666671977046219586…38350744766704517119
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,788,121 XPM·at block #6,818,006 · 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