Block #428,858

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/4/2014, 9:45:50 AM · Difficulty 10.3430 · 6,388,855 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
18f906b932765e0e9f61c0aea4fbf9a43d283a25a110958d459ad032a6a8d373

Height

#428,858

Difficulty

10.343021

Transactions

2

Size

1.44 KB

Version

2

Bits

0a57d03b

Nonce

342,626

Timestamp

3/4/2014, 9:45:50 AM

Confirmations

6,388,855

Merkle Root

c78e474f9dbcd94a449a7352d7615ea80a11be354c6dbe371b05cd099cf11cb8
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.474 × 10⁹⁶(97-digit number)
14742902682339233074…54029948453244516641
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.474 × 10⁹⁶(97-digit number)
14742902682339233074…54029948453244516641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.948 × 10⁹⁶(97-digit number)
29485805364678466148…08059896906489033281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.897 × 10⁹⁶(97-digit number)
58971610729356932296…16119793812978066561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.179 × 10⁹⁷(98-digit number)
11794322145871386459…32239587625956133121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.358 × 10⁹⁷(98-digit number)
23588644291742772918…64479175251912266241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.717 × 10⁹⁷(98-digit number)
47177288583485545836…28958350503824532481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.435 × 10⁹⁷(98-digit number)
94354577166971091673…57916701007649064961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.887 × 10⁹⁸(99-digit number)
18870915433394218334…15833402015298129921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.774 × 10⁹⁸(99-digit number)
37741830866788436669…31666804030596259841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.548 × 10⁹⁸(99-digit number)
75483661733576873339…63333608061192519681
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,785,764 XPM·at block #6,817,712 · 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