Block #3,000,243

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2019, 3:57:51 AM · Difficulty 11.2212 · 3,840,932 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1929ad08e6a9f17e726164aa622374c4e1667a45589753b337710cfdf7691f50

Height

#3,000,243

Difficulty

11.221236

Transactions

44

Size

12.63 KB

Version

2

Bits

0b38a2e8

Nonce

674,211,343

Timestamp

1/8/2019, 3:57:51 AM

Confirmations

3,840,932

Merkle Root

8d45a01be57ddfbb290fabec7dc9b5aed457ddd37b0a89062c4f11dbcadeaef1
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.098 × 10⁹⁷(98-digit number)
10983638124183184771…09733005812464243199
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.098 × 10⁹⁷(98-digit number)
10983638124183184771…09733005812464243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.196 × 10⁹⁷(98-digit number)
21967276248366369543…19466011624928486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.393 × 10⁹⁷(98-digit number)
43934552496732739087…38932023249856972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.786 × 10⁹⁷(98-digit number)
87869104993465478174…77864046499713945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.757 × 10⁹⁸(99-digit number)
17573820998693095634…55728092999427891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.514 × 10⁹⁸(99-digit number)
35147641997386191269…11456185998855782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.029 × 10⁹⁸(99-digit number)
70295283994772382539…22912371997711564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.405 × 10⁹⁹(100-digit number)
14059056798954476507…45824743995423129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.811 × 10⁹⁹(100-digit number)
28118113597908953015…91649487990846259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.623 × 10⁹⁹(100-digit number)
56236227195817906031…83298975981692518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.124 × 10¹⁰⁰(101-digit number)
11247245439163581206…66597951963385036799
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,973,758 XPM·at block #6,841,174 · 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