Block #654,996

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/30/2014, 2:05:19 PM · Difficulty 10.9555 · 6,155,600 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5c786bb31424c4053fd89816e9e877e481e2d6f7932a3e1205d795431ae18d49

Height

#654,996

Difficulty

10.955508

Transactions

2

Size

434 B

Version

2

Bits

0af49c2e

Nonce

764,561,465

Timestamp

7/30/2014, 2:05:19 PM

Confirmations

6,155,600

Merkle Root

0cd6afd580ef788cd65a7a02e18fa7b56b77622b329c488500480641c3edf59e
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.

7.869 × 10⁹⁶(97-digit number)
78696096527206518278…19439584542784506881
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
7.869 × 10⁹⁶(97-digit number)
78696096527206518278…19439584542784506881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.573 × 10⁹⁷(98-digit number)
15739219305441303655…38879169085569013761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.147 × 10⁹⁷(98-digit number)
31478438610882607311…77758338171138027521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.295 × 10⁹⁷(98-digit number)
62956877221765214623…55516676342276055041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.259 × 10⁹⁸(99-digit number)
12591375444353042924…11033352684552110081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.518 × 10⁹⁸(99-digit number)
25182750888706085849…22066705369104220161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.036 × 10⁹⁸(99-digit number)
50365501777412171698…44133410738208440321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.007 × 10⁹⁹(100-digit number)
10073100355482434339…88266821476416880641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.014 × 10⁹⁹(100-digit number)
20146200710964868679…76533642952833761281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.029 × 10⁹⁹(100-digit number)
40292401421929737358…53067285905667522561
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,728,855 XPM·at block #6,810,595 · 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