Block #333,708

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/28/2013, 11:42:38 PM · Difficulty 10.1620 · 6,475,088 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
51713bed2b97d4a5dffabf95225f8529ccbd3cb101eb318d785cf9b7431516a2

Height

#333,708

Difficulty

10.162034

Transactions

9

Size

1.96 KB

Version

2

Bits

0a297b08

Nonce

1,600,232

Timestamp

12/28/2013, 11:42:38 PM

Confirmations

6,475,088

Merkle Root

e35e83e43d99a8e42b0c2e32853f6e5cd7a84309e9d5dc142cb56e61204b6e2d
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.

9.694 × 10⁹⁶(97-digit number)
96943894424625821084…86044246205413216001
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
9.694 × 10⁹⁶(97-digit number)
96943894424625821084…86044246205413216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.938 × 10⁹⁷(98-digit number)
19388778884925164216…72088492410826432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.877 × 10⁹⁷(98-digit number)
38777557769850328433…44176984821652864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.755 × 10⁹⁷(98-digit number)
77555115539700656867…88353969643305728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.551 × 10⁹⁸(99-digit number)
15511023107940131373…76707939286611456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.102 × 10⁹⁸(99-digit number)
31022046215880262746…53415878573222912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.204 × 10⁹⁸(99-digit number)
62044092431760525493…06831757146445824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.240 × 10⁹⁹(100-digit number)
12408818486352105098…13663514292891648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.481 × 10⁹⁹(100-digit number)
24817636972704210197…27327028585783296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.963 × 10⁹⁹(100-digit number)
49635273945408420395…54654057171566592001
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,714,421 XPM·at block #6,808,795 · 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