Block #305,950

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2013, 6:43:46 PM · Difficulty 9.9938 · 6,504,425 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
077e6ed104572bd894121f97df696459b22586db646de85df5fed618d8ec1d02

Height

#305,950

Difficulty

9.993754

Transactions

1

Size

1.11 KB

Version

2

Bits

09fe66aa

Nonce

113,516

Timestamp

12/11/2013, 6:43:46 PM

Confirmations

6,504,425

Merkle Root

f01a8fd3ff761b247ec38e7eb1edfdd3383bfc0f1a3a52a1f35af2507c535c7d
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.738 × 10⁹⁴(95-digit number)
87386006517557145504…26792435646012516091
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.738 × 10⁹⁴(95-digit number)
87386006517557145504…26792435646012516091
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.747 × 10⁹⁵(96-digit number)
17477201303511429100…53584871292025032181
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.495 × 10⁹⁵(96-digit number)
34954402607022858201…07169742584050064361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.990 × 10⁹⁵(96-digit number)
69908805214045716403…14339485168100128721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.398 × 10⁹⁶(97-digit number)
13981761042809143280…28678970336200257441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.796 × 10⁹⁶(97-digit number)
27963522085618286561…57357940672400514881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.592 × 10⁹⁶(97-digit number)
55927044171236573122…14715881344801029761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.118 × 10⁹⁷(98-digit number)
11185408834247314624…29431762689602059521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.237 × 10⁹⁷(98-digit number)
22370817668494629249…58863525379204119041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.474 × 10⁹⁷(98-digit number)
44741635336989258498…17727050758408238081
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,727,076 XPM·at block #6,810,374 · 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