Block #452,081

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2014, 9:17:43 AM · Difficulty 10.3848 · 6,360,399 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e11c785cc06080501cd1beb173ced9f61c23b5c15dfb37b80b0fe601d9a130a3

Height

#452,081

Difficulty

10.384750

Transactions

2

Size

1.05 KB

Version

2

Bits

0a627efa

Nonce

6,511

Timestamp

3/20/2014, 9:17:43 AM

Confirmations

6,360,399

Merkle Root

56cb6d013e99ac0e2f375066d7a07d4e732661235dafee2a9ee9cb697fd111ce
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.749 × 10⁹⁸(99-digit number)
27495594785335930038…84109659381880679039
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.749 × 10⁹⁸(99-digit number)
27495594785335930038…84109659381880679039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.499 × 10⁹⁸(99-digit number)
54991189570671860076…68219318763761358079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.099 × 10⁹⁹(100-digit number)
10998237914134372015…36438637527522716159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.199 × 10⁹⁹(100-digit number)
21996475828268744030…72877275055045432319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.399 × 10⁹⁹(100-digit number)
43992951656537488060…45754550110090864639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.798 × 10⁹⁹(100-digit number)
87985903313074976121…91509100220181729279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.759 × 10¹⁰⁰(101-digit number)
17597180662614995224…83018200440363458559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.519 × 10¹⁰⁰(101-digit number)
35194361325229990448…66036400880726917119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.038 × 10¹⁰⁰(101-digit number)
70388722650459980897…32072801761453834239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.407 × 10¹⁰¹(102-digit number)
14077744530091996179…64145603522907668479
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,743,868 XPM·at block #6,812,479 · 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