Block #2,675,638

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2018, 7:09:40 AM · Difficulty 11.7001 · 4,166,891 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c92063886f06ee820e8e5c89789c893066726c65a129ea032d130e93714f7b78

Height

#2,675,638

Difficulty

11.700130

Transactions

2

Size

1.43 KB

Version

2

Bits

0bb33bb7

Nonce

167,216,413

Timestamp

5/24/2018, 7:09:40 AM

Confirmations

4,166,891

Merkle Root

2cab449bc5727a3368d4160c9dbd212388fcf96b744de8aadbc28f489799f8c6
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.

1.096 × 10⁹⁶(97-digit number)
10966633747000496774…27769309483222195199
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.096 × 10⁹⁶(97-digit number)
10966633747000496774…27769309483222195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.193 × 10⁹⁶(97-digit number)
21933267494000993548…55538618966444390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.386 × 10⁹⁶(97-digit number)
43866534988001987096…11077237932888780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.773 × 10⁹⁶(97-digit number)
87733069976003974192…22154475865777561599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.754 × 10⁹⁷(98-digit number)
17546613995200794838…44308951731555123199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.509 × 10⁹⁷(98-digit number)
35093227990401589677…88617903463110246399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.018 × 10⁹⁷(98-digit number)
70186455980803179354…77235806926220492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.403 × 10⁹⁸(99-digit number)
14037291196160635870…54471613852440985599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.807 × 10⁹⁸(99-digit number)
28074582392321271741…08943227704881971199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.614 × 10⁹⁸(99-digit number)
56149164784642543483…17886455409763942399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.122 × 10⁹⁹(100-digit number)
11229832956928508696…35772910819527884799
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,984,654 XPM·at block #6,842,528 · 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