Block #382,666

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/30/2014, 9:26:24 PM · Difficulty 10.4006 · 6,442,578 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d5293ffc6899db8906ea70ec065a42b29647f0ccbc4a91d9e862d2b571e7589b

Height

#382,666

Difficulty

10.400573

Transactions

5

Size

1.81 KB

Version

2

Bits

0a668bf9

Nonce

139,892

Timestamp

1/30/2014, 9:26:24 PM

Confirmations

6,442,578

Merkle Root

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

2.740 × 10⁹⁸(99-digit number)
27401031101203894802…87469536601445708121
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
2.740 × 10⁹⁸(99-digit number)
27401031101203894802…87469536601445708121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.480 × 10⁹⁸(99-digit number)
54802062202407789604…74939073202891416241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.096 × 10⁹⁹(100-digit number)
10960412440481557920…49878146405782832481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.192 × 10⁹⁹(100-digit number)
21920824880963115841…99756292811565664961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.384 × 10⁹⁹(100-digit number)
43841649761926231683…99512585623131329921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.768 × 10⁹⁹(100-digit number)
87683299523852463367…99025171246262659841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.753 × 10¹⁰⁰(101-digit number)
17536659904770492673…98050342492525319681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.507 × 10¹⁰⁰(101-digit number)
35073319809540985347…96100684985050639361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.014 × 10¹⁰⁰(101-digit number)
70146639619081970694…92201369970101278721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.402 × 10¹⁰¹(102-digit number)
14029327923816394138…84402739940202557441
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,846,046 XPM·at block #6,825,243 · 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