Block #440,119

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/12/2014, 5:06:12 AM · Difficulty 10.3523 · 6,367,072 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e69ea628970a243169833da86873aa9cdcf1c57cff7a7f72bf9584d1976dfaac

Height

#440,119

Difficulty

10.352305

Transactions

6

Size

1.76 KB

Version

2

Bits

0a5a30b0

Nonce

236,736

Timestamp

3/12/2014, 5:06:12 AM

Confirmations

6,367,072

Merkle Root

6b4e009b1a51eb6a3e471066ad17f8cde0b123bda408f0064cc245f0f986f14d
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.

6.828 × 10⁹⁹(100-digit number)
68287847123528336248…04533182640182431039
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
6.828 × 10⁹⁹(100-digit number)
68287847123528336248…04533182640182431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.365 × 10¹⁰⁰(101-digit number)
13657569424705667249…09066365280364862079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.731 × 10¹⁰⁰(101-digit number)
27315138849411334499…18132730560729724159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.463 × 10¹⁰⁰(101-digit number)
54630277698822668998…36265461121459448319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.092 × 10¹⁰¹(102-digit number)
10926055539764533799…72530922242918896639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.185 × 10¹⁰¹(102-digit number)
21852111079529067599…45061844485837793279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.370 × 10¹⁰¹(102-digit number)
43704222159058135199…90123688971675586559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.740 × 10¹⁰¹(102-digit number)
87408444318116270398…80247377943351173119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.748 × 10¹⁰²(103-digit number)
17481688863623254079…60494755886702346239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.496 × 10¹⁰²(103-digit number)
34963377727246508159…20989511773404692479
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,701,540 XPM·at block #6,807,190 · 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