Block #497,372

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/17/2014, 1:41:29 PM · Difficulty 10.7665 · 6,309,763 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2ad925560ff99599781fcbd251c119b644829d20c3ec1b9b0a8175bab960b73f

Height

#497,372

Difficulty

10.766467

Transactions

2

Size

6.64 KB

Version

2

Bits

0ac4372f

Nonce

176,170,671

Timestamp

4/17/2014, 1:41:29 PM

Confirmations

6,309,763

Merkle Root

5734caf9f447b72780908e9c2fa75c4cb7e8a2ee1162b3cfbea444dcece4ff92
Transactions (2)
1 in → 1 out8.7200 XPM116 B
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.

2.082 × 10⁹⁸(99-digit number)
20829117150523064853…15423956578607825279
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
2.082 × 10⁹⁸(99-digit number)
20829117150523064853…15423956578607825279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.165 × 10⁹⁸(99-digit number)
41658234301046129706…30847913157215650559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.331 × 10⁹⁸(99-digit number)
83316468602092259412…61695826314431301119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.666 × 10⁹⁹(100-digit number)
16663293720418451882…23391652628862602239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.332 × 10⁹⁹(100-digit number)
33326587440836903764…46783305257725204479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.665 × 10⁹⁹(100-digit number)
66653174881673807529…93566610515450408959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.333 × 10¹⁰⁰(101-digit number)
13330634976334761505…87133221030900817919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.666 × 10¹⁰⁰(101-digit number)
26661269952669523011…74266442061801635839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.332 × 10¹⁰⁰(101-digit number)
53322539905339046023…48532884123603271679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.066 × 10¹⁰¹(102-digit number)
10664507981067809204…97065768247206543359
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,701,185 XPM·at block #6,807,134 · 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