Block #3,024,822

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2019, 11:45:47 AM · Difficulty 11.1633 · 3,808,330 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bbfc2ec5c956a5a26bf94bb8e41723331af552e60c7f719f37a202afcd51c59c

Height

#3,024,822

Difficulty

11.163290

Transactions

9

Size

2.47 KB

Version

2

Bits

0b29cd65

Nonce

1,044,189,864

Timestamp

1/25/2019, 11:45:47 AM

Confirmations

3,808,330

Merkle Root

f078b71d26e9596e973be12dcea42f6e6d7d1acb4ceb50b66951cdee8e0f1174
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.918 × 10⁹⁴(95-digit number)
59187367866246683756…73850100921179494919
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.918 × 10⁹⁴(95-digit number)
59187367866246683756…73850100921179494919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.183 × 10⁹⁵(96-digit number)
11837473573249336751…47700201842358989839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.367 × 10⁹⁵(96-digit number)
23674947146498673502…95400403684717979679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.734 × 10⁹⁵(96-digit number)
47349894292997347005…90800807369435959359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.469 × 10⁹⁵(96-digit number)
94699788585994694011…81601614738871918719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.893 × 10⁹⁶(97-digit number)
18939957717198938802…63203229477743837439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.787 × 10⁹⁶(97-digit number)
37879915434397877604…26406458955487674879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.575 × 10⁹⁶(97-digit number)
75759830868795755208…52812917910975349759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.515 × 10⁹⁷(98-digit number)
15151966173759151041…05625835821950699519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.030 × 10⁹⁷(98-digit number)
30303932347518302083…11251671643901399039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.060 × 10⁹⁷(98-digit number)
60607864695036604167…22503343287802798079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,909,393 XPM·at block #6,833,151 · 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