Block #330,230

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/26/2013, 12:44:24 PM · Difficulty 10.1698 · 6,476,080 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a06eca2b2aaf2deeebc48c344fa825379fc9870aec002a4700a5bcd74f6eac5

Height

#330,230

Difficulty

10.169848

Transactions

11

Size

4.36 KB

Version

2

Bits

0a2b7b29

Nonce

35,425

Timestamp

12/26/2013, 12:44:24 PM

Confirmations

6,476,080

Merkle Root

4197c855b4f7182d4a91d8781e84b550d3283bc4281c3086c75f3be1c9f7af3c
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.243 × 10⁹⁷(98-digit number)
22432660177850283092…83718622257157996801
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.243 × 10⁹⁷(98-digit number)
22432660177850283092…83718622257157996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.486 × 10⁹⁷(98-digit number)
44865320355700566184…67437244514315993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.973 × 10⁹⁷(98-digit number)
89730640711401132369…34874489028631987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.794 × 10⁹⁸(99-digit number)
17946128142280226473…69748978057263974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.589 × 10⁹⁸(99-digit number)
35892256284560452947…39497956114527948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.178 × 10⁹⁸(99-digit number)
71784512569120905895…78995912229055897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.435 × 10⁹⁹(100-digit number)
14356902513824181179…57991824458111795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.871 × 10⁹⁹(100-digit number)
28713805027648362358…15983648916223590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.742 × 10⁹⁹(100-digit number)
57427610055296724716…31967297832447180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.148 × 10¹⁰⁰(101-digit number)
11485522011059344943…63934595664894361601
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,694,568 XPM·at block #6,806,309 · 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