Block #397,101

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/9/2014, 8:29:04 PM · Difficulty 10.4164 · 6,419,491 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3297db76d5a2d2e280ee355a3c09b5eadd4614dd7b1e8cffc20269d67ed9b818

Height

#397,101

Difficulty

10.416390

Transactions

9

Size

3.26 KB

Version

2

Bits

0a6a988a

Nonce

214,599

Timestamp

2/9/2014, 8:29:04 PM

Confirmations

6,419,491

Merkle Root

3b0254e345b9119baa1abbae515a5551be4feb3363b4c548a943b564df1ad85a
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.738 × 10⁹⁸(99-digit number)
37387677701875409690…65920995488861534001
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.738 × 10⁹⁸(99-digit number)
37387677701875409690…65920995488861534001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.477 × 10⁹⁸(99-digit number)
74775355403750819381…31841990977723068001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.495 × 10⁹⁹(100-digit number)
14955071080750163876…63683981955446136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.991 × 10⁹⁹(100-digit number)
29910142161500327752…27367963910892272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.982 × 10⁹⁹(100-digit number)
59820284323000655504…54735927821784544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.196 × 10¹⁰⁰(101-digit number)
11964056864600131100…09471855643569088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.392 × 10¹⁰⁰(101-digit number)
23928113729200262201…18943711287138176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.785 × 10¹⁰⁰(101-digit number)
47856227458400524403…37887422574276352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.571 × 10¹⁰⁰(101-digit number)
95712454916801048807…75774845148552704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.914 × 10¹⁰¹(102-digit number)
19142490983360209761…51549690297105408001
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,776,860 XPM·at block #6,816,591 · 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