Block #398,791

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/10/2014, 11:57:20 PM · Difficulty 10.4221 · 6,412,124 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ba5b3a45b2f90404e8e5b3fe7950a485aca219de996af1d910ec3cc238a59414

Height

#398,791

Difficulty

10.422069

Transactions

1

Size

971 B

Version

2

Bits

0a6c0cbc

Nonce

15,661

Timestamp

2/10/2014, 11:57:20 PM

Confirmations

6,412,124

Merkle Root

671a23439d51ae490fc61c1656607ed8aaf245a7d53465cf9472cb8ceb8fdc86
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.914 × 10⁹⁹(100-digit number)
39146521409913524339…49254771146695928961
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.914 × 10⁹⁹(100-digit number)
39146521409913524339…49254771146695928961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.829 × 10⁹⁹(100-digit number)
78293042819827048678…98509542293391857921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.565 × 10¹⁰⁰(101-digit number)
15658608563965409735…97019084586783715841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.131 × 10¹⁰⁰(101-digit number)
31317217127930819471…94038169173567431681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.263 × 10¹⁰⁰(101-digit number)
62634434255861638942…88076338347134863361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.252 × 10¹⁰¹(102-digit number)
12526886851172327788…76152676694269726721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.505 × 10¹⁰¹(102-digit number)
25053773702344655577…52305353388539453441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.010 × 10¹⁰¹(102-digit number)
50107547404689311154…04610706777078906881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.002 × 10¹⁰²(103-digit number)
10021509480937862230…09221413554157813761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.004 × 10¹⁰²(103-digit number)
20043018961875724461…18442827108315627521
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,731,421 XPM·at block #6,810,914 · 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