Block #325,087

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/22/2013, 7:05:24 PM · Difficulty 10.2069 · 6,481,622 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a8842aa981131459f265bc28dbb97b91e47d1ddad804cfd541cbcebcf532526a

Height

#325,087

Difficulty

10.206881

Transactions

13

Size

3.13 KB

Version

2

Bits

0a34f626

Nonce

99,029

Timestamp

12/22/2013, 7:05:24 PM

Confirmations

6,481,622

Merkle Root

bb8bfea34277b40b386921342ff810c4c5a6e6277c951d51a778e80235002ac8
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.906 × 10⁸⁸(89-digit number)
19065336988170345909…62609531406146650441
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.906 × 10⁸⁸(89-digit number)
19065336988170345909…62609531406146650441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.813 × 10⁸⁸(89-digit number)
38130673976340691819…25219062812293300881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.626 × 10⁸⁸(89-digit number)
76261347952681383638…50438125624586601761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.525 × 10⁸⁹(90-digit number)
15252269590536276727…00876251249173203521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.050 × 10⁸⁹(90-digit number)
30504539181072553455…01752502498346407041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.100 × 10⁸⁹(90-digit number)
61009078362145106911…03505004996692814081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.220 × 10⁹⁰(91-digit number)
12201815672429021382…07010009993385628161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.440 × 10⁹⁰(91-digit number)
24403631344858042764…14020019986771256321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.880 × 10⁹⁰(91-digit number)
48807262689716085528…28040039973542512641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.761 × 10⁹⁰(91-digit number)
97614525379432171057…56080079947085025281
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,697,769 XPM·at block #6,806,708 · 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