Block #406,999

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2014, 3:36:47 PM · Difficulty 10.4332 · 6,408,139 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7746483c747ce0f9ef7bf7f3582957b4b373834a8b8ee581a310662446851f7f

Height

#406,999

Difficulty

10.433158

Transactions

8

Size

5.03 KB

Version

2

Bits

0a6ee376

Nonce

6,771

Timestamp

2/16/2014, 3:36:47 PM

Confirmations

6,408,139

Merkle Root

4984909e7cd0201de9401955cab04f556634ba53f41a348bcab33de9144b0707
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.719 × 10⁹⁶(97-digit number)
37196811435212399075…69394651530383788161
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.719 × 10⁹⁶(97-digit number)
37196811435212399075…69394651530383788161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.439 × 10⁹⁶(97-digit number)
74393622870424798151…38789303060767576321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.487 × 10⁹⁷(98-digit number)
14878724574084959630…77578606121535152641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.975 × 10⁹⁷(98-digit number)
29757449148169919260…55157212243070305281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.951 × 10⁹⁷(98-digit number)
59514898296339838520…10314424486140610561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.190 × 10⁹⁸(99-digit number)
11902979659267967704…20628848972281221121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.380 × 10⁹⁸(99-digit number)
23805959318535935408…41257697944562442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.761 × 10⁹⁸(99-digit number)
47611918637071870816…82515395889124884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.522 × 10⁹⁸(99-digit number)
95223837274143741633…65030791778249768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.904 × 10⁹⁹(100-digit number)
19044767454828748326…30061583556499537921
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,765,197 XPM·at block #6,815,137 · 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