Block #390,419

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 3:48:58 AM · Difficulty 10.4235 · 6,423,647 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1c9fd54710111d8a4a499474478d93483f593f67508e4ca04eb64a1ff130c895

Height

#390,419

Difficulty

10.423535

Transactions

6

Size

1.73 KB

Version

2

Bits

0a6c6cd1

Nonce

20,921

Timestamp

2/5/2014, 3:48:58 AM

Confirmations

6,423,647

Merkle Root

b35df325dc3ac8b603985da6e1965fcf7e6c9ef4439b55948b454b744da99a7f
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.

3.149 × 10¹⁰⁴(105-digit number)
31493029729487032114…45300752513026480641
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
3.149 × 10¹⁰⁴(105-digit number)
31493029729487032114…45300752513026480641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.298 × 10¹⁰⁴(105-digit number)
62986059458974064228…90601505026052961281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.259 × 10¹⁰⁵(106-digit number)
12597211891794812845…81203010052105922561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.519 × 10¹⁰⁵(106-digit number)
25194423783589625691…62406020104211845121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.038 × 10¹⁰⁵(106-digit number)
50388847567179251383…24812040208423690241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.007 × 10¹⁰⁶(107-digit number)
10077769513435850276…49624080416847380481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.015 × 10¹⁰⁶(107-digit number)
20155539026871700553…99248160833694760961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.031 × 10¹⁰⁶(107-digit number)
40311078053743401106…98496321667389521921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.062 × 10¹⁰⁶(107-digit number)
80622156107486802212…96992643334779043841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.612 × 10¹⁰⁷(108-digit number)
16124431221497360442…93985286669558087681
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,756,606 XPM·at block #6,814,065 · 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