1. #6,827,0621CC10 primes

    Cunningham 1st · ⛏️ coinsforall.io

  2. #6,827,0612CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #2,078,100

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2017, 6:11:00 PM · Difficulty 10.8523 · 4,748,963 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f03c9000bfaa749698c67acb531a3911a7029d917259f5c573423ff90b12f43c

Height

#2,078,100

Difficulty

10.852316

Transactions

40

Size

13.26 KB

Version

2

Bits

0ada315f

Nonce

768,741,902

Timestamp

4/19/2017, 6:11:00 PM

Confirmations

4,748,963

Merkle Root

e39c6b6af58c7d3a8791de2eef18dc797f808ac4f74a95947882aacd5facc940
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.

5.290 × 10⁹⁴(95-digit number)
52908994805243292275…42775929847235117441
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
5.290 × 10⁹⁴(95-digit number)
52908994805243292275…42775929847235117441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.058 × 10⁹⁵(96-digit number)
10581798961048658455…85551859694470234881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.116 × 10⁹⁵(96-digit number)
21163597922097316910…71103719388940469761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.232 × 10⁹⁵(96-digit number)
42327195844194633820…42207438777880939521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.465 × 10⁹⁵(96-digit number)
84654391688389267640…84414877555761879041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.693 × 10⁹⁶(97-digit number)
16930878337677853528…68829755111523758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.386 × 10⁹⁶(97-digit number)
33861756675355707056…37659510223047516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.772 × 10⁹⁶(97-digit number)
67723513350711414112…75319020446095032321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.354 × 10⁹⁷(98-digit number)
13544702670142282822…50638040892190064641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.708 × 10⁹⁷(98-digit number)
27089405340284565645…01276081784380129281
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,860,688 XPM·at block #6,827,062 · 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