Block #589,928

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/15/2014, 9:14:51 PM · Difficulty 10.9467 · 6,217,986 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6804a17597a3c5e0c39cfe1dae23b47c22b8bd8c9a15683a419c72d18c2ce6b0

Height

#589,928

Difficulty

10.946734

Transactions

6

Size

1.45 KB

Version

2

Bits

0af25d25

Nonce

10,815

Timestamp

6/15/2014, 9:14:51 PM

Confirmations

6,217,986

Merkle Root

010c70face55871eddfff00460fe04adb2ca113e73776742fc2d3f95a4d5334a
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.

9.277 × 10⁹⁸(99-digit number)
92779729133568515749…19490251582938368001
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
9.277 × 10⁹⁸(99-digit number)
92779729133568515749…19490251582938368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.855 × 10⁹⁹(100-digit number)
18555945826713703149…38980503165876736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.711 × 10⁹⁹(100-digit number)
37111891653427406299…77961006331753472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.422 × 10⁹⁹(100-digit number)
74223783306854812599…55922012663506944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.484 × 10¹⁰⁰(101-digit number)
14844756661370962519…11844025327013888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.968 × 10¹⁰⁰(101-digit number)
29689513322741925039…23688050654027776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.937 × 10¹⁰⁰(101-digit number)
59379026645483850079…47376101308055552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.187 × 10¹⁰¹(102-digit number)
11875805329096770015…94752202616111104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.375 × 10¹⁰¹(102-digit number)
23751610658193540031…89504405232222208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.750 × 10¹⁰¹(102-digit number)
47503221316387080063…79008810464444416001
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,707,347 XPM·at block #6,807,913 · 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