Block #300,632

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2013, 5:02:36 PM · Difficulty 9.9924 · 6,526,376 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a79ee7b9b9a5d256d82c518fbc590edd3b55f346f8df910045198e9fa3d9191d

Height

#300,632

Difficulty

9.992358

Transactions

12

Size

2.91 KB

Version

2

Bits

09fe0b25

Nonce

60,930

Timestamp

12/8/2013, 5:02:36 PM

Confirmations

6,526,376

Merkle Root

2410c12ef0c2eeed7221c71519d1f2bc2c1e40fbd2c3b0a0f8f5b5bd72f7e066
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.

4.960 × 10⁹¹(92-digit number)
49605018549577400217…67516620645497654901
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
4.960 × 10⁹¹(92-digit number)
49605018549577400217…67516620645497654901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.921 × 10⁹¹(92-digit number)
99210037099154800434…35033241290995309801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.984 × 10⁹²(93-digit number)
19842007419830960086…70066482581990619601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.968 × 10⁹²(93-digit number)
39684014839661920173…40132965163981239201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.936 × 10⁹²(93-digit number)
79368029679323840347…80265930327962478401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.587 × 10⁹³(94-digit number)
15873605935864768069…60531860655924956801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.174 × 10⁹³(94-digit number)
31747211871729536138…21063721311849913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.349 × 10⁹³(94-digit number)
63494423743459072277…42127442623699827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.269 × 10⁹⁴(95-digit number)
12698884748691814455…84254885247399654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.539 × 10⁹⁴(95-digit number)
25397769497383628911…68509770494799308801
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,860,240 XPM·at block #6,827,007 · 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