Block #302,052

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2013, 2:25:13 PM · Difficulty 9.9926 · 6,514,232 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
095bfffef8e5f2cb9032bf17f04153d50aae41bfc4c8aa95a6afb760145231af

Height

#302,052

Difficulty

9.992607

Transactions

1

Size

1.14 KB

Version

2

Bits

09fe1b7e

Nonce

321,917

Timestamp

12/9/2013, 2:25:13 PM

Confirmations

6,514,232

Merkle Root

65ad982982dbffae610c97e95a6a3b0893ec2c9367ba33504548b58b720933fd
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.

1.597 × 10⁹⁴(95-digit number)
15976284708522890737…61107225546437953761
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
1.597 × 10⁹⁴(95-digit number)
15976284708522890737…61107225546437953761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.195 × 10⁹⁴(95-digit number)
31952569417045781475…22214451092875907521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.390 × 10⁹⁴(95-digit number)
63905138834091562950…44428902185751815041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.278 × 10⁹⁵(96-digit number)
12781027766818312590…88857804371503630081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.556 × 10⁹⁵(96-digit number)
25562055533636625180…77715608743007260161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.112 × 10⁹⁵(96-digit number)
51124111067273250360…55431217486014520321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.022 × 10⁹⁶(97-digit number)
10224822213454650072…10862434972029040641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.044 × 10⁹⁶(97-digit number)
20449644426909300144…21724869944058081281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.089 × 10⁹⁶(97-digit number)
40899288853818600288…43449739888116162561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.179 × 10⁹⁶(97-digit number)
81798577707637200576…86899479776232325121
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,774,388 XPM·at block #6,816,283 · 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