1. #6,825,0122CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

  2. #6,825,0111CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #345,791

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 4:08:17 AM · Difficulty 10.2133 · 6,479,222 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b558230ab00bf62b64fa57c7575619a0f3c10f9194991baa5c142b615de43a1

Height

#345,791

Difficulty

10.213273

Transactions

7

Size

2.49 KB

Version

2

Bits

0a369911

Nonce

107,981

Timestamp

1/6/2014, 4:08:17 AM

Confirmations

6,479,222

Merkle Root

563d7187c563ed6051a417222a0bdea420b607765896890dd36e01e1222afe5e
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.060 × 10¹⁰¹(102-digit number)
10601860732935024791…20919913495079492641
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.060 × 10¹⁰¹(102-digit number)
10601860732935024791…20919913495079492641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.120 × 10¹⁰¹(102-digit number)
21203721465870049582…41839826990158985281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.240 × 10¹⁰¹(102-digit number)
42407442931740099165…83679653980317970561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.481 × 10¹⁰¹(102-digit number)
84814885863480198330…67359307960635941121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.696 × 10¹⁰²(103-digit number)
16962977172696039666…34718615921271882241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.392 × 10¹⁰²(103-digit number)
33925954345392079332…69437231842543764481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.785 × 10¹⁰²(103-digit number)
67851908690784158664…38874463685087528961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.357 × 10¹⁰³(104-digit number)
13570381738156831732…77748927370175057921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.714 × 10¹⁰³(104-digit number)
27140763476313663465…55497854740350115841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.428 × 10¹⁰³(104-digit number)
54281526952627326931…10995709480700231681
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,844,189 XPM·at block #6,825,012 · 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