Block #391,643

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 11:02:56 PM · Difficulty 10.4317 · 6,416,244 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bc83e03bd0925322bcdc975eb9b08cec36695e74580b1beeaaf12ed5b7893934

Height

#391,643

Difficulty

10.431651

Transactions

6

Size

1.42 KB

Version

2

Bits

0a6e80a6

Nonce

67,111,341

Timestamp

2/5/2014, 11:02:56 PM

Confirmations

6,416,244

Merkle Root

e4a522015572e68069f6701310427e03c76ddbb926f875ac54a3308ba0852acb
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.810 × 10⁹⁶(97-digit number)
48107307997948156706…10840368580545034241
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.810 × 10⁹⁶(97-digit number)
48107307997948156706…10840368580545034241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.621 × 10⁹⁶(97-digit number)
96214615995896313413…21680737161090068481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.924 × 10⁹⁷(98-digit number)
19242923199179262682…43361474322180136961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.848 × 10⁹⁷(98-digit number)
38485846398358525365…86722948644360273921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.697 × 10⁹⁷(98-digit number)
76971692796717050730…73445897288720547841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.539 × 10⁹⁸(99-digit number)
15394338559343410146…46891794577441095681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.078 × 10⁹⁸(99-digit number)
30788677118686820292…93783589154882191361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.157 × 10⁹⁸(99-digit number)
61577354237373640584…87567178309764382721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.231 × 10⁹⁹(100-digit number)
12315470847474728116…75134356619528765441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.463 × 10⁹⁹(100-digit number)
24630941694949456233…50268713239057530881
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,707,131 XPM·at block #6,807,886 · 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