Block #583,214

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/10/2014, 9:45:31 AM · Difficulty 10.9576 · 6,226,347 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
72770d8e6f7adf203e702fc750faaf4c0e82de8e859287a96ba995cc1e130134

Height

#583,214

Difficulty

10.957601

Transactions

3

Size

809 B

Version

2

Bits

0af5255a

Nonce

118,043,358

Timestamp

6/10/2014, 9:45:31 AM

Confirmations

6,226,347

Merkle Root

5d6e48b6405b136f7bfe939daf78c453261fecf5358a601e38cbf6b25e8a6424
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.229 × 10⁹⁸(99-digit number)
82299292108007056922…57006841920068126721
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.229 × 10⁹⁸(99-digit number)
82299292108007056922…57006841920068126721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.645 × 10⁹⁹(100-digit number)
16459858421601411384…14013683840136253441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.291 × 10⁹⁹(100-digit number)
32919716843202822768…28027367680272506881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.583 × 10⁹⁹(100-digit number)
65839433686405645537…56054735360545013761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.316 × 10¹⁰⁰(101-digit number)
13167886737281129107…12109470721090027521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.633 × 10¹⁰⁰(101-digit number)
26335773474562258215…24218941442180055041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.267 × 10¹⁰⁰(101-digit number)
52671546949124516430…48437882884360110081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.053 × 10¹⁰¹(102-digit number)
10534309389824903286…96875765768720220161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.106 × 10¹⁰¹(102-digit number)
21068618779649806572…93751531537440440321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.213 × 10¹⁰¹(102-digit number)
42137237559299613144…87503063074880880641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.427 × 10¹⁰¹(102-digit number)
84274475118599226288…75006126149761761281
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,720,562 XPM·at block #6,809,560 · 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