Block #429,388

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/4/2014, 6:06:28 PM · Difficulty 10.3473 · 6,397,328 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f9eeef9b3ac132a3ac2e2cb313397132510bbccae52e30bd41922438400777d8

Height

#429,388

Difficulty

10.347274

Transactions

4

Size

2.86 KB

Version

2

Bits

0a58e6f0

Nonce

156,136

Timestamp

3/4/2014, 6:06:28 PM

Confirmations

6,397,328

Merkle Root

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

4.177 × 10⁹¹(92-digit number)
41774141519026787383…71228474752433600321
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
4.177 × 10⁹¹(92-digit number)
41774141519026787383…71228474752433600321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.354 × 10⁹¹(92-digit number)
83548283038053574766…42456949504867200641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.670 × 10⁹²(93-digit number)
16709656607610714953…84913899009734401281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.341 × 10⁹²(93-digit number)
33419313215221429906…69827798019468802561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.683 × 10⁹²(93-digit number)
66838626430442859813…39655596038937605121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.336 × 10⁹³(94-digit number)
13367725286088571962…79311192077875210241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.673 × 10⁹³(94-digit number)
26735450572177143925…58622384155750420481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.347 × 10⁹³(94-digit number)
53470901144354287850…17244768311500840961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.069 × 10⁹⁴(95-digit number)
10694180228870857570…34489536623001681921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.138 × 10⁹⁴(95-digit number)
21388360457741715140…68979073246003363841
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,857,881 XPM·at block #6,826,715 · 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