Block #312,135

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 9:21:39 PM · Difficulty 9.9957 · 6,505,337 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e0e0ebd54bdd920496c2a47af935b87259189fdf39b2480ab9981a2693eb8ef

Height

#312,135

Difficulty

9.995716

Transactions

1

Size

1.15 KB

Version

2

Bits

09fee73f

Nonce

236,579

Timestamp

12/14/2013, 9:21:39 PM

Confirmations

6,505,337

Merkle Root

1fc0556365ab87366bbc3541f42cceab05f0b089fbfeaf1866ae886e81bc80bc
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.

3.893 × 10⁹⁶(97-digit number)
38935114386830793010…59664939227394493251
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
3.893 × 10⁹⁶(97-digit number)
38935114386830793010…59664939227394493251
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.787 × 10⁹⁶(97-digit number)
77870228773661586020…19329878454788986501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.557 × 10⁹⁷(98-digit number)
15574045754732317204…38659756909577973001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.114 × 10⁹⁷(98-digit number)
31148091509464634408…77319513819155946001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.229 × 10⁹⁷(98-digit number)
62296183018929268816…54639027638311892001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.245 × 10⁹⁸(99-digit number)
12459236603785853763…09278055276623784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.491 × 10⁹⁸(99-digit number)
24918473207571707526…18556110553247568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.983 × 10⁹⁸(99-digit number)
49836946415143415053…37112221106495136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.967 × 10⁹⁸(99-digit number)
99673892830286830106…74224442212990272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.993 × 10⁹⁹(100-digit number)
19934778566057366021…48448884425980544001
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,783,828 XPM·at block #6,817,471 · 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