Block #394,590

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/8/2014, 3:07:28 AM · Difficulty 10.4193 · 6,415,711 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e881e82b884766998aefeb1681dcac0432ae4a0baba6a2cb5d57fdfed887ab0d

Height

#394,590

Difficulty

10.419274

Transactions

2

Size

1.80 KB

Version

2

Bits

0a6b5587

Nonce

107,298

Timestamp

2/8/2014, 3:07:28 AM

Confirmations

6,415,711

Merkle Root

a29ef8f98d04e6534054a0ebf7c234063f5086a7f9c49d3ec20d95b49899f8cd
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.269 × 10⁹⁶(97-digit number)
42696820972291237348…62989747671816960961
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.269 × 10⁹⁶(97-digit number)
42696820972291237348…62989747671816960961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.539 × 10⁹⁶(97-digit number)
85393641944582474697…25979495343633921921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.707 × 10⁹⁷(98-digit number)
17078728388916494939…51958990687267843841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.415 × 10⁹⁷(98-digit number)
34157456777832989878…03917981374535687681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.831 × 10⁹⁷(98-digit number)
68314913555665979757…07835962749071375361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.366 × 10⁹⁸(99-digit number)
13662982711133195951…15671925498142750721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.732 × 10⁹⁸(99-digit number)
27325965422266391903…31343850996285501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.465 × 10⁹⁸(99-digit number)
54651930844532783806…62687701992571002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.093 × 10⁹⁹(100-digit number)
10930386168906556761…25375403985142005761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.186 × 10⁹⁹(100-digit number)
21860772337813113522…50750807970284011521
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,726,485 XPM·at block #6,810,300 · 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