Block #590,275

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/16/2014, 4:34:50 AM · Difficulty 10.9457 · 6,219,636 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
79c4bd60d9f064ac711731605c88bcfd5d95e256fc30428006dfc77ce9f84d0e

Height

#590,275

Difficulty

10.945732

Transactions

7

Size

1.96 KB

Version

2

Bits

0af21b7c

Nonce

41,225,059

Timestamp

6/16/2014, 4:34:50 AM

Confirmations

6,219,636

Merkle Root

f346ee9d01573e20cb3b58b6e4195c52344e4138c2feb9373d15683534528f0c
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.345 × 10⁹⁷(98-digit number)
23458301111901396422…91967399732346999301
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.345 × 10⁹⁷(98-digit number)
23458301111901396422…91967399732346999301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.691 × 10⁹⁷(98-digit number)
46916602223802792844…83934799464693998601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.383 × 10⁹⁷(98-digit number)
93833204447605585688…67869598929387997201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.876 × 10⁹⁸(99-digit number)
18766640889521117137…35739197858775994401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.753 × 10⁹⁸(99-digit number)
37533281779042234275…71478395717551988801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.506 × 10⁹⁸(99-digit number)
75066563558084468551…42956791435103977601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.501 × 10⁹⁹(100-digit number)
15013312711616893710…85913582870207955201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.002 × 10⁹⁹(100-digit number)
30026625423233787420…71827165740415910401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.005 × 10⁹⁹(100-digit number)
60053250846467574840…43654331480831820801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.201 × 10¹⁰⁰(101-digit number)
12010650169293514968…87308662961663641601
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,723,372 XPM·at block #6,809,910 · 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