Block #391,960

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 4:25:01 AM · Difficulty 10.4312 · 6,425,954 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
68cf19b07280203e3bdabc1cd954b0ef90440f9eafc57a9d14b4f20e32c5d6e5

Height

#391,960

Difficulty

10.431176

Transactions

4

Size

1.51 KB

Version

2

Bits

0a6e6187

Nonce

369,959

Timestamp

2/6/2014, 4:25:01 AM

Confirmations

6,425,954

Merkle Root

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

8.363 × 10⁹⁰(91-digit number)
83635558216346562425…47927098809344167361
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
8.363 × 10⁹⁰(91-digit number)
83635558216346562425…47927098809344167361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.672 × 10⁹¹(92-digit number)
16727111643269312485…95854197618688334721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.345 × 10⁹¹(92-digit number)
33454223286538624970…91708395237376669441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.690 × 10⁹¹(92-digit number)
66908446573077249940…83416790474753338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.338 × 10⁹²(93-digit number)
13381689314615449988…66833580949506677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.676 × 10⁹²(93-digit number)
26763378629230899976…33667161899013355521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.352 × 10⁹²(93-digit number)
53526757258461799952…67334323798026711041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.070 × 10⁹³(94-digit number)
10705351451692359990…34668647596053422081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.141 × 10⁹³(94-digit number)
21410702903384719980…69337295192106844161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.282 × 10⁹³(94-digit number)
42821405806769439961…38674590384213688321
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,787,376 XPM·at block #6,817,913 · 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