Block #330,740

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 9:39:19 PM · Difficulty 10.1658 · 6,479,972 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
581667fa90ba45d4bdf556e32ce72f60a456279cde56ec8bd5ccadd20697a90f

Height

#330,740

Difficulty

10.165774

Transactions

1

Size

1003 B

Version

2

Bits

0a2a7027

Nonce

53

Timestamp

12/26/2013, 9:39:19 PM

Confirmations

6,479,972

Merkle Root

244ba404a76ea084ba9594ce3c817279dcb9b0185325c083a570451db505fad0
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.

6.260 × 10⁹⁴(95-digit number)
62607878045054629462…04012698477835145599
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
6.260 × 10⁹⁴(95-digit number)
62607878045054629462…04012698477835145599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.252 × 10⁹⁵(96-digit number)
12521575609010925892…08025396955670291199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.504 × 10⁹⁵(96-digit number)
25043151218021851784…16050793911340582399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.008 × 10⁹⁵(96-digit number)
50086302436043703569…32101587822681164799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.001 × 10⁹⁶(97-digit number)
10017260487208740713…64203175645362329599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.003 × 10⁹⁶(97-digit number)
20034520974417481427…28406351290724659199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.006 × 10⁹⁶(97-digit number)
40069041948834962855…56812702581449318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.013 × 10⁹⁶(97-digit number)
80138083897669925711…13625405162898636799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.602 × 10⁹⁷(98-digit number)
16027616779533985142…27250810325797273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.205 × 10⁹⁷(98-digit number)
32055233559067970284…54501620651594547199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,729,783 XPM·at block #6,810,711 · 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