Block #654,863

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/30/2014, 12:01:07 PM · Difficulty 10.9555 · 6,151,969 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
15baa169cef4a8bbd7c8ac47a7aeae9ba4aa58bbcc9b56065701874e27889971

Height

#654,863

Difficulty

10.955468

Transactions

3

Size

625 B

Version

2

Bits

0af4998f

Nonce

39,593,870

Timestamp

7/30/2014, 12:01:07 PM

Confirmations

6,151,969

Merkle Root

b3c349b9e8cf8152b6679bdbff1db1a92bc30fa31023df57d449caf2bbca29fd
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.

8.629 × 10⁹⁶(97-digit number)
86295513270926749422…62612495205233568001
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
8.629 × 10⁹⁶(97-digit number)
86295513270926749422…62612495205233568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.725 × 10⁹⁷(98-digit number)
17259102654185349884…25224990410467136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.451 × 10⁹⁷(98-digit number)
34518205308370699768…50449980820934272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.903 × 10⁹⁷(98-digit number)
69036410616741399537…00899961641868544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.380 × 10⁹⁸(99-digit number)
13807282123348279907…01799923283737088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.761 × 10⁹⁸(99-digit number)
27614564246696559815…03599846567474176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.522 × 10⁹⁸(99-digit number)
55229128493393119630…07199693134948352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.104 × 10⁹⁹(100-digit number)
11045825698678623926…14399386269896704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.209 × 10⁹⁹(100-digit number)
22091651397357247852…28798772539793408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.418 × 10⁹⁹(100-digit number)
44183302794714495704…57597545079586816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.836 × 10⁹⁹(100-digit number)
88366605589428991408…15195090159173632001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,698,760 XPM·at block #6,806,831 · 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