Block #302,196

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2013, 4:19:09 PM · Difficulty 9.9927 · 6,512,245 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b9caed457982bd4700f261b36d9fcbe9ffcabdb8a6fadca603de16391288328e

Height

#302,196

Difficulty

9.992653

Transactions

4

Size

879 B

Version

2

Bits

09fe1e85

Nonce

64,981

Timestamp

12/9/2013, 4:19:09 PM

Confirmations

6,512,245

Merkle Root

f88312ae4f3cd6ed5725b7dad5c46515a0fbd8c5afad15b4de17a7d4038e1dd3
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.220 × 10⁹⁷(98-digit number)
12205185222665209438…05218185013986971161
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.220 × 10⁹⁷(98-digit number)
12205185222665209438…05218185013986971161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.441 × 10⁹⁷(98-digit number)
24410370445330418876…10436370027973942321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.882 × 10⁹⁷(98-digit number)
48820740890660837753…20872740055947884641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.764 × 10⁹⁷(98-digit number)
97641481781321675507…41745480111895769281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.952 × 10⁹⁸(99-digit number)
19528296356264335101…83490960223791538561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.905 × 10⁹⁸(99-digit number)
39056592712528670202…66981920447583077121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.811 × 10⁹⁸(99-digit number)
78113185425057340405…33963840895166154241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.562 × 10⁹⁹(100-digit number)
15622637085011468081…67927681790332308481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.124 × 10⁹⁹(100-digit number)
31245274170022936162…35855363580664616961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.249 × 10⁹⁹(100-digit number)
62490548340045872324…71710727161329233921
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,759,597 XPM·at block #6,814,440 · 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