Block #438,559

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2014, 2:26:53 AM · Difficulty 10.3563 · 6,371,064 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
66cb38ae22634cb78eff7428949711ec1755e303ba3e8bae68a82b8bc3196514

Height

#438,559

Difficulty

10.356348

Transactions

1

Size

970 B

Version

2

Bits

0a5b39a3

Nonce

17,831

Timestamp

3/11/2014, 2:26:53 AM

Confirmations

6,371,064

Merkle Root

c2a9270cb25f26c382cd9b17d6bc61beeaae3663bb745f4f4afd3fcba5a4d630
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.077 × 10⁹⁷(98-digit number)
10770358464451824426…74352746882818374401
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.077 × 10⁹⁷(98-digit number)
10770358464451824426…74352746882818374401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.154 × 10⁹⁷(98-digit number)
21540716928903648853…48705493765636748801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.308 × 10⁹⁷(98-digit number)
43081433857807297706…97410987531273497601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.616 × 10⁹⁷(98-digit number)
86162867715614595413…94821975062546995201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.723 × 10⁹⁸(99-digit number)
17232573543122919082…89643950125093990401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.446 × 10⁹⁸(99-digit number)
34465147086245838165…79287900250187980801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.893 × 10⁹⁸(99-digit number)
68930294172491676330…58575800500375961601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.378 × 10⁹⁹(100-digit number)
13786058834498335266…17151601000751923201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.757 × 10⁹⁹(100-digit number)
27572117668996670532…34303202001503846401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.514 × 10⁹⁹(100-digit number)
55144235337993341064…68606404003007692801
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,721,062 XPM·at block #6,809,622 · 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