Block #450,312

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/19/2014, 5:28:15 AM · Difficulty 10.3552 · 6,357,030 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
392ea28fba5ea6fe3bbb04a82f38a4de4fcc2b19ae5aad75b34c3025f7dd46bd

Height

#450,312

Difficulty

10.355227

Transactions

2

Size

1.14 KB

Version

2

Bits

0a5af025

Nonce

18,102

Timestamp

3/19/2014, 5:28:15 AM

Confirmations

6,357,030

Merkle Root

55a9ce02df9268e98335f24e3925b499522c54d78ce15a538907986da335e1f5
Transactions (2)
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.

6.153 × 10⁹⁶(97-digit number)
61530775614608683085…24136162443689362559
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
6.153 × 10⁹⁶(97-digit number)
61530775614608683085…24136162443689362559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.230 × 10⁹⁷(98-digit number)
12306155122921736617…48272324887378725119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.461 × 10⁹⁷(98-digit number)
24612310245843473234…96544649774757450239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.922 × 10⁹⁷(98-digit number)
49224620491686946468…93089299549514900479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.844 × 10⁹⁷(98-digit number)
98449240983373892936…86178599099029800959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.968 × 10⁹⁸(99-digit number)
19689848196674778587…72357198198059601919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.937 × 10⁹⁸(99-digit number)
39379696393349557174…44714396396119203839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.875 × 10⁹⁸(99-digit number)
78759392786699114349…89428792792238407679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.575 × 10⁹⁹(100-digit number)
15751878557339822869…78857585584476815359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.150 × 10⁹⁹(100-digit number)
31503757114679645739…57715171168953630719
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,702,755 XPM·at block #6,807,341 · 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