Block #2,651,733

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2018, 1:32:48 AM · Difficulty 11.7491 · 4,188,748 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d132400eadf963e3c4b4f592fa2ee2d3e338d326093d24cdbcd2c3504b81a9b4

Height

#2,651,733

Difficulty

11.749083

Transactions

4

Size

30.19 KB

Version

2

Bits

0bbfc3e5

Nonce

189,293,779

Timestamp

5/7/2018, 1:32:48 AM

Confirmations

4,188,748

Merkle Root

3aa9482469e83f4468478847e59588b3f84b1dadacbbecdae31033d3c509f320
Transactions (4)
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.788 × 10⁹⁶(97-digit number)
17887978424238616901…89332975143900323839
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.788 × 10⁹⁶(97-digit number)
17887978424238616901…89332975143900323839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.577 × 10⁹⁶(97-digit number)
35775956848477233802…78665950287800647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.155 × 10⁹⁶(97-digit number)
71551913696954467604…57331900575601295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.431 × 10⁹⁷(98-digit number)
14310382739390893520…14663801151202590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.862 × 10⁹⁷(98-digit number)
28620765478781787041…29327602302405181439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.724 × 10⁹⁷(98-digit number)
57241530957563574083…58655204604810362879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.144 × 10⁹⁸(99-digit number)
11448306191512714816…17310409209620725759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.289 × 10⁹⁸(99-digit number)
22896612383025429633…34620818419241451519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.579 × 10⁹⁸(99-digit number)
45793224766050859266…69241636838482903039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.158 × 10⁹⁸(99-digit number)
91586449532101718533…38483273676965806079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.831 × 10⁹⁹(100-digit number)
18317289906420343706…76966547353931612159
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,968,178 XPM·at block #6,840,480 · 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