Block #301,791

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2013, 10:42:47 AM · Difficulty 9.9925 · 6,507,152 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6ada364ae4318bd8152df55602e185f9b946ac48df1d6ba2b69644b3ffde4bb4

Height

#301,791

Difficulty

9.992541

Transactions

8

Size

2.66 KB

Version

2

Bits

09fe1724

Nonce

21,836

Timestamp

12/9/2013, 10:42:47 AM

Confirmations

6,507,152

Merkle Root

fef49b65d848751c4c300e5d1394385067b00d5513a979ceea510fe40e957682
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.

4.935 × 10⁹¹(92-digit number)
49358341959011285559…45769602442143595521
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
4.935 × 10⁹¹(92-digit number)
49358341959011285559…45769602442143595521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.871 × 10⁹¹(92-digit number)
98716683918022571118…91539204884287191041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.974 × 10⁹²(93-digit number)
19743336783604514223…83078409768574382081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.948 × 10⁹²(93-digit number)
39486673567209028447…66156819537148764161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.897 × 10⁹²(93-digit number)
78973347134418056895…32313639074297528321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.579 × 10⁹³(94-digit number)
15794669426883611379…64627278148595056641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.158 × 10⁹³(94-digit number)
31589338853767222758…29254556297190113281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.317 × 10⁹³(94-digit number)
63178677707534445516…58509112594380226561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.263 × 10⁹⁴(95-digit number)
12635735541506889103…17018225188760453121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.527 × 10⁹⁴(95-digit number)
25271471083013778206…34036450377520906241
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,715,602 XPM·at block #6,808,942 · 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