Block #458,515

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2014, 3:52:29 PM · Difficulty 10.4202 · 6,368,155 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
644efab7963d7e0c266919ffa9461b22a887bb046f6c9de0bf8788d410bdcf71

Height

#458,515

Difficulty

10.420178

Transactions

2

Size

876 B

Version

2

Bits

0a6b90ce

Nonce

15,762

Timestamp

3/24/2014, 3:52:29 PM

Confirmations

6,368,155

Merkle Root

34ad485c1aa40ff1de2d8d01533c91d5e7ce1abc3e57ff0343cde89d3b335be5
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.

8.789 × 10⁹⁴(95-digit number)
87899738287916937653…24761497073709259199
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
8.789 × 10⁹⁴(95-digit number)
87899738287916937653…24761497073709259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.757 × 10⁹⁵(96-digit number)
17579947657583387530…49522994147418518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.515 × 10⁹⁵(96-digit number)
35159895315166775061…99045988294837036799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.031 × 10⁹⁵(96-digit number)
70319790630333550123…98091976589674073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.406 × 10⁹⁶(97-digit number)
14063958126066710024…96183953179348147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.812 × 10⁹⁶(97-digit number)
28127916252133420049…92367906358696294399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.625 × 10⁹⁶(97-digit number)
56255832504266840098…84735812717392588799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.125 × 10⁹⁷(98-digit number)
11251166500853368019…69471625434785177599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.250 × 10⁹⁷(98-digit number)
22502333001706736039…38943250869570355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.500 × 10⁹⁷(98-digit number)
45004666003413472078…77886501739140710399
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,857,507 XPM·at block #6,826,669 · 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