Block #330,978

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/27/2013, 1:21:24 AM · Difficulty 10.1686 · 6,493,848 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3c6c972f4bc36a81b06dd58363100794cfc2b85d95388c26632f6a5a5047a134

Height

#330,978

Difficulty

10.168594

Transactions

20

Size

4.76 KB

Version

2

Bits

0a2b28fe

Nonce

182,261

Timestamp

12/27/2013, 1:21:24 AM

Confirmations

6,493,848

Merkle Root

b147b764654f5a81b587ef53dae6277351c7b088b5cae54253d10e38ab6f9796
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.841 × 10⁹⁶(97-digit number)
18418530651732104120…08927260665424111599
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.841 × 10⁹⁶(97-digit number)
18418530651732104120…08927260665424111599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.683 × 10⁹⁶(97-digit number)
36837061303464208241…17854521330848223199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.367 × 10⁹⁶(97-digit number)
73674122606928416482…35709042661696446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.473 × 10⁹⁷(98-digit number)
14734824521385683296…71418085323392892799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.946 × 10⁹⁷(98-digit number)
29469649042771366592…42836170646785785599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.893 × 10⁹⁷(98-digit number)
58939298085542733185…85672341293571571199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.178 × 10⁹⁸(99-digit number)
11787859617108546637…71344682587143142399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.357 × 10⁹⁸(99-digit number)
23575719234217093274…42689365174286284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.715 × 10⁹⁸(99-digit number)
47151438468434186548…85378730348572569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.430 × 10⁹⁸(99-digit number)
94302876936868373097…70757460697145139199
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,842,687 XPM·at block #6,824,825 · 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.
Privacy Policy·

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