Block #330,944

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2013, 12:47:49 AM · Difficulty 10.1687 · 6,478,778 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
30fdb94ab4023b8aa6495b255422df1c2eb027c2e96f55a167825c642f4c57bb

Height

#330,944

Difficulty

10.168714

Transactions

21

Size

6.95 KB

Version

2

Bits

0a2b30d5

Nonce

135,943

Timestamp

12/27/2013, 12:47:49 AM

Confirmations

6,478,778

Merkle Root

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

3.901 × 10⁹⁹(100-digit number)
39017512330592126101…05606625659141487201
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
3.901 × 10⁹⁹(100-digit number)
39017512330592126101…05606625659141487201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.803 × 10⁹⁹(100-digit number)
78035024661184252202…11213251318282974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.560 × 10¹⁰⁰(101-digit number)
15607004932236850440…22426502636565948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.121 × 10¹⁰⁰(101-digit number)
31214009864473700881…44853005273131897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.242 × 10¹⁰⁰(101-digit number)
62428019728947401762…89706010546263795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.248 × 10¹⁰¹(102-digit number)
12485603945789480352…79412021092527590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.497 × 10¹⁰¹(102-digit number)
24971207891578960704…58824042185055180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.994 × 10¹⁰¹(102-digit number)
49942415783157921409…17648084370110361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.988 × 10¹⁰¹(102-digit number)
99884831566315842819…35296168740220723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.997 × 10¹⁰²(103-digit number)
19976966313263168563…70592337480441446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.995 × 10¹⁰²(103-digit number)
39953932626526337127…41184674960882892801
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,721,857 XPM·at block #6,809,721 · 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