Block #2,298,981

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/17/2017, 6:50:03 AM · Difficulty 10.9412 · 4,544,354 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3333791cf95169b9fb6136701bd07ffc7d14e95fd619f5dc58d07a75c1c0e94b

Height

#2,298,981

Difficulty

10.941165

Transactions

6

Size

1.52 KB

Version

2

Bits

0af0f02a

Nonce

239,784,162

Timestamp

9/17/2017, 6:50:03 AM

Confirmations

4,544,354

Merkle Root

9d76111a18947cb7acda68f9b634a5ddec4af9500c1bf2b59dfffacc69f6bb93
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.818 × 10⁹⁵(96-digit number)
58186640298532766284…47768022930874601599
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.818 × 10⁹⁵(96-digit number)
58186640298532766284…47768022930874601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.163 × 10⁹⁶(97-digit number)
11637328059706553256…95536045861749203199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.327 × 10⁹⁶(97-digit number)
23274656119413106513…91072091723498406399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.654 × 10⁹⁶(97-digit number)
46549312238826213027…82144183446996812799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.309 × 10⁹⁶(97-digit number)
93098624477652426055…64288366893993625599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.861 × 10⁹⁷(98-digit number)
18619724895530485211…28576733787987251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.723 × 10⁹⁷(98-digit number)
37239449791060970422…57153467575974502399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.447 × 10⁹⁷(98-digit number)
74478899582121940844…14306935151949004799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.489 × 10⁹⁸(99-digit number)
14895779916424388168…28613870303898009599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.979 × 10⁹⁸(99-digit number)
29791559832848776337…57227740607796019199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.958 × 10⁹⁸(99-digit number)
59583119665697552675…14455481215592038399
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,991,042 XPM·at block #6,843,334 · 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