Block #580,042

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/7/2014, 10:13:14 AM · Difficulty 10.9660 · 6,234,172 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
90409fc92e4c985b729ee87ed6315f8d3ee0fe80825a7e5ab483e58ed14c9a9f

Height

#580,042

Difficulty

10.965969

Transactions

6

Size

8.24 KB

Version

2

Bits

0af749b8

Nonce

26,848,201

Timestamp

6/7/2014, 10:13:14 AM

Confirmations

6,234,172

Merkle Root

a5d6b4dbbfd683586d7aec9034f91a1e550880ae80c5a5a52db12bb99ccc3067
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.425 × 10⁹⁷(98-digit number)
14256206421442605244…36778072602023435501
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.425 × 10⁹⁷(98-digit number)
14256206421442605244…36778072602023435501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.851 × 10⁹⁷(98-digit number)
28512412842885210489…73556145204046871001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.702 × 10⁹⁷(98-digit number)
57024825685770420979…47112290408093742001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.140 × 10⁹⁸(99-digit number)
11404965137154084195…94224580816187484001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.280 × 10⁹⁸(99-digit number)
22809930274308168391…88449161632374968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.561 × 10⁹⁸(99-digit number)
45619860548616336783…76898323264749936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.123 × 10⁹⁸(99-digit number)
91239721097232673566…53796646529499872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.824 × 10⁹⁹(100-digit number)
18247944219446534713…07593293058999744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.649 × 10⁹⁹(100-digit number)
36495888438893069426…15186586117999488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.299 × 10⁹⁹(100-digit number)
72991776877786138853…30373172235998976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.459 × 10¹⁰⁰(101-digit number)
14598355375557227770…60746344471997952001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,757,780 XPM·at block #6,814,213 · 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