Block #488,030

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/12/2014, 12:07:53 PM · Difficulty 10.6471 · 6,327,840 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
038d14b895abfc435627a6337dbd2f16519459d187104632a91310b88c0f66ff

Height

#488,030

Difficulty

10.647136

Transactions

4

Size

1.30 KB

Version

2

Bits

0aa5aab2

Nonce

170,500,221

Timestamp

4/12/2014, 12:07:53 PM

Confirmations

6,327,840

Merkle Root

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

1.816 × 10⁹⁸(99-digit number)
18164040597119055905…41902658809177776001
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
1.816 × 10⁹⁸(99-digit number)
18164040597119055905…41902658809177776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.632 × 10⁹⁸(99-digit number)
36328081194238111811…83805317618355552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.265 × 10⁹⁸(99-digit number)
72656162388476223623…67610635236711104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.453 × 10⁹⁹(100-digit number)
14531232477695244724…35221270473422208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.906 × 10⁹⁹(100-digit number)
29062464955390489449…70442540946844416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.812 × 10⁹⁹(100-digit number)
58124929910780978899…40885081893688832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.162 × 10¹⁰⁰(101-digit number)
11624985982156195779…81770163787377664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.324 × 10¹⁰⁰(101-digit number)
23249971964312391559…63540327574755328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.649 × 10¹⁰⁰(101-digit number)
46499943928624783119…27080655149510656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.299 × 10¹⁰⁰(101-digit number)
92999887857249566238…54161310299021312001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,771,072 XPM·at block #6,815,869 · 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