Block #2,649,310

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2018, 3:45:09 AM · Difficulty 11.7647 · 4,181,191 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
621b6e2955ea1802046bf8a5d9fb9e0c59b5a66cc8e4f83d63654e4f6489687a

Height

#2,649,310

Difficulty

11.764732

Transactions

5

Size

1.79 KB

Version

2

Bits

0bc3c578

Nonce

210,355,202

Timestamp

5/5/2018, 3:45:09 AM

Confirmations

4,181,191

Merkle Root

225dd8c09485e1030af8508fe997b5caca332bd5ae081708dc148309884fd65a
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.

9.033 × 10⁹³(94-digit number)
90332287438498026581…72070979866072448889
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
9.033 × 10⁹³(94-digit number)
90332287438498026581…72070979866072448889
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.806 × 10⁹⁴(95-digit number)
18066457487699605316…44141959732144897779
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.613 × 10⁹⁴(95-digit number)
36132914975399210632…88283919464289795559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.226 × 10⁹⁴(95-digit number)
72265829950798421265…76567838928579591119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.445 × 10⁹⁵(96-digit number)
14453165990159684253…53135677857159182239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.890 × 10⁹⁵(96-digit number)
28906331980319368506…06271355714318364479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.781 × 10⁹⁵(96-digit number)
57812663960638737012…12542711428636728959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.156 × 10⁹⁶(97-digit number)
11562532792127747402…25085422857273457919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.312 × 10⁹⁶(97-digit number)
23125065584255494804…50170845714546915839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.625 × 10⁹⁶(97-digit number)
46250131168510989609…00341691429093831679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.250 × 10⁹⁶(97-digit number)
92500262337021979219…00683382858187663359
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,888,257 XPM·at block #6,830,500 · 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