Block #325,188

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/22/2013, 8:37:48 PM · Difficulty 10.2082 · 6,482,675 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b177928f5b5bdfad9a73575d7dd961dda44dfa96d1439a3cb40d06f10ee9305a

Height

#325,188

Difficulty

10.208218

Transactions

15

Size

7.87 KB

Version

2

Bits

0a354dc9

Nonce

151,952

Timestamp

12/22/2013, 8:37:48 PM

Confirmations

6,482,675

Merkle Root

1efe6c31abe40ffa4a6c02a5eee6a702eec933232a4829950bc6da130d5fded2
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.

8.042 × 10¹⁰¹(102-digit number)
80422402687575805590…28883245110451906081
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
8.042 × 10¹⁰¹(102-digit number)
80422402687575805590…28883245110451906081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.608 × 10¹⁰²(103-digit number)
16084480537515161118…57766490220903812161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.216 × 10¹⁰²(103-digit number)
32168961075030322236…15532980441807624321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.433 × 10¹⁰²(103-digit number)
64337922150060644472…31065960883615248641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.286 × 10¹⁰³(104-digit number)
12867584430012128894…62131921767230497281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.573 × 10¹⁰³(104-digit number)
25735168860024257789…24263843534460994561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.147 × 10¹⁰³(104-digit number)
51470337720048515578…48527687068921989121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.029 × 10¹⁰⁴(105-digit number)
10294067544009703115…97055374137843978241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.058 × 10¹⁰⁴(105-digit number)
20588135088019406231…94110748275687956481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.117 × 10¹⁰⁴(105-digit number)
41176270176038812462…88221496551375912961
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,706,943 XPM·at block #6,807,862 · 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