Block #409,084

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/18/2014, 3:47:15 AM · Difficulty 10.4242 · 6,401,158 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5f6b5b6cb98dbc1f2ab56f7be5a814e5db7cb67fe516bd3e7549958cdb7eefa2

Height

#409,084

Difficulty

10.424151

Transactions

2

Size

1019 B

Version

2

Bits

0a6c9525

Nonce

42,060

Timestamp

2/18/2014, 3:47:15 AM

Confirmations

6,401,158

Merkle Root

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

7.542 × 10⁹⁸(99-digit number)
75423190786845248765…47541444710260687999
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
7.542 × 10⁹⁸(99-digit number)
75423190786845248765…47541444710260687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.508 × 10⁹⁹(100-digit number)
15084638157369049753…95082889420521375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.016 × 10⁹⁹(100-digit number)
30169276314738099506…90165778841042751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.033 × 10⁹⁹(100-digit number)
60338552629476199012…80331557682085503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.206 × 10¹⁰⁰(101-digit number)
12067710525895239802…60663115364171007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.413 × 10¹⁰⁰(101-digit number)
24135421051790479604…21326230728342015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.827 × 10¹⁰⁰(101-digit number)
48270842103580959209…42652461456684031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.654 × 10¹⁰⁰(101-digit number)
96541684207161918419…85304922913368063999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.930 × 10¹⁰¹(102-digit number)
19308336841432383683…70609845826736127999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.861 × 10¹⁰¹(102-digit number)
38616673682864767367…41219691653472255999
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,726,007 XPM·at block #6,810,241 · 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