Block #419,598

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/25/2014, 6:40:31 PM · Difficulty 10.3750 · 6,390,699 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f9f16eaf3fca4aa8ccf225c96e27f7f31acc214852b021e8df03920d4d2b310f

Height

#419,598

Difficulty

10.375046

Transactions

2

Size

1.72 KB

Version

2

Bits

0a600305

Nonce

4,926,985

Timestamp

2/25/2014, 6:40:31 PM

Confirmations

6,390,699

Merkle Root

71ffd735abeb09d841635ac659095da9426197b6a330a6410de6ad7f794f9e4c
Transactions (2)
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.672 × 10⁹⁴(95-digit number)
66726123478559062127…82675711043820285719
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.672 × 10⁹⁴(95-digit number)
66726123478559062127…82675711043820285719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.334 × 10⁹⁵(96-digit number)
13345224695711812425…65351422087640571439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.669 × 10⁹⁵(96-digit number)
26690449391423624851…30702844175281142879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.338 × 10⁹⁵(96-digit number)
53380898782847249702…61405688350562285759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.067 × 10⁹⁶(97-digit number)
10676179756569449940…22811376701124571519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.135 × 10⁹⁶(97-digit number)
21352359513138899880…45622753402249143039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.270 × 10⁹⁶(97-digit number)
42704719026277799761…91245506804498286079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.540 × 10⁹⁶(97-digit number)
85409438052555599523…82491013608996572159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.708 × 10⁹⁷(98-digit number)
17081887610511119904…64982027217993144319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.416 × 10⁹⁷(98-digit number)
34163775221022239809…29964054435986288639
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,726,453 XPM·at block #6,810,296 · 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