Block #615,869

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/4/2014, 6:14:39 AM · Difficulty 10.9417 · 6,192,808 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c62131450b36c88fd0eceecd3de6fb9bdbccfcbe119bcaad1ed95de73c3221b4

Height

#615,869

Difficulty

10.941710

Transactions

6

Size

1.74 KB

Version

2

Bits

0af113e8

Nonce

137,003,886

Timestamp

7/4/2014, 6:14:39 AM

Confirmations

6,192,808

Merkle Root

e05013975e47ead006147f9d69f77d4ce237c48199bd9bf228c163bf9077ea6c
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.526 × 10⁹⁸(99-digit number)
25268706203763931333…15435142384895068161
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.526 × 10⁹⁸(99-digit number)
25268706203763931333…15435142384895068161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.053 × 10⁹⁸(99-digit number)
50537412407527862666…30870284769790136321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.010 × 10⁹⁹(100-digit number)
10107482481505572533…61740569539580272641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.021 × 10⁹⁹(100-digit number)
20214964963011145066…23481139079160545281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.042 × 10⁹⁹(100-digit number)
40429929926022290133…46962278158321090561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.085 × 10⁹⁹(100-digit number)
80859859852044580266…93924556316642181121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.617 × 10¹⁰⁰(101-digit number)
16171971970408916053…87849112633284362241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.234 × 10¹⁰⁰(101-digit number)
32343943940817832106…75698225266568724481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.468 × 10¹⁰⁰(101-digit number)
64687887881635664213…51396450533137448961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.293 × 10¹⁰¹(102-digit number)
12937577576327132842…02792901066274897921
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,713,462 XPM·at block #6,808,676 · 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