Block #669,050

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2014, 3:49:26 PM · Difficulty 10.9638 · 6,141,077 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0f719765da4b212f850e13d186535d5b47bc30bb22d5577ba09264ec141da242

Height

#669,050

Difficulty

10.963805

Transactions

4

Size

1.29 KB

Version

2

Bits

0af6bbf5

Nonce

110,820,038

Timestamp

8/8/2014, 3:49:26 PM

Confirmations

6,141,077

Merkle Root

91f2cbde976227e258b9129ac6cdd01ab73c71398bd3b5d4ed51411362e9f474
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.

3.084 × 10⁹⁷(98-digit number)
30849492847918961963…91178291521867366401
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
3.084 × 10⁹⁷(98-digit number)
30849492847918961963…91178291521867366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.169 × 10⁹⁷(98-digit number)
61698985695837923926…82356583043734732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.233 × 10⁹⁸(99-digit number)
12339797139167584785…64713166087469465601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.467 × 10⁹⁸(99-digit number)
24679594278335169570…29426332174938931201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.935 × 10⁹⁸(99-digit number)
49359188556670339140…58852664349877862401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.871 × 10⁹⁸(99-digit number)
98718377113340678281…17705328699755724801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.974 × 10⁹⁹(100-digit number)
19743675422668135656…35410657399511449601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.948 × 10⁹⁹(100-digit number)
39487350845336271312…70821314799022899201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.897 × 10⁹⁹(100-digit number)
78974701690672542625…41642629598045798401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.579 × 10¹⁰⁰(101-digit number)
15794940338134508525…83285259196091596801
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,725,089 XPM·at block #6,810,126 · 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