Block #294,736

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2013, 1:09:04 AM · Difficulty 9.9911 · 6,495,157 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
629142a93ce646fafe87dad1a82d7e1987565e7bfd57d2d1dd791a5b3bbe383f

Height

#294,736

Difficulty

9.991143

Transactions

8

Size

1.74 KB

Version

2

Bits

09fdbb8b

Nonce

154,248

Timestamp

12/5/2013, 1:09:04 AM

Confirmations

6,495,157

Merkle Root

09df2e76dcf46228d6ebe0717e3c2203dc06bbf53058e9a830313d2eeb7be04d
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.

3.448 × 10⁹⁹(100-digit number)
34482099321015999206…72012920634026632641
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
3.448 × 10⁹⁹(100-digit number)
34482099321015999206…72012920634026632641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.896 × 10⁹⁹(100-digit number)
68964198642031998413…44025841268053265281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.379 × 10¹⁰⁰(101-digit number)
13792839728406399682…88051682536106530561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.758 × 10¹⁰⁰(101-digit number)
27585679456812799365…76103365072213061121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.517 × 10¹⁰⁰(101-digit number)
55171358913625598731…52206730144426122241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.103 × 10¹⁰¹(102-digit number)
11034271782725119746…04413460288852244481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.206 × 10¹⁰¹(102-digit number)
22068543565450239492…08826920577704488961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.413 × 10¹⁰¹(102-digit number)
44137087130900478984…17653841155408977921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.827 × 10¹⁰¹(102-digit number)
88274174261800957969…35307682310817955841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.765 × 10¹⁰²(103-digit number)
17654834852360191593…70615364621635911681
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,563,121 XPM·at block #6,789,892 · updates every 60s