Block #3,945,246

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/11/2020, 3:15:27 PM · Difficulty 10.8711 · 2,871,351 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f63c6a636298da9e7c7009d1c832a45b5cba24150d8142b0521b3b352566ed1

Height

#3,945,246

Difficulty

10.871054

Transactions

5

Size

2.28 KB

Version

2

Bits

0adefd60

Nonce

1,224,155,233

Timestamp

11/11/2020, 3:15:27 PM

Confirmations

2,871,351

Merkle Root

9b67511522994c71cb71f891160e97dfb67d9f20c32d1a035e8b12200b130385
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.555 × 10⁹⁶(97-digit number)
15556195376675227945…16404608662494259199
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.555 × 10⁹⁶(97-digit number)
15556195376675227945…16404608662494259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.111 × 10⁹⁶(97-digit number)
31112390753350455891…32809217324988518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.222 × 10⁹⁶(97-digit number)
62224781506700911783…65618434649977036799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.244 × 10⁹⁷(98-digit number)
12444956301340182356…31236869299954073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.488 × 10⁹⁷(98-digit number)
24889912602680364713…62473738599908147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.977 × 10⁹⁷(98-digit number)
49779825205360729426…24947477199816294399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.955 × 10⁹⁷(98-digit number)
99559650410721458853…49894954399632588799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.991 × 10⁹⁸(99-digit number)
19911930082144291770…99789908799265177599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.982 × 10⁹⁸(99-digit number)
39823860164288583541…99579817598530355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.964 × 10⁹⁸(99-digit number)
79647720328577167082…99159635197060710399
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,776,901 XPM·at block #6,816,596 · 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