Block #425,078

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/1/2014, 3:22:56 PM · Difficulty 10.3667 · 6,383,593 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9d99c595c3532ff4bb495939be093680cee98541d82890b26c7d1d749b9bb087

Height

#425,078

Difficulty

10.366730

Transactions

12

Size

4.12 KB

Version

2

Bits

0a5de1fe

Nonce

148,783

Timestamp

3/1/2014, 3:22:56 PM

Confirmations

6,383,593

Merkle Root

8f7d5a080f97910d6ec2ef634949d07ec12fc5ec4b9f225d16db63ebd9f7ba14
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.

6.139 × 10⁹⁹(100-digit number)
61397073479627755165…95942947300313673481
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
6.139 × 10⁹⁹(100-digit number)
61397073479627755165…95942947300313673481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.227 × 10¹⁰⁰(101-digit number)
12279414695925551033…91885894600627346961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.455 × 10¹⁰⁰(101-digit number)
24558829391851102066…83771789201254693921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.911 × 10¹⁰⁰(101-digit number)
49117658783702204132…67543578402509387841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.823 × 10¹⁰⁰(101-digit number)
98235317567404408265…35087156805018775681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.964 × 10¹⁰¹(102-digit number)
19647063513480881653…70174313610037551361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.929 × 10¹⁰¹(102-digit number)
39294127026961763306…40348627220075102721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.858 × 10¹⁰¹(102-digit number)
78588254053923526612…80697254440150205441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.571 × 10¹⁰²(103-digit number)
15717650810784705322…61394508880300410881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.143 × 10¹⁰²(103-digit number)
31435301621569410644…22789017760600821761
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,713,413 XPM·at block #6,808,670 · 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