Block #333,006

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/28/2013, 11:37:55 AM · Difficulty 10.1649 · 6,475,366 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0c4969d03d23bef17a89e04d1148cb37305e3153dd30914b4de0db67896112b8

Height

#333,006

Difficulty

10.164884

Transactions

3

Size

1.24 KB

Version

2

Bits

0a2a35d4

Nonce

28,991

Timestamp

12/28/2013, 11:37:55 AM

Confirmations

6,475,366

Merkle Root

a1649c87305c4c26fcfd2b02f3c6dbcba1448e5caf82918a52924ab9bd4476c9
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.565 × 10⁹⁵(96-digit number)
25657636940037275146…07267525307004984561
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.565 × 10⁹⁵(96-digit number)
25657636940037275146…07267525307004984561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.131 × 10⁹⁵(96-digit number)
51315273880074550292…14535050614009969121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.026 × 10⁹⁶(97-digit number)
10263054776014910058…29070101228019938241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.052 × 10⁹⁶(97-digit number)
20526109552029820117…58140202456039876481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.105 × 10⁹⁶(97-digit number)
41052219104059640234…16280404912079752961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.210 × 10⁹⁶(97-digit number)
82104438208119280468…32560809824159505921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.642 × 10⁹⁷(98-digit number)
16420887641623856093…65121619648319011841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.284 × 10⁹⁷(98-digit number)
32841775283247712187…30243239296638023681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.568 × 10⁹⁷(98-digit number)
65683550566495424374…60486478593276047361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.313 × 10⁹⁸(99-digit number)
13136710113299084874…20972957186552094721
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,711,030 XPM·at block #6,808,371 · 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