Block #306,078

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2013, 8:16:26 PM · Difficulty 9.9938 · 6,501,890 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
574bec037e3634ac5be2c81104b71227d3d82d03499f923e23000bed472eba5c

Height

#306,078

Difficulty

9.993801

Transactions

2

Size

1.30 KB

Version

2

Bits

09fe69c3

Nonce

34,388

Timestamp

12/11/2013, 8:16:26 PM

Confirmations

6,501,890

Merkle Root

67a681aa471015ab439e4df8e4b632ede6b8dbbde62601d4903dec7b0dfc9994
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.088 × 10⁹⁵(96-digit number)
10887126551271111519…46269316295092406401
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.088 × 10⁹⁵(96-digit number)
10887126551271111519…46269316295092406401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.177 × 10⁹⁵(96-digit number)
21774253102542223039…92538632590184812801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.354 × 10⁹⁵(96-digit number)
43548506205084446079…85077265180369625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.709 × 10⁹⁵(96-digit number)
87097012410168892159…70154530360739251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.741 × 10⁹⁶(97-digit number)
17419402482033778431…40309060721478502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.483 × 10⁹⁶(97-digit number)
34838804964067556863…80618121442957004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.967 × 10⁹⁶(97-digit number)
69677609928135113727…61236242885914009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.393 × 10⁹⁷(98-digit number)
13935521985627022745…22472485771828019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.787 × 10⁹⁷(98-digit number)
27871043971254045491…44944971543656038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.574 × 10⁹⁷(98-digit number)
55742087942508090982…89889943087312076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.114 × 10⁹⁸(99-digit number)
11148417588501618196…79779886174624153601
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,707,787 XPM·at block #6,807,967 · 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