Block #609,337

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/1/2014, 4:03:32 AM · Difficulty 10.9116 · 6,207,932 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2b2acef5a95bcb6a89de3baf67e4268d74425183523ba359b5a6c03bf4660aef

Height

#609,337

Difficulty

10.911609

Transactions

3

Size

919 B

Version

2

Bits

0ae95f3b

Nonce

2,110,801,005

Timestamp

7/1/2014, 4:03:32 AM

Confirmations

6,207,932

Merkle Root

0b233b8a8dc83ab9d80a507e02b5f61d36ac92d4707119cdfad3ac4a06052709
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.

4.410 × 10⁹⁵(96-digit number)
44102858171566634375…39460749759466254801
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
4.410 × 10⁹⁵(96-digit number)
44102858171566634375…39460749759466254801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.820 × 10⁹⁵(96-digit number)
88205716343133268751…78921499518932509601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.764 × 10⁹⁶(97-digit number)
17641143268626653750…57842999037865019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.528 × 10⁹⁶(97-digit number)
35282286537253307500…15685998075730038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.056 × 10⁹⁶(97-digit number)
70564573074506615001…31371996151460076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.411 × 10⁹⁷(98-digit number)
14112914614901323000…62743992302920153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.822 × 10⁹⁷(98-digit number)
28225829229802646000…25487984605840307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.645 × 10⁹⁷(98-digit number)
56451658459605292001…50975969211680614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.129 × 10⁹⁸(99-digit number)
11290331691921058400…01951938423361228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.258 × 10⁹⁸(99-digit number)
22580663383842116800…03903876846722457601
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,782,189 XPM·at block #6,817,268 · 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