Block #593,889

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/19/2014, 2:05:16 AM · Difficulty 10.9395 · 6,212,700 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
69131d3bdeebb7682ecacba42be6ee1f1d267893edf5db14bce4ba25700a66eb

Height

#593,889

Difficulty

10.939517

Transactions

10

Size

2.51 KB

Version

2

Bits

0af0842c

Nonce

31,119,425

Timestamp

6/19/2014, 2:05:16 AM

Confirmations

6,212,700

Merkle Root

2e5a306e3a6a6475fb97a0edc826c4a8c30d22d744c15f81dcc4e112d29279da
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.

8.616 × 10⁹⁸(99-digit number)
86167332413877530798…40179607393888294401
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
8.616 × 10⁹⁸(99-digit number)
86167332413877530798…40179607393888294401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.723 × 10⁹⁹(100-digit number)
17233466482775506159…80359214787776588801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.446 × 10⁹⁹(100-digit number)
34466932965551012319…60718429575553177601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.893 × 10⁹⁹(100-digit number)
68933865931102024638…21436859151106355201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.378 × 10¹⁰⁰(101-digit number)
13786773186220404927…42873718302212710401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.757 × 10¹⁰⁰(101-digit number)
27573546372440809855…85747436604425420801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.514 × 10¹⁰⁰(101-digit number)
55147092744881619710…71494873208850841601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.102 × 10¹⁰¹(102-digit number)
11029418548976323942…42989746417701683201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.205 × 10¹⁰¹(102-digit number)
22058837097952647884…85979492835403366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.411 × 10¹⁰¹(102-digit number)
44117674195905295768…71958985670806732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.823 × 10¹⁰¹(102-digit number)
88235348391810591537…43917971341613465601
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,696,809 XPM·at block #6,806,588 · 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