1. #6,808,8751CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #3,560,344

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2020, 6:57:36 PM · Difficulty 10.9091 · 3,248,531 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5c29d79d8c8d4f8b72d4c069393e1d15699a51bfb67322c598e386e3955d7b04

Height

#3,560,344

Difficulty

10.909071

Transactions

15

Size

2.82 KB

Version

2

Bits

0ae8b8dc

Nonce

26,187,303

Timestamp

2/16/2020, 6:57:36 PM

Confirmations

3,248,531

Merkle Root

b1ae7b4c6e0e45981452e5409934f45b197e03ff1af65e62024df018179c1c43
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.051 × 10⁹⁵(96-digit number)
10515060842148422236…90903608691184665599
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.051 × 10⁹⁵(96-digit number)
10515060842148422236…90903608691184665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.103 × 10⁹⁵(96-digit number)
21030121684296844473…81807217382369331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.206 × 10⁹⁵(96-digit number)
42060243368593688946…63614434764738662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.412 × 10⁹⁵(96-digit number)
84120486737187377892…27228869529477324799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.682 × 10⁹⁶(97-digit number)
16824097347437475578…54457739058954649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.364 × 10⁹⁶(97-digit number)
33648194694874951156…08915478117909299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.729 × 10⁹⁶(97-digit number)
67296389389749902313…17830956235818598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.345 × 10⁹⁷(98-digit number)
13459277877949980462…35661912471637196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.691 × 10⁹⁷(98-digit number)
26918555755899960925…71323824943274393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.383 × 10⁹⁷(98-digit number)
53837111511799921851…42647649886548787199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,715,050 XPM·at block #6,808,874 · 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