Block #630,389

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/12/2014, 10:35:51 PM · Difficulty 10.9614 · 6,196,450 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f7637e5c7ff4fa4706dbd371b2138dd045f3fa3131da30bb8d85ae19b7f5003d

Height

#630,389

Difficulty

10.961351

Transactions

5

Size

1.55 KB

Version

2

Bits

0af61b1a

Nonce

439,083,307

Timestamp

7/12/2014, 10:35:51 PM

Confirmations

6,196,450

Merkle Root

95ce6646650b49532fcf061aef2acf5a5ba6178db1091d698806b5ac76e19aba
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.697 × 10⁹⁷(98-digit number)
66977447652495624970…16795636298912972801
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.697 × 10⁹⁷(98-digit number)
66977447652495624970…16795636298912972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.339 × 10⁹⁸(99-digit number)
13395489530499124994…33591272597825945601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.679 × 10⁹⁸(99-digit number)
26790979060998249988…67182545195651891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.358 × 10⁹⁸(99-digit number)
53581958121996499976…34365090391303782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.071 × 10⁹⁹(100-digit number)
10716391624399299995…68730180782607564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.143 × 10⁹⁹(100-digit number)
21432783248798599990…37460361565215129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.286 × 10⁹⁹(100-digit number)
42865566497597199980…74920723130430259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.573 × 10⁹⁹(100-digit number)
85731132995194399961…49841446260860518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.714 × 10¹⁰⁰(101-digit number)
17146226599038879992…99682892521721036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.429 × 10¹⁰⁰(101-digit number)
34292453198077759984…99365785043442073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.858 × 10¹⁰⁰(101-digit number)
68584906396155519969…98731570086884147201
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,858,879 XPM·at block #6,826,838 · 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