Block #392,610

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 2:02:56 PM · Difficulty 10.4393 · 6,415,395 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bf33a1581a2a0d156f3755cb92312e8a49fa241e736cd947cad61540641b7450

Height

#392,610

Difficulty

10.439331

Transactions

9

Size

2.11 KB

Version

2

Bits

0a7077fe

Nonce

5,628

Timestamp

2/6/2014, 2:02:56 PM

Confirmations

6,415,395

Merkle Root

f200a8677a21373d18ee5d3fdd72b3b408cc222bd19e17670d7f31644e5a5a06
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.074 × 10⁹⁸(99-digit number)
10746363198326483551…19845672992257858241
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.074 × 10⁹⁸(99-digit number)
10746363198326483551…19845672992257858241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.149 × 10⁹⁸(99-digit number)
21492726396652967103…39691345984515716481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.298 × 10⁹⁸(99-digit number)
42985452793305934207…79382691969031432961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.597 × 10⁹⁸(99-digit number)
85970905586611868414…58765383938062865921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.719 × 10⁹⁹(100-digit number)
17194181117322373682…17530767876125731841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.438 × 10⁹⁹(100-digit number)
34388362234644747365…35061535752251463681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.877 × 10⁹⁹(100-digit number)
68776724469289494731…70123071504502927361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.375 × 10¹⁰⁰(101-digit number)
13755344893857898946…40246143009005854721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.751 × 10¹⁰⁰(101-digit number)
27510689787715797892…80492286018011709441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.502 × 10¹⁰⁰(101-digit number)
55021379575431595785…60984572036023418881
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,708,081 XPM·at block #6,808,004 · 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