Block #488,735

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/12/2014, 8:50:44 PM · Difficulty 10.6599 · 6,336,799 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
98bd2d51fe1201833f38031f4271cb88f5d6d803c24c8bad54edc6fd776b86b3

Height

#488,735

Difficulty

10.659925

Transactions

3

Size

1.22 KB

Version

2

Bits

0aa8f0d0

Nonce

99,029,684

Timestamp

4/12/2014, 8:50:44 PM

Confirmations

6,336,799

Merkle Root

7e74acf2ee0f91a6967695ed4f282c921627cd2f535fc4eb02674a64a518260d
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.895 × 10¹⁰⁰(101-digit number)
28954938515957351371…49607623587472179199
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.895 × 10¹⁰⁰(101-digit number)
28954938515957351371…49607623587472179199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.790 × 10¹⁰⁰(101-digit number)
57909877031914702743…99215247174944358399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.158 × 10¹⁰¹(102-digit number)
11581975406382940548…98430494349888716799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.316 × 10¹⁰¹(102-digit number)
23163950812765881097…96860988699777433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.632 × 10¹⁰¹(102-digit number)
46327901625531762194…93721977399554867199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.265 × 10¹⁰¹(102-digit number)
92655803251063524389…87443954799109734399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.853 × 10¹⁰²(103-digit number)
18531160650212704877…74887909598219468799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.706 × 10¹⁰²(103-digit number)
37062321300425409755…49775819196438937599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.412 × 10¹⁰²(103-digit number)
74124642600850819511…99551638392877875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.482 × 10¹⁰³(104-digit number)
14824928520170163902…99103276785755750399
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,848,370 XPM·at block #6,825,533 · 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