Block #414,144

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/21/2014, 5:54:00 PM · Difficulty 10.4142 · 6,403,675 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2ed66f8ff88929b5f3209843d9fd9311a70977b52a05284953ce44ed5169b310

Height

#414,144

Difficulty

10.414204

Transactions

3

Size

5.28 KB

Version

2

Bits

0a6a0947

Nonce

60,464

Timestamp

2/21/2014, 5:54:00 PM

Confirmations

6,403,675

Merkle Root

0144b32c8480522931f673f75edb297faf0e96427d882c8a777c0567b1ea1787
Transactions (3)
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.098 × 10⁹⁹(100-digit number)
20984363098380198038…62285522297159792639
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.098 × 10⁹⁹(100-digit number)
20984363098380198038…62285522297159792639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.196 × 10⁹⁹(100-digit number)
41968726196760396076…24571044594319585279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.393 × 10⁹⁹(100-digit number)
83937452393520792152…49142089188639170559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.678 × 10¹⁰⁰(101-digit number)
16787490478704158430…98284178377278341119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.357 × 10¹⁰⁰(101-digit number)
33574980957408316861…96568356754556682239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.714 × 10¹⁰⁰(101-digit number)
67149961914816633722…93136713509113364479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.342 × 10¹⁰¹(102-digit number)
13429992382963326744…86273427018226728959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.685 × 10¹⁰¹(102-digit number)
26859984765926653488…72546854036453457919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.371 × 10¹⁰¹(102-digit number)
53719969531853306977…45093708072906915839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.074 × 10¹⁰²(103-digit number)
10743993906370661395…90187416145813831679
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,786,615 XPM·at block #6,817,818 · 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.
Privacy Policy·

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