1. #6,816,7542CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

  2. #6,816,753TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #388,265

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/3/2014, 4:39:46 PM · Difficulty 10.4175 · 6,428,490 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e9516cbc5af23245e455ad68265f17d3b8b4319b5b7ca998029e8563de9a2a06

Height

#388,265

Difficulty

10.417488

Transactions

7

Size

2.36 KB

Version

2

Bits

0a6ae07e

Nonce

5,211

Timestamp

2/3/2014, 4:39:46 PM

Confirmations

6,428,490

Merkle Root

3ec9630a0f9d25700ab994fe14e2f550173f776a45a7a3380c9f6f5f454290c0
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.

8.324 × 10⁹⁶(97-digit number)
83241747848165848184…82268489300281341261
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
8.324 × 10⁹⁶(97-digit number)
83241747848165848184…82268489300281341261
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.664 × 10⁹⁷(98-digit number)
16648349569633169636…64536978600562682521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.329 × 10⁹⁷(98-digit number)
33296699139266339273…29073957201125365041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.659 × 10⁹⁷(98-digit number)
66593398278532678547…58147914402250730081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.331 × 10⁹⁸(99-digit number)
13318679655706535709…16295828804501460161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.663 × 10⁹⁸(99-digit number)
26637359311413071419…32591657609002920321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.327 × 10⁹⁸(99-digit number)
53274718622826142838…65183315218005840641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.065 × 10⁹⁹(100-digit number)
10654943724565228567…30366630436011681281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.130 × 10⁹⁹(100-digit number)
21309887449130457135…60733260872023362561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.261 × 10⁹⁹(100-digit number)
42619774898260914270…21466521744046725121
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,778,071 XPM·at block #6,816,754 · 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