Block #302,601

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2013, 9:58:37 PM · Difficulty 9.9928 · 6,508,087 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0c716ed30b05a61ee984c98fd0155cc9e496d9b630a5e21b91d39a152d55a8dd

Height

#302,601

Difficulty

9.992764

Transactions

2

Size

1.79 KB

Version

2

Bits

09fe25c7

Nonce

20

Timestamp

12/9/2013, 9:58:37 PM

Confirmations

6,508,087

Merkle Root

41f709130e831056056c51b8acd45ec27379733ad46b97a3243cb2dc880f0278
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.

9.971 × 10⁹⁴(95-digit number)
99715728407013665207…28778149766821383851
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
9.971 × 10⁹⁴(95-digit number)
99715728407013665207…28778149766821383851
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.994 × 10⁹⁵(96-digit number)
19943145681402733041…57556299533642767701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.988 × 10⁹⁵(96-digit number)
39886291362805466082…15112599067285535401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.977 × 10⁹⁵(96-digit number)
79772582725610932165…30225198134571070801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.595 × 10⁹⁶(97-digit number)
15954516545122186433…60450396269142141601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.190 × 10⁹⁶(97-digit number)
31909033090244372866…20900792538284283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.381 × 10⁹⁶(97-digit number)
63818066180488745732…41801585076568566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.276 × 10⁹⁷(98-digit number)
12763613236097749146…83603170153137132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.552 × 10⁹⁷(98-digit number)
25527226472195498293…67206340306274265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.105 × 10⁹⁷(98-digit number)
51054452944390996586…34412680612548531201
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,729,595 XPM·at block #6,810,687 · 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