Block #305,480

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2013, 12:52:45 PM · Difficulty 9.9936 · 6,504,280 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c8f7bcf5bfad7036251c5f2ce9dbed943a4b4469c5882d171723be298063df4b

Height

#305,480

Difficulty

9.993591

Transactions

1

Size

1004 B

Version

2

Bits

09fe5bf9

Nonce

200,460

Timestamp

12/11/2013, 12:52:45 PM

Confirmations

6,504,280

Merkle Root

1af0b9e17c6e76e1c513e766c1ab0217f965a6bb0f3d1e226f7bc6fa16485f80
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.

5.936 × 10⁹⁶(97-digit number)
59368140870405979621…05879742957436972801
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
5.936 × 10⁹⁶(97-digit number)
59368140870405979621…05879742957436972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.187 × 10⁹⁷(98-digit number)
11873628174081195924…11759485914873945601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.374 × 10⁹⁷(98-digit number)
23747256348162391848…23518971829747891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.749 × 10⁹⁷(98-digit number)
47494512696324783697…47037943659495782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.498 × 10⁹⁷(98-digit number)
94989025392649567394…94075887318991564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.899 × 10⁹⁸(99-digit number)
18997805078529913478…88151774637983129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.799 × 10⁹⁸(99-digit number)
37995610157059826957…76303549275966259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.599 × 10⁹⁸(99-digit number)
75991220314119653915…52607098551932518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.519 × 10⁹⁹(100-digit number)
15198244062823930783…05214197103865036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.039 × 10⁹⁹(100-digit number)
30396488125647861566…10428394207730073601
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,722,166 XPM·at block #6,809,759 · 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