Block #450,346

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/19/2014, 6:02:18 AM · Difficulty 10.3697 · 6,363,671 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8876122e6014aefbc75fb8f9e3a153b702139c3fc6f2033bf12ec0cc212dc354

Height

#450,346

Difficulty

10.369731

Transactions

5

Size

1.08 KB

Version

2

Bits

0a5ea6b8

Nonce

163,169

Timestamp

3/19/2014, 6:02:18 AM

Confirmations

6,363,671

Merkle Root

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

9.599 × 10⁹⁶(97-digit number)
95998434191719071175…98830173974831292899
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
9.599 × 10⁹⁶(97-digit number)
95998434191719071175…98830173974831292899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.919 × 10⁹⁷(98-digit number)
19199686838343814235…97660347949662585799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.839 × 10⁹⁷(98-digit number)
38399373676687628470…95320695899325171599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.679 × 10⁹⁷(98-digit number)
76798747353375256940…90641391798650343199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.535 × 10⁹⁸(99-digit number)
15359749470675051388…81282783597300686399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.071 × 10⁹⁸(99-digit number)
30719498941350102776…62565567194601372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.143 × 10⁹⁸(99-digit number)
61438997882700205552…25131134389202745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.228 × 10⁹⁹(100-digit number)
12287799576540041110…50262268778405491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.457 × 10⁹⁹(100-digit number)
24575599153080082220…00524537556810982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.915 × 10⁹⁹(100-digit number)
49151198306160164441…01049075113621964799
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,756,220 XPM·at block #6,814,016 · 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