Block #325,910

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/23/2013, 9:58:59 AM · Difficulty 10.1957 · 6,491,405 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3f601674ee6eb800cbd8d53afd52c9c2f05767adc42375fd7c3782edf0b68010

Height

#325,910

Difficulty

10.195745

Transactions

14

Size

3.21 KB

Version

2

Bits

0a321c59

Nonce

113,100

Timestamp

12/23/2013, 9:58:59 AM

Confirmations

6,491,405

Merkle Root

c184e82f16c83c951b5f5f0fc058651f690cdb59c21212112a892437c218200d
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.991 × 10⁹⁵(96-digit number)
49918308317531034911…56451271300125284721
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.991 × 10⁹⁵(96-digit number)
49918308317531034911…56451271300125284721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.983 × 10⁹⁵(96-digit number)
99836616635062069823…12902542600250569441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.996 × 10⁹⁶(97-digit number)
19967323327012413964…25805085200501138881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.993 × 10⁹⁶(97-digit number)
39934646654024827929…51610170401002277761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.986 × 10⁹⁶(97-digit number)
79869293308049655859…03220340802004555521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.597 × 10⁹⁷(98-digit number)
15973858661609931171…06440681604009111041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.194 × 10⁹⁷(98-digit number)
31947717323219862343…12881363208018222081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.389 × 10⁹⁷(98-digit number)
63895434646439724687…25762726416036444161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.277 × 10⁹⁸(99-digit number)
12779086929287944937…51525452832072888321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.555 × 10⁹⁸(99-digit number)
25558173858575889874…03050905664145776641
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,782,565 XPM·at block #6,817,314 · 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