Block #685,522

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2014, 9:06:02 PM · Difficulty 10.9554 · 6,122,592 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7bd57a8a49c746d1242f56a15f45e9db03e3f77ead1e14e3d24b5e687ff2570c

Height

#685,522

Difficulty

10.955449

Transactions

5

Size

1.09 KB

Version

2

Bits

0af4984e

Nonce

471,439,140

Timestamp

8/20/2014, 9:06:02 PM

Confirmations

6,122,592

Merkle Root

634a67e5f95d8505b289846340f3d992ad1155e4819c69d9026e8abea45cc3b9
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.

6.262 × 10⁹⁷(98-digit number)
62624818268875606873…68664496828052792321
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
6.262 × 10⁹⁷(98-digit number)
62624818268875606873…68664496828052792321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.252 × 10⁹⁸(99-digit number)
12524963653775121374…37328993656105584641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.504 × 10⁹⁸(99-digit number)
25049927307550242749…74657987312211169281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.009 × 10⁹⁸(99-digit number)
50099854615100485498…49315974624422338561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.001 × 10⁹⁹(100-digit number)
10019970923020097099…98631949248844677121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.003 × 10⁹⁹(100-digit number)
20039941846040194199…97263898497689354241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.007 × 10⁹⁹(100-digit number)
40079883692080388398…94527796995378708481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.015 × 10⁹⁹(100-digit number)
80159767384160776797…89055593990757416961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.603 × 10¹⁰⁰(101-digit number)
16031953476832155359…78111187981514833921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.206 × 10¹⁰⁰(101-digit number)
32063906953664310719…56222375963029667841
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,708,960 XPM·at block #6,808,113 · 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