Block #301,461

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2013, 5:13:45 AM · Difficulty 9.9925 · 6,524,251 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e8c72f580bade4a1a0bf3dbd25de50643900a65c6b43ce7857c065d4f9eb6325

Height

#301,461

Difficulty

9.992530

Transactions

1

Size

1.15 KB

Version

2

Bits

09fe166a

Nonce

261,060

Timestamp

12/9/2013, 5:13:45 AM

Confirmations

6,524,251

Merkle Root

06a59b32c75348e8af8b8c76e21635d6db0d3459aa3a8ac069c2d0eab7743965
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.524 × 10⁹³(94-digit number)
45243644301123805525…57149529480564112721
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.524 × 10⁹³(94-digit number)
45243644301123805525…57149529480564112721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.048 × 10⁹³(94-digit number)
90487288602247611050…14299058961128225441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.809 × 10⁹⁴(95-digit number)
18097457720449522210…28598117922256450881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.619 × 10⁹⁴(95-digit number)
36194915440899044420…57196235844512901761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.238 × 10⁹⁴(95-digit number)
72389830881798088840…14392471689025803521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.447 × 10⁹⁵(96-digit number)
14477966176359617768…28784943378051607041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.895 × 10⁹⁵(96-digit number)
28955932352719235536…57569886756103214081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.791 × 10⁹⁵(96-digit number)
57911864705438471072…15139773512206428161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.158 × 10⁹⁶(97-digit number)
11582372941087694214…30279547024412856321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.316 × 10⁹⁶(97-digit number)
23164745882175388428…60559094048825712641
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,849,800 XPM·at block #6,825,711 · 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