Block #398,672

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/10/2014, 9:38:43 PM · Difficulty 10.4239 · 6,412,432 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6e74cdc8b8871d011b443d9e5c351b722deac663a7126d9ac8b66dc83c766787

Height

#398,672

Difficulty

10.423855

Transactions

5

Size

1.08 KB

Version

2

Bits

0a6c81c8

Nonce

200,309

Timestamp

2/10/2014, 9:38:43 PM

Confirmations

6,412,432

Merkle Root

887ed6189a2d4712f97ac748a9d6160639b8a7dffb98deeafa15bc3e14fc491b
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.

7.318 × 10⁹⁹(100-digit number)
73180199395232937794…76309014966920043521
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
7.318 × 10⁹⁹(100-digit number)
73180199395232937794…76309014966920043521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.463 × 10¹⁰⁰(101-digit number)
14636039879046587558…52618029933840087041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.927 × 10¹⁰⁰(101-digit number)
29272079758093175117…05236059867680174081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.854 × 10¹⁰⁰(101-digit number)
58544159516186350235…10472119735360348161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.170 × 10¹⁰¹(102-digit number)
11708831903237270047…20944239470720696321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.341 × 10¹⁰¹(102-digit number)
23417663806474540094…41888478941441392641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.683 × 10¹⁰¹(102-digit number)
46835327612949080188…83776957882882785281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.367 × 10¹⁰¹(102-digit number)
93670655225898160377…67553915765765570561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.873 × 10¹⁰²(103-digit number)
18734131045179632075…35107831531531141121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.746 × 10¹⁰²(103-digit number)
37468262090359264150…70215663063062282241
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,732,939 XPM·at block #6,811,103 · 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