Block #495,010

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 10:54:18 AM · Difficulty 10.7287 · 6,315,364 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0a9e934b572cf4c9d9d1cd41e1e700fb76c9e1364f25d1b5947565855fea1970

Height

#495,010

Difficulty

10.728678

Transactions

3

Size

947 B

Version

2

Bits

0aba8aab

Nonce

5,832

Timestamp

4/16/2014, 10:54:18 AM

Confirmations

6,315,364

Merkle Root

509a976809d1be926aaeaf8d54a62690123d0594025fc782fc1370074225c9c2
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.975 × 10¹⁰¹(102-digit number)
29755935003322683961…33537072306278860799
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.975 × 10¹⁰¹(102-digit number)
29755935003322683961…33537072306278860799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.951 × 10¹⁰¹(102-digit number)
59511870006645367923…67074144612557721599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.190 × 10¹⁰²(103-digit number)
11902374001329073584…34148289225115443199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.380 × 10¹⁰²(103-digit number)
23804748002658147169…68296578450230886399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.760 × 10¹⁰²(103-digit number)
47609496005316294338…36593156900461772799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.521 × 10¹⁰²(103-digit number)
95218992010632588677…73186313800923545599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.904 × 10¹⁰³(104-digit number)
19043798402126517735…46372627601847091199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.808 × 10¹⁰³(104-digit number)
38087596804253035470…92745255203694182399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.617 × 10¹⁰³(104-digit number)
76175193608506070941…85490510407388364799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.523 × 10¹⁰⁴(105-digit number)
15235038721701214188…70981020814776729599
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,727,068 XPM·at block #6,810,373 · 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