Block #495,529

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 4:13:39 PM · Difficulty 10.7391 · 6,317,047 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ef88efef6e653fc45a95d37a3af2f606ebd93fd106547849ef69bf9aa5dd8e6b

Height

#495,529

Difficulty

10.739093

Transactions

10

Size

9.99 KB

Version

2

Bits

0abd352e

Nonce

466,473,609

Timestamp

4/16/2014, 4:13:39 PM

Confirmations

6,317,047

Merkle Root

1ef3d28ed3ee9785c6c0f90b2e1e31b126533b0bfe2465bcaee62b5efd4beb08
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.

6.061 × 10⁹⁸(99-digit number)
60617274522486307167…35469972624299878079
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
6.061 × 10⁹⁸(99-digit number)
60617274522486307167…35469972624299878079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.212 × 10⁹⁹(100-digit number)
12123454904497261433…70939945248599756159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.424 × 10⁹⁹(100-digit number)
24246909808994522867…41879890497199512319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.849 × 10⁹⁹(100-digit number)
48493819617989045734…83759780994399024639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.698 × 10⁹⁹(100-digit number)
96987639235978091468…67519561988798049279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.939 × 10¹⁰⁰(101-digit number)
19397527847195618293…35039123977596098559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.879 × 10¹⁰⁰(101-digit number)
38795055694391236587…70078247955192197119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.759 × 10¹⁰⁰(101-digit number)
77590111388782473174…40156495910384394239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.551 × 10¹⁰¹(102-digit number)
15518022277756494634…80312991820768788479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.103 × 10¹⁰¹(102-digit number)
31036044555512989269…60625983641537576959
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,744,642 XPM·at block #6,812,575 · 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