Block #716,880

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/11/2014, 11:47:54 PM · Difficulty 10.9521 · 6,093,884 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e9951d6ac2701a5c07c458d84395f391e4068d2678c6f4280e3539647884af83

Height

#716,880

Difficulty

10.952065

Transactions

7

Size

1.53 KB

Version

2

Bits

0af3ba88

Nonce

1,078,083,437

Timestamp

9/11/2014, 11:47:54 PM

Confirmations

6,093,884

Merkle Root

8d82257cbecd339e47d2f72ef8151d6c88cc5f409c11140ab623d02c6caff6d9
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.831 × 10⁹⁵(96-digit number)
28311672447830364834…78752047802283492801
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.831 × 10⁹⁵(96-digit number)
28311672447830364834…78752047802283492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.662 × 10⁹⁵(96-digit number)
56623344895660729669…57504095604566985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.132 × 10⁹⁶(97-digit number)
11324668979132145933…15008191209133971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.264 × 10⁹⁶(97-digit number)
22649337958264291867…30016382418267942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.529 × 10⁹⁶(97-digit number)
45298675916528583735…60032764836535884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.059 × 10⁹⁶(97-digit number)
90597351833057167471…20065529673071769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.811 × 10⁹⁷(98-digit number)
18119470366611433494…40131059346143539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.623 × 10⁹⁷(98-digit number)
36238940733222866988…80262118692287078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.247 × 10⁹⁷(98-digit number)
72477881466445733977…60524237384574156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.449 × 10⁹⁸(99-digit number)
14495576293289146795…21048474769148313601
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,730,206 XPM·at block #6,810,763 · 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