Block #325,707

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/23/2013, 6:41:45 AM · Difficulty 10.1948 · 6,483,952 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d3dbc80bb40c820ba3447317fce0c0a70c3782519714f46e01fbfa545e0151be

Height

#325,707

Difficulty

10.194772

Transactions

4

Size

1.62 KB

Version

2

Bits

0a31dc8c

Nonce

19,722

Timestamp

12/23/2013, 6:41:45 AM

Confirmations

6,483,952

Merkle Root

9c40b141c7818f98cabd7cf9ba157b7b82dc4aceeac8fe5a5c58a349c8480455
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.

4.489 × 10⁹⁹(100-digit number)
44896310025503076046…72278406381847476481
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
4.489 × 10⁹⁹(100-digit number)
44896310025503076046…72278406381847476481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.979 × 10⁹⁹(100-digit number)
89792620051006152093…44556812763694952961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.795 × 10¹⁰⁰(101-digit number)
17958524010201230418…89113625527389905921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.591 × 10¹⁰⁰(101-digit number)
35917048020402460837…78227251054779811841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.183 × 10¹⁰⁰(101-digit number)
71834096040804921674…56454502109559623681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.436 × 10¹⁰¹(102-digit number)
14366819208160984334…12909004219119247361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.873 × 10¹⁰¹(102-digit number)
28733638416321968669…25818008438238494721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.746 × 10¹⁰¹(102-digit number)
57467276832643937339…51636016876476989441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.149 × 10¹⁰²(103-digit number)
11493455366528787467…03272033752953978881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.298 × 10¹⁰²(103-digit number)
22986910733057574935…06544067505907957761
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,721,346 XPM·at block #6,809,658 · 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