Block #431,318

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/6/2014, 3:46:27 AM · Difficulty 10.3370 · 6,411,464 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
98123ef39700d696c7ae9b456d4be41a04b9de5c33444bc7efae2fd50d774023

Height

#431,318

Difficulty

10.337025

Transactions

2

Size

1.42 KB

Version

2

Bits

0a56473f

Nonce

4,679

Timestamp

3/6/2014, 3:46:27 AM

Confirmations

6,411,464

Merkle Root

e9750b201cc391edd7b5f7d995753a6281276c1baceb402890e60095b0b73e21
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.070 × 10⁹⁷(98-digit number)
10708215301076686959…88465975277861785601
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.070 × 10⁹⁷(98-digit number)
10708215301076686959…88465975277861785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.141 × 10⁹⁷(98-digit number)
21416430602153373918…76931950555723571201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.283 × 10⁹⁷(98-digit number)
42832861204306747837…53863901111447142401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.566 × 10⁹⁷(98-digit number)
85665722408613495675…07727802222894284801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.713 × 10⁹⁸(99-digit number)
17133144481722699135…15455604445788569601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.426 × 10⁹⁸(99-digit number)
34266288963445398270…30911208891577139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.853 × 10⁹⁸(99-digit number)
68532577926890796540…61822417783154278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.370 × 10⁹⁹(100-digit number)
13706515585378159308…23644835566308556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.741 × 10⁹⁹(100-digit number)
27413031170756318616…47289671132617113601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.482 × 10⁹⁹(100-digit number)
54826062341512637232…94579342265234227201
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,986,595 XPM·at block #6,842,781 · 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