Block #2,675,148

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/23/2018, 11:03:18 PM · Difficulty 11.6999 · 4,157,590 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c0d3346041e6cf9c22291504fcfe0391cbce70833562847c245ff652502aec7e

Height

#2,675,148

Difficulty

11.699895

Transactions

4

Size

992 B

Version

2

Bits

0bb32c59

Nonce

1,414,770,283

Timestamp

5/23/2018, 11:03:18 PM

Confirmations

4,157,590

Merkle Root

e3bceefa570f6b9dc427a39a7035f6077aaff24070bf65106c1e7c0839971f26
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.934 × 10⁹²(93-digit number)
79343924479089606231…28378154946401239999
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.934 × 10⁹²(93-digit number)
79343924479089606231…28378154946401239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.586 × 10⁹³(94-digit number)
15868784895817921246…56756309892802479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.173 × 10⁹³(94-digit number)
31737569791635842492…13512619785604959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.347 × 10⁹³(94-digit number)
63475139583271684985…27025239571209919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.269 × 10⁹⁴(95-digit number)
12695027916654336997…54050479142419839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.539 × 10⁹⁴(95-digit number)
25390055833308673994…08100958284839679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.078 × 10⁹⁴(95-digit number)
50780111666617347988…16201916569679359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.015 × 10⁹⁵(96-digit number)
10156022333323469597…32403833139358719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.031 × 10⁹⁵(96-digit number)
20312044666646939195…64807666278717439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.062 × 10⁹⁵(96-digit number)
40624089333293878390…29615332557434879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.124 × 10⁹⁵(96-digit number)
81248178666587756781…59230665114869759999
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,906,063 XPM·at block #6,832,737 · 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