1. #6,825,0321CC10 primes

    Cunningham 1st · ⛏️ coinsforall.io

  2. #6,825,0312CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #399,143

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/11/2014, 6:24:38 AM · Difficulty 10.4191 · 6,425,890 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
020ebbd79e8e65c31f46e2a74eb9076aae969ea312d2e9d81dd9316f0952b3ce

Height

#399,143

Difficulty

10.419145

Transactions

1

Size

969 B

Version

2

Bits

0a6b4d1b

Nonce

77,260

Timestamp

2/11/2014, 6:24:38 AM

Confirmations

6,425,890

Merkle Root

7ef18681de4c3d4c909fbeedd9f89ffd7e3d1d27681de2ccb8fe66779561e143
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.553 × 10⁹⁵(96-digit number)
15531538337049282109…33143014754415102181
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.553 × 10⁹⁵(96-digit number)
15531538337049282109…33143014754415102181
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.106 × 10⁹⁵(96-digit number)
31063076674098564218…66286029508830204361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.212 × 10⁹⁵(96-digit number)
62126153348197128436…32572059017660408721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.242 × 10⁹⁶(97-digit number)
12425230669639425687…65144118035320817441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.485 × 10⁹⁶(97-digit number)
24850461339278851374…30288236070641634881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.970 × 10⁹⁶(97-digit number)
49700922678557702749…60576472141283269761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.940 × 10⁹⁶(97-digit number)
99401845357115405498…21152944282566539521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.988 × 10⁹⁷(98-digit number)
19880369071423081099…42305888565133079041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.976 × 10⁹⁷(98-digit number)
39760738142846162199…84611777130266158081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.952 × 10⁹⁷(98-digit number)
79521476285692324398…69223554260532316161
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,347 XPM·at block #6,825,032 · 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