Block #426,410

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/2/2014, 2:18:23 PM · Difficulty 10.3616 · 6,381,895 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
50724d5e099fce79593c4c118f686eaf82efa7b5d4d81833e5afcba2786ca8ca

Height

#426,410

Difficulty

10.361578

Transactions

3

Size

1.48 KB

Version

2

Bits

0a5c9061

Nonce

330,161

Timestamp

3/2/2014, 2:18:23 PM

Confirmations

6,381,895

Merkle Root

3d67b2291c8ecedd4af8e520f2783e791342f9f645e26b943537a8bbc6e3c53a
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.283 × 10⁹⁹(100-digit number)
12836920210395347882…37635814953521894401
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.283 × 10⁹⁹(100-digit number)
12836920210395347882…37635814953521894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.567 × 10⁹⁹(100-digit number)
25673840420790695765…75271629907043788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.134 × 10⁹⁹(100-digit number)
51347680841581391531…50543259814087577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.026 × 10¹⁰⁰(101-digit number)
10269536168316278306…01086519628175155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.053 × 10¹⁰⁰(101-digit number)
20539072336632556612…02173039256350310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.107 × 10¹⁰⁰(101-digit number)
41078144673265113224…04346078512700620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.215 × 10¹⁰⁰(101-digit number)
82156289346530226449…08692157025401241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.643 × 10¹⁰¹(102-digit number)
16431257869306045289…17384314050802483201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.286 × 10¹⁰¹(102-digit number)
32862515738612090579…34768628101604966401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.572 × 10¹⁰¹(102-digit number)
65725031477224181159…69537256203209932801
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,710,494 XPM·at block #6,808,304 · 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