Block #631,638

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/13/2014, 5:20:58 PM · Difficulty 10.9623 · 6,178,348 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dd38f7376e7d6f3cc33950dbd16c9cd636ec4ef1520e7e62173008207b85151b

Height

#631,638

Difficulty

10.962331

Transactions

6

Size

10.26 KB

Version

2

Bits

0af65b54

Nonce

151,013,332

Timestamp

7/13/2014, 5:20:58 PM

Confirmations

6,178,348

Merkle Root

4fce9a1f5f19a3be376a103f7c5471b57bd0ab5c8af7fd5a7fc4cc147342c8f8
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.

2.261 × 10⁹⁷(98-digit number)
22612290013731275474…11149515815953473281
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
2.261 × 10⁹⁷(98-digit number)
22612290013731275474…11149515815953473281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.522 × 10⁹⁷(98-digit number)
45224580027462550948…22299031631906946561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.044 × 10⁹⁷(98-digit number)
90449160054925101896…44598063263813893121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.808 × 10⁹⁸(99-digit number)
18089832010985020379…89196126527627786241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.617 × 10⁹⁸(99-digit number)
36179664021970040758…78392253055255572481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.235 × 10⁹⁸(99-digit number)
72359328043940081516…56784506110511144961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.447 × 10⁹⁹(100-digit number)
14471865608788016303…13569012221022289921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.894 × 10⁹⁹(100-digit number)
28943731217576032606…27138024442044579841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.788 × 10⁹⁹(100-digit number)
57887462435152065213…54276048884089159681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.157 × 10¹⁰⁰(101-digit number)
11577492487030413042…08552097768178319361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.315 × 10¹⁰⁰(101-digit number)
23154984974060826085…17104195536356638721
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,723,961 XPM·at block #6,809,985 · 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