Block #2,649,250

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2018, 2:29:06 AM · Difficulty 11.7654 · 4,182,649 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2f272bfd931483ec28a487d3aa88753751ff76ed782bcb6637672df7a5f8eb57

Height

#2,649,250

Difficulty

11.765367

Transactions

2

Size

426 B

Version

2

Bits

0bc3ef18

Nonce

51,619,365

Timestamp

5/5/2018, 2:29:06 AM

Confirmations

4,182,649

Merkle Root

08a9b1a6c60de5d711bca30668cbe260f02895dfc3658cbc44136efb4d26132e
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.

7.800 × 10⁹³(94-digit number)
78000184026978745412…52023717481185451839
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
7.800 × 10⁹³(94-digit number)
78000184026978745412…52023717481185451839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.560 × 10⁹⁴(95-digit number)
15600036805395749082…04047434962370903679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.120 × 10⁹⁴(95-digit number)
31200073610791498165…08094869924741807359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.240 × 10⁹⁴(95-digit number)
62400147221582996330…16189739849483614719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.248 × 10⁹⁵(96-digit number)
12480029444316599266…32379479698967229439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.496 × 10⁹⁵(96-digit number)
24960058888633198532…64758959397934458879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.992 × 10⁹⁵(96-digit number)
49920117777266397064…29517918795868917759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.984 × 10⁹⁵(96-digit number)
99840235554532794128…59035837591737835519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.996 × 10⁹⁶(97-digit number)
19968047110906558825…18071675183475671039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.993 × 10⁹⁶(97-digit number)
39936094221813117651…36143350366951342079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.987 × 10⁹⁶(97-digit number)
79872188443626235302…72286700733902684159
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,899,314 XPM·at block #6,831,898 · 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