Block #4,002,211

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/21/2020, 11:57:48 PM · Difficulty 10.8399 · 2,814,567 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
75b9f0f3a6e58eff2ee91114168c505efeaa2f181e6baf71c885da57a65ad8d9

Height

#4,002,211

Difficulty

10.839908

Transactions

8

Size

4.78 KB

Version

2

Bits

0ad70434

Nonce

292,165,812

Timestamp

12/21/2020, 11:57:48 PM

Confirmations

2,814,567

Merkle Root

94ba269230ba4255e46f2cba35bf0c9bb43fdf7a9ebc9c96571958c7f9d36ad9
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.

9.322 × 10⁹⁴(95-digit number)
93224364836338659829…72713734651488215679
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
9.322 × 10⁹⁴(95-digit number)
93224364836338659829…72713734651488215679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.864 × 10⁹⁵(96-digit number)
18644872967267731965…45427469302976431359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.728 × 10⁹⁵(96-digit number)
37289745934535463931…90854938605952862719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.457 × 10⁹⁵(96-digit number)
74579491869070927863…81709877211905725439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.491 × 10⁹⁶(97-digit number)
14915898373814185572…63419754423811450879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.983 × 10⁹⁶(97-digit number)
29831796747628371145…26839508847622901759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.966 × 10⁹⁶(97-digit number)
59663593495256742291…53679017695245803519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.193 × 10⁹⁷(98-digit number)
11932718699051348458…07358035390491607039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.386 × 10⁹⁷(98-digit number)
23865437398102696916…14716070780983214079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.773 × 10⁹⁷(98-digit number)
47730874796205393832…29432141561966428159
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,778,258 XPM·at block #6,816,777 · 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