Block #415,488

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/22/2014, 5:37:00 PM · Difficulty 10.4061 · 6,394,025 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
777088539d4c37e6b65bf084be7ab200f92608eaf1c3a171e0837a63f4a29d2a

Height

#415,488

Difficulty

10.406055

Transactions

3

Size

1.99 KB

Version

2

Bits

0a67f338

Nonce

111,656

Timestamp

2/22/2014, 5:37:00 PM

Confirmations

6,394,025

Merkle Root

bd8793782c7ff59ae889b007f1c7bceedad6faf6de2aad546d2ec14264e31272
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.809 × 10⁹⁷(98-digit number)
28090722589903524509…93268174598318937499
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.809 × 10⁹⁷(98-digit number)
28090722589903524509…93268174598318937499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.618 × 10⁹⁷(98-digit number)
56181445179807049019…86536349196637874999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.123 × 10⁹⁸(99-digit number)
11236289035961409803…73072698393275749999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.247 × 10⁹⁸(99-digit number)
22472578071922819607…46145396786551499999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.494 × 10⁹⁸(99-digit number)
44945156143845639215…92290793573102999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.989 × 10⁹⁸(99-digit number)
89890312287691278431…84581587146205999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.797 × 10⁹⁹(100-digit number)
17978062457538255686…69163174292411999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.595 × 10⁹⁹(100-digit number)
35956124915076511372…38326348584823999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.191 × 10⁹⁹(100-digit number)
71912249830153022745…76652697169647999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.438 × 10¹⁰⁰(101-digit number)
14382449966030604549…53305394339295999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.876 × 10¹⁰⁰(101-digit number)
28764899932061209098…06610788678591999999
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,720,179 XPM·at block #6,809,512 · 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