Block #428,748

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/4/2014, 8:02:33 AM · Difficulty 10.3418 · 6,380,947 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f06007fc4a64b230006a5bee7554e5a0af32d5d3543beae831511d7456eddff2

Height

#428,748

Difficulty

10.341844

Transactions

13

Size

9.78 KB

Version

2

Bits

0a57831f

Nonce

415

Timestamp

3/4/2014, 8:02:33 AM

Confirmations

6,380,947

Merkle Root

765b7259379076dbbd3b8fc9672db0609a34504e3fd6834659a3d7895224ccb4
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.227 × 10⁹⁹(100-digit number)
32272858843364052882…93848104268421522241
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.227 × 10⁹⁹(100-digit number)
32272858843364052882…93848104268421522241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.454 × 10⁹⁹(100-digit number)
64545717686728105765…87696208536843044481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.290 × 10¹⁰⁰(101-digit number)
12909143537345621153…75392417073686088961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.581 × 10¹⁰⁰(101-digit number)
25818287074691242306…50784834147372177921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.163 × 10¹⁰⁰(101-digit number)
51636574149382484612…01569668294744355841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.032 × 10¹⁰¹(102-digit number)
10327314829876496922…03139336589488711681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.065 × 10¹⁰¹(102-digit number)
20654629659752993844…06278673178977423361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.130 × 10¹⁰¹(102-digit number)
41309259319505987689…12557346357954846721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.261 × 10¹⁰¹(102-digit number)
82618518639011975379…25114692715909693441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.652 × 10¹⁰²(103-digit number)
16523703727802395075…50229385431819386881
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,721,637 XPM·at block #6,809,694 · 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