Block #451,183

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/19/2014, 6:26:07 PM · Difficulty 10.3819 · 6,364,734 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee8f092f27c51d32e65d9725a5c6c02c2d99c792e6ec88158fbfb4d9f0025100

Height

#451,183

Difficulty

10.381903

Transactions

2

Size

858 B

Version

2

Bits

0a61c465

Nonce

28,059,336

Timestamp

3/19/2014, 6:26:07 PM

Confirmations

6,364,734

Merkle Root

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

4.731 × 10⁹⁵(96-digit number)
47312056030247135444…07037970171770824799
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
4.731 × 10⁹⁵(96-digit number)
47312056030247135444…07037970171770824799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.462 × 10⁹⁵(96-digit number)
94624112060494270889…14075940343541649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.892 × 10⁹⁶(97-digit number)
18924822412098854177…28151880687083299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.784 × 10⁹⁶(97-digit number)
37849644824197708355…56303761374166598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.569 × 10⁹⁶(97-digit number)
75699289648395416711…12607522748333196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.513 × 10⁹⁷(98-digit number)
15139857929679083342…25215045496666393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.027 × 10⁹⁷(98-digit number)
30279715859358166684…50430090993332787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.055 × 10⁹⁷(98-digit number)
60559431718716333369…00860181986665574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.211 × 10⁹⁸(99-digit number)
12111886343743266673…01720363973331148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.422 × 10⁹⁸(99-digit number)
24223772687486533347…03440727946662297599
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,771,446 XPM·at block #6,815,916 · 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