Block #399,608

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/11/2014, 12:45:51 PM · Difficulty 10.4280 · 6,410,084 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5aff1a83da5fb1896f8e1f8c90a0c0cf0faea8b44aab82b393528cc062f1b839

Height

#399,608

Difficulty

10.427981

Transactions

13

Size

4.51 KB

Version

2

Bits

0a6d9025

Nonce

164,648

Timestamp

2/11/2014, 12:45:51 PM

Confirmations

6,410,084

Merkle Root

7101bd18938e794dff107ff8f93fc009c7f7a9f4254514dfc183a381fff179d1
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.149 × 10⁹⁴(95-digit number)
41491780243510298325…15795418019928825101
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.149 × 10⁹⁴(95-digit number)
41491780243510298325…15795418019928825101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.298 × 10⁹⁴(95-digit number)
82983560487020596651…31590836039857650201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.659 × 10⁹⁵(96-digit number)
16596712097404119330…63181672079715300401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.319 × 10⁹⁵(96-digit number)
33193424194808238660…26363344159430600801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.638 × 10⁹⁵(96-digit number)
66386848389616477320…52726688318861201601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.327 × 10⁹⁶(97-digit number)
13277369677923295464…05453376637722403201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.655 × 10⁹⁶(97-digit number)
26554739355846590928…10906753275444806401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.310 × 10⁹⁶(97-digit number)
53109478711693181856…21813506550889612801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.062 × 10⁹⁷(98-digit number)
10621895742338636371…43627013101779225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.124 × 10⁹⁷(98-digit number)
21243791484677272742…87254026203558451201
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,612 XPM·at block #6,809,691 · 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