Block #497,119

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/17/2014, 10:45:01 AM · Difficulty 10.7629 · 6,317,928 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5e37c1be0c66057fadfedb0e91546daa338f341189bb2166adc7b70541d49cf0

Height

#497,119

Difficulty

10.762928

Transactions

5

Size

1.66 KB

Version

2

Bits

0ac34f3e

Nonce

210,103,262

Timestamp

4/17/2014, 10:45:01 AM

Confirmations

6,317,928

Merkle Root

c70a26a4ed723ac4eb3be46f50c0b5c832ab6fdc1cbc4a8cad1c133767fbdb4b
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.

5.725 × 10⁹⁸(99-digit number)
57252996469720159406…74182076988283371199
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
5.725 × 10⁹⁸(99-digit number)
57252996469720159406…74182076988283371199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.145 × 10⁹⁹(100-digit number)
11450599293944031881…48364153976566742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.290 × 10⁹⁹(100-digit number)
22901198587888063762…96728307953133484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.580 × 10⁹⁹(100-digit number)
45802397175776127524…93456615906266969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.160 × 10⁹⁹(100-digit number)
91604794351552255049…86913231812533939199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.832 × 10¹⁰⁰(101-digit number)
18320958870310451009…73826463625067878399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.664 × 10¹⁰⁰(101-digit number)
36641917740620902019…47652927250135756799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.328 × 10¹⁰⁰(101-digit number)
73283835481241804039…95305854500271513599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.465 × 10¹⁰¹(102-digit number)
14656767096248360807…90611709000543027199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.931 × 10¹⁰¹(102-digit number)
29313534192496721615…81223418001086054399
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,764,466 XPM·at block #6,815,046 · 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