Block #325,403

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/23/2013, 12:34:18 AM · Difficulty 10.2046 · 6,491,686 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b0b6a21869668e138c596a2fb3991743122fbabbbe7917355da6276291138b21

Height

#325,403

Difficulty

10.204638

Transactions

3

Size

1.00 KB

Version

2

Bits

0a346322

Nonce

49,296

Timestamp

12/23/2013, 12:34:18 AM

Confirmations

6,491,686

Merkle Root

8a8d2867218a80707adad07942db7467716166e721416eefe37ae941a802e11c
Transactions (3)
1 in → 1 out9.6100 XPM110 B
2 in → 1 out85.0500 XPM340 B
3 in → 1 out15.0026 XPM487 B
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.204 × 10⁹⁸(99-digit number)
12042769396596631670…81539858247982072961
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.204 × 10⁹⁸(99-digit number)
12042769396596631670…81539858247982072961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.408 × 10⁹⁸(99-digit number)
24085538793193263341…63079716495964145921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.817 × 10⁹⁸(99-digit number)
48171077586386526682…26159432991928291841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.634 × 10⁹⁸(99-digit number)
96342155172773053365…52318865983856583681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.926 × 10⁹⁹(100-digit number)
19268431034554610673…04637731967713167361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.853 × 10⁹⁹(100-digit number)
38536862069109221346…09275463935426334721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.707 × 10⁹⁹(100-digit number)
77073724138218442692…18550927870852669441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.541 × 10¹⁰⁰(101-digit number)
15414744827643688538…37101855741705338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.082 × 10¹⁰⁰(101-digit number)
30829489655287377076…74203711483410677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.165 × 10¹⁰⁰(101-digit number)
61658979310574754153…48407422966821355521
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,780,750 XPM·at block #6,817,088 · 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