Block #489,807

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/13/2014, 12:26:37 PM · Difficulty 10.6691 · 6,319,051 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d2ee839c3fb13e50ab89a73dd51cec53c93dae3c19a189e57695644a9a8399f6

Height

#489,807

Difficulty

10.669085

Transactions

3

Size

2.52 KB

Version

2

Bits

0aab4927

Nonce

6,600

Timestamp

4/13/2014, 12:26:37 PM

Confirmations

6,319,051

Merkle Root

6faba38acd560c5d1b2eb69209e1afe766058228fd041be0b9a375483be291ca
Transactions (3)
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.252 × 10⁹⁸(99-digit number)
12522836221790969492…90085654465968857601
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.252 × 10⁹⁸(99-digit number)
12522836221790969492…90085654465968857601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.504 × 10⁹⁸(99-digit number)
25045672443581938985…80171308931937715201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.009 × 10⁹⁸(99-digit number)
50091344887163877970…60342617863875430401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.001 × 10⁹⁹(100-digit number)
10018268977432775594…20685235727750860801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.003 × 10⁹⁹(100-digit number)
20036537954865551188…41370471455501721601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.007 × 10⁹⁹(100-digit number)
40073075909731102376…82740942911003443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.014 × 10⁹⁹(100-digit number)
80146151819462204752…65481885822006886401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.602 × 10¹⁰⁰(101-digit number)
16029230363892440950…30963771644013772801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.205 × 10¹⁰⁰(101-digit number)
32058460727784881901…61927543288027545601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.411 × 10¹⁰⁰(101-digit number)
64116921455569763802…23855086576055091201
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,714,912 XPM·at block #6,808,857 · 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.

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