1. #6,809,6492CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #322,831

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2013, 6:59:32 AM · Difficulty 10.1922 · 6,486,819 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
11c93ab1d2bfe77e0810317e031cf9f15d73ba3ce5c2a6c6d7129caf3674eb23

Height

#322,831

Difficulty

10.192237

Transactions

12

Size

3.03 KB

Version

2

Bits

0a31366a

Nonce

111,511

Timestamp

12/21/2013, 6:59:32 AM

Confirmations

6,486,819

Merkle Root

539aeb2579de735441a556a2ed5a8cfcd6bfa4c9c5024fd4f9882590051315fc
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.

6.323 × 10⁹⁹(100-digit number)
63237166041480136488…24807172216038946561
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
6.323 × 10⁹⁹(100-digit number)
63237166041480136488…24807172216038946561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.264 × 10¹⁰⁰(101-digit number)
12647433208296027297…49614344432077893121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.529 × 10¹⁰⁰(101-digit number)
25294866416592054595…99228688864155786241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.058 × 10¹⁰⁰(101-digit number)
50589732833184109191…98457377728311572481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.011 × 10¹⁰¹(102-digit number)
10117946566636821838…96914755456623144961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.023 × 10¹⁰¹(102-digit number)
20235893133273643676…93829510913246289921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.047 × 10¹⁰¹(102-digit number)
40471786266547287352…87659021826492579841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.094 × 10¹⁰¹(102-digit number)
80943572533094574705…75318043652985159681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.618 × 10¹⁰²(103-digit number)
16188714506618914941…50636087305970319361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.237 × 10¹⁰²(103-digit number)
32377429013237829882…01272174611940638721
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,281 XPM·at block #6,809,649 · 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