Block #695,034

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/27/2014, 8:23:12 AM · Difficulty 10.9574 · 6,112,042 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c5d7e2db5fbe33fbe83723656da44a3bc42c35c38dbd5ac8fc2bab97866d7441

Height

#695,034

Difficulty

10.957412

Transactions

7

Size

4.27 KB

Version

2

Bits

0af518f3

Nonce

114,213,992

Timestamp

8/27/2014, 8:23:12 AM

Confirmations

6,112,042

Merkle Root

6bcfe5c0e2cf6897454047e668a86feabb8da35df4d9437a40dfba312162740f
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.

1.948 × 10⁹⁷(98-digit number)
19488506822700968855…16604767691926018561
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
1.948 × 10⁹⁷(98-digit number)
19488506822700968855…16604767691926018561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.897 × 10⁹⁷(98-digit number)
38977013645401937711…33209535383852037121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.795 × 10⁹⁷(98-digit number)
77954027290803875422…66419070767704074241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.559 × 10⁹⁸(99-digit number)
15590805458160775084…32838141535408148481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.118 × 10⁹⁸(99-digit number)
31181610916321550169…65676283070816296961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.236 × 10⁹⁸(99-digit number)
62363221832643100338…31352566141632593921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.247 × 10⁹⁹(100-digit number)
12472644366528620067…62705132283265187841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.494 × 10⁹⁹(100-digit number)
24945288733057240135…25410264566530375681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.989 × 10⁹⁹(100-digit number)
49890577466114480270…50820529133060751361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.978 × 10⁹⁹(100-digit number)
99781154932228960540…01641058266121502721
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,704 XPM·at block #6,807,075 · 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