Block #3,002,788

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2019, 12:30:03 AM · Difficulty 11.2010 · 3,841,949 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2577beef1cb1e8ec61eaa5c55916b0e93f7876bb909c1159f6a23d5e518deba4

Height

#3,002,788

Difficulty

11.200999

Transactions

2

Size

1017 B

Version

2

Bits

0b3374ae

Nonce

631,873,994

Timestamp

1/10/2019, 12:30:03 AM

Confirmations

3,841,949

Merkle Root

b492b3c9f37cf87c8b2c77a9feb02469f9e179d9ad91fec69d41cd84a43b2582
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.

2.612 × 10⁹⁶(97-digit number)
26124063758527309405…62155864916489932799
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
2.612 × 10⁹⁶(97-digit number)
26124063758527309405…62155864916489932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.224 × 10⁹⁶(97-digit number)
52248127517054618811…24311729832979865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.044 × 10⁹⁷(98-digit number)
10449625503410923762…48623459665959731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.089 × 10⁹⁷(98-digit number)
20899251006821847524…97246919331919462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.179 × 10⁹⁷(98-digit number)
41798502013643695049…94493838663838924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.359 × 10⁹⁷(98-digit number)
83597004027287390098…88987677327677849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.671 × 10⁹⁸(99-digit number)
16719400805457478019…77975354655355699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.343 × 10⁹⁸(99-digit number)
33438801610914956039…55950709310711398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.687 × 10⁹⁸(99-digit number)
66877603221829912078…11901418621422796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.337 × 10⁹⁹(100-digit number)
13375520644365982415…23802837242845593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.675 × 10⁹⁹(100-digit number)
26751041288731964831…47605674485691187199
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:58,002,307 XPM·at block #6,844,736 · 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