Block #354,525

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2014, 2:41:23 PM · Difficulty 10.3439 · 6,452,217 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
644da76602672bfd6b151f0be9a60b714b04ad31d2588f8e3844df790a994aad

Height

#354,525

Difficulty

10.343855

Transactions

10

Size

2.33 KB

Version

2

Bits

0a5806e5

Nonce

92,147

Timestamp

1/11/2014, 2:41:23 PM

Confirmations

6,452,217

Merkle Root

2ec9d7747645ff6a460bae9aaa9ebf840b98a5111fe113c5ef0a7b499b9214df
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.

3.294 × 10⁹⁸(99-digit number)
32941303974453628054…41512364947220671979
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
3.294 × 10⁹⁸(99-digit number)
32941303974453628054…41512364947220671979
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.588 × 10⁹⁸(99-digit number)
65882607948907256108…83024729894441343959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.317 × 10⁹⁹(100-digit number)
13176521589781451221…66049459788882687919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.635 × 10⁹⁹(100-digit number)
26353043179562902443…32098919577765375839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.270 × 10⁹⁹(100-digit number)
52706086359125804886…64197839155530751679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.054 × 10¹⁰⁰(101-digit number)
10541217271825160977…28395678311061503359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.108 × 10¹⁰⁰(101-digit number)
21082434543650321954…56791356622123006719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.216 × 10¹⁰⁰(101-digit number)
42164869087300643909…13582713244246013439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.432 × 10¹⁰⁰(101-digit number)
84329738174601287818…27165426488492026879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.686 × 10¹⁰¹(102-digit number)
16865947634920257563…54330852976984053759
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,698,033 XPM·at block #6,806,741 · 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