Block #4,008,264

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2020, 2:05:57 AM · Difficulty 10.8452 · 2,805,971 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8728c3d9da53109749b17a86ed58e561bfd0ba5d81d6a440280bc74e2ccd2869

Height

#4,008,264

Difficulty

10.845174

Transactions

2

Size

2.36 KB

Version

2

Bits

0ad85d56

Nonce

179,505,070

Timestamp

12/26/2020, 2:05:57 AM

Confirmations

2,805,971

Merkle Root

681f3c34f1e87fa4a1d006180b36f8066a51647ddd1e71b236f83f0a0162a1d5
Transactions (2)
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.

7.427 × 10⁹⁵(96-digit number)
74278148322439613638…41437837152162672639
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
7.427 × 10⁹⁵(96-digit number)
74278148322439613638…41437837152162672639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.485 × 10⁹⁶(97-digit number)
14855629664487922727…82875674304325345279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.971 × 10⁹⁶(97-digit number)
29711259328975845455…65751348608650690559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.942 × 10⁹⁶(97-digit number)
59422518657951690910…31502697217301381119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.188 × 10⁹⁷(98-digit number)
11884503731590338182…63005394434602762239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.376 × 10⁹⁷(98-digit number)
23769007463180676364…26010788869205524479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.753 × 10⁹⁷(98-digit number)
47538014926361352728…52021577738411048959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.507 × 10⁹⁷(98-digit number)
95076029852722705456…04043155476822097919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.901 × 10⁹⁸(99-digit number)
19015205970544541091…08086310953644195839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.803 × 10⁹⁸(99-digit number)
38030411941089082182…16172621907288391679
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,757,952 XPM·at block #6,814,234 · 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