Block #304,277

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2013, 8:28:06 PM · Difficulty 9.9933 · 6,509,660 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
33a4eb3e19a369b76808abca58ccadd95c7d395859d8c5bed5510549143d6597

Height

#304,277

Difficulty

9.993269

Transactions

7

Size

2.02 KB

Version

2

Bits

09fe46dc

Nonce

185,308

Timestamp

12/10/2013, 8:28:06 PM

Confirmations

6,509,660

Merkle Root

5468f73b4fa49000ebf2079835ad2c938ff0ecbc3ec7c614808269d2118b25c4
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.154 × 10⁹³(94-digit number)
41546657906956941257…92781479520055140241
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.154 × 10⁹³(94-digit number)
41546657906956941257…92781479520055140241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.309 × 10⁹³(94-digit number)
83093315813913882514…85562959040110280481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.661 × 10⁹⁴(95-digit number)
16618663162782776502…71125918080220560961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.323 × 10⁹⁴(95-digit number)
33237326325565553005…42251836160441121921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.647 × 10⁹⁴(95-digit number)
66474652651131106011…84503672320882243841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.329 × 10⁹⁵(96-digit number)
13294930530226221202…69007344641764487681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.658 × 10⁹⁵(96-digit number)
26589861060452442404…38014689283528975361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.317 × 10⁹⁵(96-digit number)
53179722120904884809…76029378567057950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.063 × 10⁹⁶(97-digit number)
10635944424180976961…52058757134115901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.127 × 10⁹⁶(97-digit number)
21271888848361953923…04117514268231802881
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,755,572 XPM·at block #6,813,936 · 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