Block #391,120

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 2:53:09 PM · Difficulty 10.4279 · 6,434,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
03a6fb939eb4f14daca238c89285a3799e70cca110cf7a8c630c037100607853

Height

#391,120

Difficulty

10.427929

Transactions

7

Size

2.38 KB

Version

2

Bits

0a6d8cbd

Nonce

27,089

Timestamp

2/5/2014, 2:53:09 PM

Confirmations

6,434,578

Merkle Root

34c40d29d5cb67e8966a86dd1b87c5b5ef0a152d74605adc33b105c4ab0e615f
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.008 × 10¹⁰¹(102-digit number)
10087468654214008689…64645871912037242881
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.008 × 10¹⁰¹(102-digit number)
10087468654214008689…64645871912037242881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.017 × 10¹⁰¹(102-digit number)
20174937308428017379…29291743824074485761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.034 × 10¹⁰¹(102-digit number)
40349874616856034758…58583487648148971521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.069 × 10¹⁰¹(102-digit number)
80699749233712069516…17166975296297943041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.613 × 10¹⁰²(103-digit number)
16139949846742413903…34333950592595886081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.227 × 10¹⁰²(103-digit number)
32279899693484827806…68667901185191772161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.455 × 10¹⁰²(103-digit number)
64559799386969655613…37335802370383544321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.291 × 10¹⁰³(104-digit number)
12911959877393931122…74671604740767088641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.582 × 10¹⁰³(104-digit number)
25823919754787862245…49343209481534177281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.164 × 10¹⁰³(104-digit number)
51647839509575724490…98686418963068354561
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,849,696 XPM·at block #6,825,697 · 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