Block #417,064

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/23/2014, 9:24:29 PM · Difficulty 10.3957 · 6,396,789 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
00119e332f72c340c85846f956517216f074786369838d33b654c03845be4d9a

Height

#417,064

Difficulty

10.395703

Transactions

10

Size

2.24 KB

Version

2

Bits

0a654cd2

Nonce

138,423

Timestamp

2/23/2014, 9:24:29 PM

Confirmations

6,396,789

Merkle Root

21de55ae72ac05366458f5e0300c51b22683ee0cbd9e40967a515a8a101d872c
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.

4.157 × 10⁹⁸(99-digit number)
41575548025381620117…17930399894342886399
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
4.157 × 10⁹⁸(99-digit number)
41575548025381620117…17930399894342886399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.315 × 10⁹⁸(99-digit number)
83151096050763240235…35860799788685772799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.663 × 10⁹⁹(100-digit number)
16630219210152648047…71721599577371545599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.326 × 10⁹⁹(100-digit number)
33260438420305296094…43443199154743091199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.652 × 10⁹⁹(100-digit number)
66520876840610592188…86886398309486182399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.330 × 10¹⁰⁰(101-digit number)
13304175368122118437…73772796618972364799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.660 × 10¹⁰⁰(101-digit number)
26608350736244236875…47545593237944729599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.321 × 10¹⁰⁰(101-digit number)
53216701472488473750…95091186475889459199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.064 × 10¹⁰¹(102-digit number)
10643340294497694750…90182372951778918399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.128 × 10¹⁰¹(102-digit number)
21286680588995389500…80364745903557836799
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,754,895 XPM·at block #6,813,852 · 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