Block #314,119

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 7:37:10 PM · Difficulty 10.0443 · 6,501,844 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a5ffcd552601b8c7d1a709cfd6748e217db086fd0fab94d4ff346116eb5cfaca

Height

#314,119

Difficulty

10.044292

Transactions

6

Size

1.41 KB

Version

2

Bits

0a0b56b3

Nonce

136,772

Timestamp

12/15/2013, 7:37:10 PM

Confirmations

6,501,844

Merkle Root

cef5bfd24f35a885ca7e53d614e98b212eb39255d6eb5e04822bd446c206fba0
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.793 × 10¹⁰⁶(107-digit number)
27932415269190332303…78946569335078731201
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.793 × 10¹⁰⁶(107-digit number)
27932415269190332303…78946569335078731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.586 × 10¹⁰⁶(107-digit number)
55864830538380664607…57893138670157462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.117 × 10¹⁰⁷(108-digit number)
11172966107676132921…15786277340314924801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.234 × 10¹⁰⁷(108-digit number)
22345932215352265843…31572554680629849601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.469 × 10¹⁰⁷(108-digit number)
44691864430704531686…63145109361259699201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.938 × 10¹⁰⁷(108-digit number)
89383728861409063372…26290218722519398401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.787 × 10¹⁰⁸(109-digit number)
17876745772281812674…52580437445038796801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.575 × 10¹⁰⁸(109-digit number)
35753491544563625348…05160874890077593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.150 × 10¹⁰⁸(109-digit number)
71506983089127250697…10321749780155187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.430 × 10¹⁰⁹(110-digit number)
14301396617825450139…20643499560310374401
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,771,819 XPM·at block #6,815,962 · 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