Block #419,060

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/25/2014, 8:18:26 AM · Difficulty 10.3855 · 6,396,902 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1252afc890cd77a927541843f7d6bc1eda5f9fec06a2889e34b6c6a427e6912b

Height

#419,060

Difficulty

10.385517

Transactions

1

Size

866 B

Version

2

Bits

0a62b13e

Nonce

346,870

Timestamp

2/25/2014, 8:18:26 AM

Confirmations

6,396,902

Merkle Root

d68b4eed5f4cc89bb68c31a0d2f441e5dc03122d5d1e402c47dc38b4c0f9c602
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.

3.281 × 10⁹¹(92-digit number)
32810020763640582501…94613949859192830081
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
3.281 × 10⁹¹(92-digit number)
32810020763640582501…94613949859192830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.562 × 10⁹¹(92-digit number)
65620041527281165002…89227899718385660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.312 × 10⁹²(93-digit number)
13124008305456233000…78455799436771320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.624 × 10⁹²(93-digit number)
26248016610912466001…56911598873542640641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.249 × 10⁹²(93-digit number)
52496033221824932002…13823197747085281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.049 × 10⁹³(94-digit number)
10499206644364986400…27646395494170562561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.099 × 10⁹³(94-digit number)
20998413288729972800…55292790988341125121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.199 × 10⁹³(94-digit number)
41996826577459945601…10585581976682250241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.399 × 10⁹³(94-digit number)
83993653154919891203…21171163953364500481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.679 × 10⁹⁴(95-digit number)
16798730630983978240…42342327906729000961
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,771,811 XPM·at block #6,815,961 · 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