Block #333,380

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/28/2013, 6:06:13 PM · Difficulty 10.1624 · 6,473,371 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ae6ef951ca08bd39e6a177f4718d998678041f81a7b85e08f75618961471c7fb

Height

#333,380

Difficulty

10.162410

Transactions

17

Size

12.05 KB

Version

2

Bits

0a2993b5

Nonce

12,658

Timestamp

12/28/2013, 6:06:13 PM

Confirmations

6,473,371

Merkle Root

d282024e1514adc85f1b207de4f5cb5d213d7749471b2a6ddf3d2d5864dac17f
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.075 × 10⁹⁷(98-digit number)
20754410481984852537…69223328545807596799
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.075 × 10⁹⁷(98-digit number)
20754410481984852537…69223328545807596799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.150 × 10⁹⁷(98-digit number)
41508820963969705074…38446657091615193599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.301 × 10⁹⁷(98-digit number)
83017641927939410149…76893314183230387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.660 × 10⁹⁸(99-digit number)
16603528385587882029…53786628366460774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.320 × 10⁹⁸(99-digit number)
33207056771175764059…07573256732921548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.641 × 10⁹⁸(99-digit number)
66414113542351528119…15146513465843097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.328 × 10⁹⁹(100-digit number)
13282822708470305623…30293026931686195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.656 × 10⁹⁹(100-digit number)
26565645416940611247…60586053863372390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.313 × 10⁹⁹(100-digit number)
53131290833881222495…21172107726744780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.062 × 10¹⁰⁰(101-digit number)
10626258166776244499…42344215453489561599
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,698,107 XPM·at block #6,806,750 · 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