Block #315,981

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 7:44:44 PM · Difficulty 10.1201 · 6,490,306 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e4dcb56c1a634e4267e7ebd9dab673f07aad0aacd1891807fa6372c129a06738

Height

#315,981

Difficulty

10.120110

Transactions

45

Size

16.22 KB

Version

2

Bits

0a1ebf88

Nonce

8,188

Timestamp

12/16/2013, 7:44:44 PM

Confirmations

6,490,306

Merkle Root

42c0ca4cabfa8689f00df437bb3a48f67c5afb33eb072c0baa843a315ae9b5eb
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.

8.656 × 10¹⁰¹(102-digit number)
86567282590568285839…56003881024506965761
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
8.656 × 10¹⁰¹(102-digit number)
86567282590568285839…56003881024506965761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.731 × 10¹⁰²(103-digit number)
17313456518113657167…12007762049013931521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.462 × 10¹⁰²(103-digit number)
34626913036227314335…24015524098027863041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.925 × 10¹⁰²(103-digit number)
69253826072454628671…48031048196055726081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.385 × 10¹⁰³(104-digit number)
13850765214490925734…96062096392111452161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.770 × 10¹⁰³(104-digit number)
27701530428981851468…92124192784222904321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.540 × 10¹⁰³(104-digit number)
55403060857963702937…84248385568445808641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.108 × 10¹⁰⁴(105-digit number)
11080612171592740587…68496771136891617281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.216 × 10¹⁰⁴(105-digit number)
22161224343185481174…36993542273783234561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.432 × 10¹⁰⁴(105-digit number)
44322448686370962349…73987084547566469121
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,694,382 XPM·at block #6,806,286 · 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