Block #505,089

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/22/2014, 5:27:31 AM · Difficulty 10.8099 · 6,321,633 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
44aaec6eee9662e4596e1cf50410829c6b5b0c6c89f5ba1d68d46a3cb934c0d3

Height

#505,089

Difficulty

10.809854

Transactions

6

Size

4.05 KB

Version

2

Bits

0acf5295

Nonce

164,522,967

Timestamp

4/22/2014, 5:27:31 AM

Confirmations

6,321,633

Merkle Root

2159b7ea0f595880839941354cb6d06dd414a0d31f7bec51a90159beece4c2f2
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.

9.049 × 10⁹⁷(98-digit number)
90492430168120277764…11330045355703255521
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
9.049 × 10⁹⁷(98-digit number)
90492430168120277764…11330045355703255521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.809 × 10⁹⁸(99-digit number)
18098486033624055552…22660090711406511041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.619 × 10⁹⁸(99-digit number)
36196972067248111105…45320181422813022081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.239 × 10⁹⁸(99-digit number)
72393944134496222211…90640362845626044161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.447 × 10⁹⁹(100-digit number)
14478788826899244442…81280725691252088321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.895 × 10⁹⁹(100-digit number)
28957577653798488884…62561451382504176641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.791 × 10⁹⁹(100-digit number)
57915155307596977768…25122902765008353281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.158 × 10¹⁰⁰(101-digit number)
11583031061519395553…50245805530016706561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.316 × 10¹⁰⁰(101-digit number)
23166062123038791107…00491611060033413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.633 × 10¹⁰⁰(101-digit number)
46332124246077582215…00983222120066826241
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,857,930 XPM·at block #6,826,721 · 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