Block #439,354

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/11/2014, 3:16:10 PM · Difficulty 10.3601 · 6,369,936 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0f232284562374ee994c66d1636b48511cb4f7435941526eae7e8825d31a222c

Height

#439,354

Difficulty

10.360052

Transactions

9

Size

3.19 KB

Version

2

Bits

0a5c2c64

Nonce

27,260

Timestamp

3/11/2014, 3:16:10 PM

Confirmations

6,369,936

Merkle Root

3554bd6f1ce67a1013525c99ed8a8f6f029fc1419bafdf82915674a31a311018
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.

1.111 × 10⁹⁹(100-digit number)
11112633567589488112…28150755987844378879
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
1.111 × 10⁹⁹(100-digit number)
11112633567589488112…28150755987844378879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.222 × 10⁹⁹(100-digit number)
22225267135178976224…56301511975688757759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.445 × 10⁹⁹(100-digit number)
44450534270357952448…12603023951377515519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.890 × 10⁹⁹(100-digit number)
88901068540715904897…25206047902755031039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.778 × 10¹⁰⁰(101-digit number)
17780213708143180979…50412095805510062079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.556 × 10¹⁰⁰(101-digit number)
35560427416286361959…00824191611020124159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.112 × 10¹⁰⁰(101-digit number)
71120854832572723918…01648383222040248319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.422 × 10¹⁰¹(102-digit number)
14224170966514544783…03296766444080496639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.844 × 10¹⁰¹(102-digit number)
28448341933029089567…06593532888160993279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.689 × 10¹⁰¹(102-digit number)
56896683866058179134…13187065776321986559
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,718,389 XPM·at block #6,809,289 · 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