Block #428,291

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2014, 11:29:25 PM · Difficulty 10.3488 · 6,381,078 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
588b0433efb27cf3b2ce23d486fbb07b6a2969637bfe6aa8f953b33d488b901a

Height

#428,291

Difficulty

10.348779

Transactions

2

Size

428 B

Version

2

Bits

0a594990

Nonce

126,719

Timestamp

3/3/2014, 11:29:25 PM

Confirmations

6,381,078

Merkle Root

cfdcef016fc4baf3858b22e010597bf13ddedc1981c1474e62ab731d8becfa81
Transactions (2)
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.005 × 10¹⁰⁰(101-digit number)
10057379766491044028…35663510252818040961
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.005 × 10¹⁰⁰(101-digit number)
10057379766491044028…35663510252818040961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.011 × 10¹⁰⁰(101-digit number)
20114759532982088057…71327020505636081921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.022 × 10¹⁰⁰(101-digit number)
40229519065964176114…42654041011272163841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.045 × 10¹⁰⁰(101-digit number)
80459038131928352229…85308082022544327681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.609 × 10¹⁰¹(102-digit number)
16091807626385670445…70616164045088655361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.218 × 10¹⁰¹(102-digit number)
32183615252771340891…41232328090177310721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.436 × 10¹⁰¹(102-digit number)
64367230505542681783…82464656180354621441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.287 × 10¹⁰²(103-digit number)
12873446101108536356…64929312360709242881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.574 × 10¹⁰²(103-digit number)
25746892202217072713…29858624721418485761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.149 × 10¹⁰²(103-digit number)
51493784404434145426…59717249442836971521
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,719,021 XPM·at block #6,809,368 · 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