Block #391,740

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 12:52:47 AM · Difficulty 10.4302 · 6,417,897 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
575b050db9005060196facb2f7fd1a5c564080b5b95dcfc8a9bb114c1288510d

Height

#391,740

Difficulty

10.430233

Transactions

7

Size

2.83 KB

Version

2

Bits

0a6e23ba

Nonce

201,333,281

Timestamp

2/6/2014, 12:52:47 AM

Confirmations

6,417,897

Merkle Root

aaac23314b7f43b30a26f203f987a96acc46e6db4c558a8d04bac434c0fd8475
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.113 × 10⁹⁴(95-digit number)
41132033514723317463…60479150058213753801
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.113 × 10⁹⁴(95-digit number)
41132033514723317463…60479150058213753801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.226 × 10⁹⁴(95-digit number)
82264067029446634926…20958300116427507601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.645 × 10⁹⁵(96-digit number)
16452813405889326985…41916600232855015201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.290 × 10⁹⁵(96-digit number)
32905626811778653970…83833200465710030401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.581 × 10⁹⁵(96-digit number)
65811253623557307940…67666400931420060801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.316 × 10⁹⁶(97-digit number)
13162250724711461588…35332801862840121601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.632 × 10⁹⁶(97-digit number)
26324501449422923176…70665603725680243201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.264 × 10⁹⁶(97-digit number)
52649002898845846352…41331207451360486401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.052 × 10⁹⁷(98-digit number)
10529800579769169270…82662414902720972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.105 × 10⁹⁷(98-digit number)
21059601159538338541…65324829805441945601
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,721,174 XPM·at block #6,809,636 · 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