Block #489,219

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/13/2014, 4:20:57 AM · Difficulty 10.6622 · 6,337,350 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0cb1d7a81a59caa170671b1a56887960d974bedc48260e424ce03e5021795fa9

Height

#489,219

Difficulty

10.662151

Transactions

6

Size

2.02 KB

Version

2

Bits

0aa982b5

Nonce

79,660,885

Timestamp

4/13/2014, 4:20:57 AM

Confirmations

6,337,350

Merkle Root

ff2f5cabec833bd93fe20a890fbc8461f95c9a4c920335ff5ff44903b220e894
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.415 × 10⁹⁷(98-digit number)
24155563138771187831…86263913798240281021
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.415 × 10⁹⁷(98-digit number)
24155563138771187831…86263913798240281021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.831 × 10⁹⁷(98-digit number)
48311126277542375663…72527827596480562041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.662 × 10⁹⁷(98-digit number)
96622252555084751327…45055655192961124081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.932 × 10⁹⁸(99-digit number)
19324450511016950265…90111310385922248161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.864 × 10⁹⁸(99-digit number)
38648901022033900530…80222620771844496321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.729 × 10⁹⁸(99-digit number)
77297802044067801061…60445241543688992641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.545 × 10⁹⁹(100-digit number)
15459560408813560212…20890483087377985281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.091 × 10⁹⁹(100-digit number)
30919120817627120424…41780966174755970561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.183 × 10⁹⁹(100-digit number)
61838241635254240849…83561932349511941121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.236 × 10¹⁰⁰(101-digit number)
12367648327050848169…67123864699023882241
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,856,703 XPM·at block #6,826,568 · 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