Block #489,515

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/13/2014, 8:18:31 AM · Difficulty 10.6662 · 6,325,592 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
176a7a6873696c547b1cdcb71f82fb7f0b68dab8ae6e07995a4b2b5f765ad013

Height

#489,515

Difficulty

10.666178

Transactions

2

Size

988 B

Version

2

Bits

0aaa8aac

Nonce

186,586

Timestamp

4/13/2014, 8:18:31 AM

Confirmations

6,325,592

Merkle Root

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

6.556 × 10⁹⁰(91-digit number)
65564303461163681162…85532937763342594721
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
6.556 × 10⁹⁰(91-digit number)
65564303461163681162…85532937763342594721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.311 × 10⁹¹(92-digit number)
13112860692232736232…71065875526685189441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.622 × 10⁹¹(92-digit number)
26225721384465472465…42131751053370378881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.245 × 10⁹¹(92-digit number)
52451442768930944930…84263502106740757761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.049 × 10⁹²(93-digit number)
10490288553786188986…68527004213481515521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.098 × 10⁹²(93-digit number)
20980577107572377972…37054008426963031041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.196 × 10⁹²(93-digit number)
41961154215144755944…74108016853926062081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.392 × 10⁹²(93-digit number)
83922308430289511888…48216033707852124161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.678 × 10⁹³(94-digit number)
16784461686057902377…96432067415704248321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.356 × 10⁹³(94-digit number)
33568923372115804755…92864134831408496641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.713 × 10⁹³(94-digit number)
67137846744231609510…85728269662816993281
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,764,946 XPM·at block #6,815,106 · 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