Block #305,303

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2013, 10:11:44 AM · Difficulty 9.9936 · 6,504,438 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
08b0b30db4b460805819ede6e40d3945c689f06dd19c64e7ea106484625a2d42

Height

#305,303

Difficulty

9.993564

Transactions

4

Size

924 B

Version

2

Bits

09fe5a34

Nonce

76,792

Timestamp

12/11/2013, 10:11:44 AM

Confirmations

6,504,438

Merkle Root

93decea9c3314558f8b0cd9470b4f197c5175d47bbdc82bdfc01a821ff548a70
Transactions (4)
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.

2.400 × 10⁹⁴(95-digit number)
24002063251848032793…71489418471967806801
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
2.400 × 10⁹⁴(95-digit number)
24002063251848032793…71489418471967806801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.800 × 10⁹⁴(95-digit number)
48004126503696065587…42978836943935613601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.600 × 10⁹⁴(95-digit number)
96008253007392131174…85957673887871227201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.920 × 10⁹⁵(96-digit number)
19201650601478426234…71915347775742454401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.840 × 10⁹⁵(96-digit number)
38403301202956852469…43830695551484908801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.680 × 10⁹⁵(96-digit number)
76806602405913704939…87661391102969817601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.536 × 10⁹⁶(97-digit number)
15361320481182740987…75322782205939635201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.072 × 10⁹⁶(97-digit number)
30722640962365481975…50645564411879270401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.144 × 10⁹⁶(97-digit number)
61445281924730963951…01291128823758540801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.228 × 10⁹⁷(98-digit number)
12289056384946192790…02582257647517081601
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,012 XPM·at block #6,809,740 · 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