Block #667,718

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2014, 7:33:57 PM · Difficulty 10.9629 · 6,168,823 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e9bc7984249db5f3ce3fa11a9552e569baf03d0daf92a993a53619fe067f5828

Height

#667,718

Difficulty

10.962931

Transactions

3

Size

1.08 KB

Version

2

Bits

0af682ad

Nonce

200,219,847

Timestamp

8/7/2014, 7:33:57 PM

Confirmations

6,168,823

Merkle Root

72607d2af7335e3311a89ba5bc38771572cc0f768c4a812539d888b4fa8c1441
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.

5.240 × 10⁹⁷(98-digit number)
52400793466955751188…38502081287132006401
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
5.240 × 10⁹⁷(98-digit number)
52400793466955751188…38502081287132006401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.048 × 10⁹⁸(99-digit number)
10480158693391150237…77004162574264012801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.096 × 10⁹⁸(99-digit number)
20960317386782300475…54008325148528025601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.192 × 10⁹⁸(99-digit number)
41920634773564600950…08016650297056051201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.384 × 10⁹⁸(99-digit number)
83841269547129201901…16033300594112102401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.676 × 10⁹⁹(100-digit number)
16768253909425840380…32066601188224204801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.353 × 10⁹⁹(100-digit number)
33536507818851680760…64133202376448409601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.707 × 10⁹⁹(100-digit number)
67073015637703361521…28266404752896819201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.341 × 10¹⁰⁰(101-digit number)
13414603127540672304…56532809505793638401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.682 × 10¹⁰⁰(101-digit number)
26829206255081344608…13065619011587276801
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,936,592 XPM·at block #6,836,540 · 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