Block #635,034

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/15/2014, 10:05:04 PM · Difficulty 10.9641 · 6,172,768 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2a7d92168e220b21acdd414732516d1c85f863f2071ac43736b550c71187d9a6

Height

#635,034

Difficulty

10.964120

Transactions

6

Size

1.63 KB

Version

2

Bits

0af6d091

Nonce

648,288,956

Timestamp

7/15/2014, 10:05:04 PM

Confirmations

6,172,768

Merkle Root

70f65f40b820d526d63796043aba4aed08d31c7309caf9dc03f73dfef06a05db
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.986 × 10⁹⁴(95-digit number)
39861188132309981258…67773680348624837021
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.986 × 10⁹⁴(95-digit number)
39861188132309981258…67773680348624837021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.972 × 10⁹⁴(95-digit number)
79722376264619962516…35547360697249674041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.594 × 10⁹⁵(96-digit number)
15944475252923992503…71094721394499348081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.188 × 10⁹⁵(96-digit number)
31888950505847985006…42189442788998696161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.377 × 10⁹⁵(96-digit number)
63777901011695970012…84378885577997392321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.275 × 10⁹⁶(97-digit number)
12755580202339194002…68757771155994784641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.551 × 10⁹⁶(97-digit number)
25511160404678388005…37515542311989569281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.102 × 10⁹⁶(97-digit number)
51022320809356776010…75031084623979138561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.020 × 10⁹⁷(98-digit number)
10204464161871355202…50062169247958277121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.040 × 10⁹⁷(98-digit number)
20408928323742710404…00124338495916554241
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,706,450 XPM·at block #6,807,801 · 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