Block #645,818

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/24/2014, 9:26:21 AM · Difficulty 10.9529 · 6,160,998 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a8e0ba2eb724018d4dff7dce757afbda8d3db4221515299ef56f749e3f7eca7e

Height

#645,818

Difficulty

10.952920

Transactions

1

Size

561 B

Version

2

Bits

0af3f296

Nonce

1,889,533

Timestamp

7/24/2014, 9:26:21 AM

Confirmations

6,160,998

Merkle Root

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

3.279 × 10⁹⁴(95-digit number)
32798051265859585621…13938415302270413921
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
3.279 × 10⁹⁴(95-digit number)
32798051265859585621…13938415302270413921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.559 × 10⁹⁴(95-digit number)
65596102531719171242…27876830604540827841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.311 × 10⁹⁵(96-digit number)
13119220506343834248…55753661209081655681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.623 × 10⁹⁵(96-digit number)
26238441012687668497…11507322418163311361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.247 × 10⁹⁵(96-digit number)
52476882025375336994…23014644836326622721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.049 × 10⁹⁶(97-digit number)
10495376405075067398…46029289672653245441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.099 × 10⁹⁶(97-digit number)
20990752810150134797…92058579345306490881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.198 × 10⁹⁶(97-digit number)
41981505620300269595…84117158690612981761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.396 × 10⁹⁶(97-digit number)
83963011240600539190…68234317381225963521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.679 × 10⁹⁷(98-digit number)
16792602248120107838…36468634762451927041
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,698,629 XPM·at block #6,806,815 · 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