Block #449,768

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/18/2014, 7:44:58 PM · Difficulty 10.3737 · 6,364,396 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
af618f9b31e2e1ec6ab54588e4ac6acd230a140117acf29529b7a243f2fd72ce

Height

#449,768

Difficulty

10.373688

Transactions

1

Size

868 B

Version

2

Bits

0a5faa07

Nonce

108,484

Timestamp

3/18/2014, 7:44:58 PM

Confirmations

6,364,396

Merkle Root

4bf408b3032bf7002d2f01224f91d4c37ebc31403e6fb8d03ee09bd0a5a9b3b6
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.241 × 10⁹⁷(98-digit number)
22415201878772654182…24117229122439051129
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.241 × 10⁹⁷(98-digit number)
22415201878772654182…24117229122439051129
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.483 × 10⁹⁷(98-digit number)
44830403757545308364…48234458244878102259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.966 × 10⁹⁷(98-digit number)
89660807515090616728…96468916489756204519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.793 × 10⁹⁸(99-digit number)
17932161503018123345…92937832979512409039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.586 × 10⁹⁸(99-digit number)
35864323006036246691…85875665959024818079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.172 × 10⁹⁸(99-digit number)
71728646012072493382…71751331918049636159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.434 × 10⁹⁹(100-digit number)
14345729202414498676…43502663836099272319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.869 × 10⁹⁹(100-digit number)
28691458404828997353…87005327672198544639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.738 × 10⁹⁹(100-digit number)
57382916809657994706…74010655344397089279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.147 × 10¹⁰⁰(101-digit number)
11476583361931598941…48021310688794178559
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,757,393 XPM·at block #6,814,163 · 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