Block #330,406

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/26/2013, 3:47:28 PM · Difficulty 10.1689 · 6,477,537 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f8b5449758071cfbcf7f288536586f80db2afb7106020f6e3056b9cdaf5f3cb3

Height

#330,406

Difficulty

10.168881

Transactions

14

Size

42.01 KB

Version

2

Bits

0a2b3bc6

Nonce

276,090

Timestamp

12/26/2013, 3:47:28 PM

Confirmations

6,477,537

Merkle Root

29c2ab7cea32990950db2de11a8646c46e94fffa98db41a0b93ca0a1efb62ea3
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.

1.703 × 10⁹⁸(99-digit number)
17038944949123448867…11687510738801763841
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
1.703 × 10⁹⁸(99-digit number)
17038944949123448867…11687510738801763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.407 × 10⁹⁸(99-digit number)
34077889898246897734…23375021477603527681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.815 × 10⁹⁸(99-digit number)
68155779796493795469…46750042955207055361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.363 × 10⁹⁹(100-digit number)
13631155959298759093…93500085910414110721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.726 × 10⁹⁹(100-digit number)
27262311918597518187…87000171820828221441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.452 × 10⁹⁹(100-digit number)
54524623837195036375…74000343641656442881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.090 × 10¹⁰⁰(101-digit number)
10904924767439007275…48000687283312885761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.180 × 10¹⁰⁰(101-digit number)
21809849534878014550…96001374566625771521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.361 × 10¹⁰⁰(101-digit number)
43619699069756029100…92002749133251543041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.723 × 10¹⁰⁰(101-digit number)
87239398139512058200…84005498266503086081
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,707,583 XPM·at block #6,807,942 · 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