Block #593,686

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/18/2014, 10:08:23 PM · Difficulty 10.9399 · 6,222,182 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
479117138b572586006c0f884cb7956e4c99a1e10b4f228596f5387f5fe64078

Height

#593,686

Difficulty

10.939939

Transactions

4

Size

888 B

Version

2

Bits

0af09fdd

Nonce

777,705,957

Timestamp

6/18/2014, 10:08:23 PM

Confirmations

6,222,182

Merkle Root

e2f9ecf6039898a3a3b6e382cc3cd5ccbba8521aa008f98db5803742e5cb6dd1
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.387 × 10⁹⁹(100-digit number)
13873318725275643300…83340404666801861121
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.387 × 10⁹⁹(100-digit number)
13873318725275643300…83340404666801861121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.774 × 10⁹⁹(100-digit number)
27746637450551286600…66680809333603722241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.549 × 10⁹⁹(100-digit number)
55493274901102573200…33361618667207444481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.109 × 10¹⁰⁰(101-digit number)
11098654980220514640…66723237334414888961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.219 × 10¹⁰⁰(101-digit number)
22197309960441029280…33446474668829777921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.439 × 10¹⁰⁰(101-digit number)
44394619920882058560…66892949337659555841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.878 × 10¹⁰⁰(101-digit number)
88789239841764117121…33785898675319111681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.775 × 10¹⁰¹(102-digit number)
17757847968352823424…67571797350638223361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.551 × 10¹⁰¹(102-digit number)
35515695936705646848…35143594701276446721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.103 × 10¹⁰¹(102-digit number)
71031391873411293696…70287189402552893441
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,771,057 XPM·at block #6,815,867 · 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