Block #807,572

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/12/2014, 5:37:51 AM · Difficulty 10.9739 · 6,019,049 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
57b317dd9adc31725bdb68da4f77a183fd72ed46d40569990078122aba3f6aab

Height

#807,572

Difficulty

10.973923

Transactions

9

Size

2.98 KB

Version

2

Bits

0af952fd

Nonce

2,049,946,838

Timestamp

11/12/2014, 5:37:51 AM

Confirmations

6,019,049

Merkle Root

68f75de337274712f36dfc1188502813d74582f960fb6779fb33a8c2b96764c4
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.

1.913 × 10⁹⁶(97-digit number)
19132410090848342860…68714190208746770561
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
1.913 × 10⁹⁶(97-digit number)
19132410090848342860…68714190208746770561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.826 × 10⁹⁶(97-digit number)
38264820181696685721…37428380417493541121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.652 × 10⁹⁶(97-digit number)
76529640363393371442…74856760834987082241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.530 × 10⁹⁷(98-digit number)
15305928072678674288…49713521669974164481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.061 × 10⁹⁷(98-digit number)
30611856145357348576…99427043339948328961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.122 × 10⁹⁷(98-digit number)
61223712290714697153…98854086679896657921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.224 × 10⁹⁸(99-digit number)
12244742458142939430…97708173359793315841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.448 × 10⁹⁸(99-digit number)
24489484916285878861…95416346719586631681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.897 × 10⁹⁸(99-digit number)
48978969832571757722…90832693439173263361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.795 × 10⁹⁸(99-digit number)
97957939665143515445…81665386878346526721
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,121 XPM·at block #6,826,620 · 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