Block #322,998

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2013, 9:16:05 AM · Difficulty 10.1967 · 6,487,899 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2cc57d3874508d0cb1ce62a24ef5b50d2eac455d96d385385d235b766b20af40

Height

#322,998

Difficulty

10.196720

Transactions

16

Size

22.66 KB

Version

2

Bits

0a325c41

Nonce

40,557

Timestamp

12/21/2013, 9:16:05 AM

Confirmations

6,487,899

Merkle Root

5f65722ba2547bfe9437ebb562d0c4587eaae5daf523af0b67561e543fbc29c8
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.548 × 10⁹⁷(98-digit number)
35486292958391243535…22889937292216627201
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.548 × 10⁹⁷(98-digit number)
35486292958391243535…22889937292216627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.097 × 10⁹⁷(98-digit number)
70972585916782487071…45779874584433254401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.419 × 10⁹⁸(99-digit number)
14194517183356497414…91559749168866508801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.838 × 10⁹⁸(99-digit number)
28389034366712994828…83119498337733017601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.677 × 10⁹⁸(99-digit number)
56778068733425989657…66238996675466035201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.135 × 10⁹⁹(100-digit number)
11355613746685197931…32477993350932070401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.271 × 10⁹⁹(100-digit number)
22711227493370395862…64955986701864140801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.542 × 10⁹⁹(100-digit number)
45422454986740791725…29911973403728281601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.084 × 10⁹⁹(100-digit number)
90844909973481583451…59823946807456563201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.816 × 10¹⁰⁰(101-digit number)
18168981994696316690…19647893614913126401
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,731,274 XPM·at block #6,810,896 · 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