Block #310,617

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 3:55:28 AM · Difficulty 9.9952 · 6,504,487 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
397c744330c4dc8a02e971adb697c4a2f53017122e7a717bef7b3a50f533c95f

Height

#310,617

Difficulty

9.995241

Transactions

1

Size

1.18 KB

Version

2

Bits

09fec81f

Nonce

21,536

Timestamp

12/14/2013, 3:55:28 AM

Confirmations

6,504,487

Merkle Root

e37ee3718bd1460e63a2b24e2d84109beef0acf3ccfd4d0fbe4da25fb9ee5bcb
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.045 × 10⁹⁸(99-digit number)
10459087398538482573…12661372054956002531
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.045 × 10⁹⁸(99-digit number)
10459087398538482573…12661372054956002531
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.091 × 10⁹⁸(99-digit number)
20918174797076965147…25322744109912005061
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.183 × 10⁹⁸(99-digit number)
41836349594153930295…50645488219824010121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.367 × 10⁹⁸(99-digit number)
83672699188307860591…01290976439648020241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.673 × 10⁹⁹(100-digit number)
16734539837661572118…02581952879296040481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.346 × 10⁹⁹(100-digit number)
33469079675323144236…05163905758592080961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.693 × 10⁹⁹(100-digit number)
66938159350646288473…10327811517184161921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.338 × 10¹⁰⁰(101-digit number)
13387631870129257694…20655623034368323841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.677 × 10¹⁰⁰(101-digit number)
26775263740258515389…41311246068736647681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.355 × 10¹⁰⁰(101-digit number)
53550527480517030778…82622492137473295361
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,764,922 XPM·at block #6,815,103 · 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.
Privacy Policy·

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