Block #680,659

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/16/2014, 9:22:44 PM · Difficulty 10.9624 · 6,126,409 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f16dce92d267f237e4005a919ccd079c4316dab9f47d680641042d8223a581f2

Height

#680,659

Difficulty

10.962423

Transactions

6

Size

2.17 KB

Version

2

Bits

0af66159

Nonce

698,755,856

Timestamp

8/16/2014, 9:22:44 PM

Confirmations

6,126,409

Merkle Root

f9445fa7896e9d4e5668117558971f84c2126e600fd60d67512359e736d9093e
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.260 × 10⁹⁶(97-digit number)
22609817085371311250…17085776828496843921
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.260 × 10⁹⁶(97-digit number)
22609817085371311250…17085776828496843921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.521 × 10⁹⁶(97-digit number)
45219634170742622500…34171553656993687841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.043 × 10⁹⁶(97-digit number)
90439268341485245000…68343107313987375681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.808 × 10⁹⁷(98-digit number)
18087853668297049000…36686214627974751361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.617 × 10⁹⁷(98-digit number)
36175707336594098000…73372429255949502721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.235 × 10⁹⁷(98-digit number)
72351414673188196000…46744858511899005441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.447 × 10⁹⁸(99-digit number)
14470282934637639200…93489717023798010881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.894 × 10⁹⁸(99-digit number)
28940565869275278400…86979434047596021761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.788 × 10⁹⁸(99-digit number)
57881131738550556800…73958868095192043521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.157 × 10⁹⁹(100-digit number)
11576226347710111360…47917736190384087041
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,700,638 XPM·at block #6,807,067 · 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