Block #428,884

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/4/2014, 10:14:46 AM · Difficulty 10.3428 · 6,385,194 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4f7afee70f9e8fc44c31541b381639af905277dcd090a79c0eb5de6ef01a20bf

Height

#428,884

Difficulty

10.342783

Transactions

4

Size

6.36 KB

Version

2

Bits

0a57c09f

Nonce

75,981

Timestamp

3/4/2014, 10:14:46 AM

Confirmations

6,385,194

Merkle Root

cfbd9bbb6fa6ae4979e3701e3324c4bdf9fedadfcffb0e152f4a678e1594cb7b
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.145 × 10⁹⁷(98-digit number)
11456712291705447705…46120754417362152961
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.145 × 10⁹⁷(98-digit number)
11456712291705447705…46120754417362152961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.291 × 10⁹⁷(98-digit number)
22913424583410895411…92241508834724305921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.582 × 10⁹⁷(98-digit number)
45826849166821790823…84483017669448611841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.165 × 10⁹⁷(98-digit number)
91653698333643581647…68966035338897223681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.833 × 10⁹⁸(99-digit number)
18330739666728716329…37932070677794447361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.666 × 10⁹⁸(99-digit number)
36661479333457432659…75864141355588894721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.332 × 10⁹⁸(99-digit number)
73322958666914865318…51728282711177789441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.466 × 10⁹⁹(100-digit number)
14664591733382973063…03456565422355578881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.932 × 10⁹⁹(100-digit number)
29329183466765946127…06913130844711157761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.865 × 10⁹⁹(100-digit number)
58658366933531892254…13826261689422315521
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,756,704 XPM·at block #6,814,077 · 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