Block #489,208

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/13/2014, 4:09:36 AM · Difficulty 10.6622 · 6,325,095 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f2e05a41ddf1fe312d9072dabf6b668fd8b042fa449bdd4bb0136c45ef9458b1

Height

#489,208

Difficulty

10.662236

Transactions

2

Size

427 B

Version

2

Bits

0aa98850

Nonce

13,884

Timestamp

4/13/2014, 4:09:36 AM

Confirmations

6,325,095

Merkle Root

f4fb08e519a26caf416880bf16f7a448400712f30d661963bdf9ffa7e55bb552
Transactions (2)
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.027 × 10⁹⁸(99-digit number)
10279058081341148531…34175315820220411041
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.027 × 10⁹⁸(99-digit number)
10279058081341148531…34175315820220411041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.055 × 10⁹⁸(99-digit number)
20558116162682297062…68350631640440822081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.111 × 10⁹⁸(99-digit number)
41116232325364594124…36701263280881644161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.223 × 10⁹⁸(99-digit number)
82232464650729188248…73402526561763288321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.644 × 10⁹⁹(100-digit number)
16446492930145837649…46805053123526576641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.289 × 10⁹⁹(100-digit number)
32892985860291675299…93610106247053153281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.578 × 10⁹⁹(100-digit number)
65785971720583350598…87220212494106306561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.315 × 10¹⁰⁰(101-digit number)
13157194344116670119…74440424988212613121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.631 × 10¹⁰⁰(101-digit number)
26314388688233340239…48880849976425226241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.262 × 10¹⁰⁰(101-digit number)
52628777376466680479…97761699952850452481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.052 × 10¹⁰¹(102-digit number)
10525755475293336095…95523399905700904961
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,758,487 XPM·at block #6,814,302 · 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