Block #462,189

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/27/2014, 7:11:59 AM · Difficulty 10.4075 · 6,354,501 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
42d15f8bd77e1eedb8029b379ddd47d104d749ac0c50b48503117cdf640f268c

Height

#462,189

Difficulty

10.407472

Transactions

10

Size

2.19 KB

Version

2

Bits

0a68501c

Nonce

214,580

Timestamp

3/27/2014, 7:11:59 AM

Confirmations

6,354,501

Merkle Root

29deadde81f7a639e65cf94a01b3a658af8ef259aa96c0049e536e891b9c723c
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.

1.782 × 10⁹⁸(99-digit number)
17828941850810041302…42474355438448373761
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
1.782 × 10⁹⁸(99-digit number)
17828941850810041302…42474355438448373761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.565 × 10⁹⁸(99-digit number)
35657883701620082604…84948710876896747521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.131 × 10⁹⁸(99-digit number)
71315767403240165208…69897421753793495041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.426 × 10⁹⁹(100-digit number)
14263153480648033041…39794843507586990081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.852 × 10⁹⁹(100-digit number)
28526306961296066083…79589687015173980161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.705 × 10⁹⁹(100-digit number)
57052613922592132167…59179374030347960321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.141 × 10¹⁰⁰(101-digit number)
11410522784518426433…18358748060695920641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.282 × 10¹⁰⁰(101-digit number)
22821045569036852866…36717496121391841281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.564 × 10¹⁰⁰(101-digit number)
45642091138073705733…73434992242783682561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.128 × 10¹⁰⁰(101-digit number)
91284182276147411467…46869984485567365121
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,777,641 XPM·at block #6,816,689 · 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