Block #315,162

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 9:11:58 AM · Difficulty 10.0866 · 6,510,434 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fa576f6188446e85aa78e9a896879ec7890533ab9c35aaa2527c0c4a06e09eca

Height

#315,162

Difficulty

10.086576

Transactions

1

Size

936 B

Version

2

Bits

0a1629de

Nonce

136,054

Timestamp

12/16/2013, 9:11:58 AM

Confirmations

6,510,434

Merkle Root

8f3822e1a7d1f97ae03ad9a365be2297da77034530dbb9d9cd80f0e133cdc51f
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.623 × 10⁹⁸(99-digit number)
26238920598731939598…59503636301644679561
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.623 × 10⁹⁸(99-digit number)
26238920598731939598…59503636301644679561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.247 × 10⁹⁸(99-digit number)
52477841197463879197…19007272603289359121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.049 × 10⁹⁹(100-digit number)
10495568239492775839…38014545206578718241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.099 × 10⁹⁹(100-digit number)
20991136478985551678…76029090413157436481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.198 × 10⁹⁹(100-digit number)
41982272957971103357…52058180826314872961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.396 × 10⁹⁹(100-digit number)
83964545915942206715…04116361652629745921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.679 × 10¹⁰⁰(101-digit number)
16792909183188441343…08232723305259491841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.358 × 10¹⁰⁰(101-digit number)
33585818366376882686…16465446610518983681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.717 × 10¹⁰⁰(101-digit number)
67171636732753765372…32930893221037967361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.343 × 10¹⁰¹(102-digit number)
13434327346550753074…65861786442075934721
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,848,868 XPM·at block #6,825,595 · 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