Block #2,647,042

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/3/2018, 4:34:23 PM · Difficulty 11.7571 · 4,185,615 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f5f70d4a09215dd76d5af830d7ade1c45112ed36c67203f6e4edc394b682e89a

Height

#2,647,042

Difficulty

11.757106

Transactions

3

Size

1.36 KB

Version

2

Bits

0bc1d1ba

Nonce

1,216,695,595

Timestamp

5/3/2018, 4:34:23 PM

Confirmations

4,185,615

Merkle Root

e4c3d1b6e1d692a345467ede9676b5206780b2f988e55af1d155c90b21d41f36
Transactions (3)
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.173 × 10⁹⁵(96-digit number)
11735740510484647378…47432120541368807839
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.173 × 10⁹⁵(96-digit number)
11735740510484647378…47432120541368807839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.347 × 10⁹⁵(96-digit number)
23471481020969294757…94864241082737615679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.694 × 10⁹⁵(96-digit number)
46942962041938589514…89728482165475231359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.388 × 10⁹⁵(96-digit number)
93885924083877179029…79456964330950462719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.877 × 10⁹⁶(97-digit number)
18777184816775435805…58913928661900925439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.755 × 10⁹⁶(97-digit number)
37554369633550871611…17827857323801850879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.510 × 10⁹⁶(97-digit number)
75108739267101743223…35655714647603701759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.502 × 10⁹⁷(98-digit number)
15021747853420348644…71311429295207403519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.004 × 10⁹⁷(98-digit number)
30043495706840697289…42622858590414807039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.008 × 10⁹⁷(98-digit number)
60086991413681394578…85245717180829614079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.201 × 10⁹⁸(99-digit number)
12017398282736278915…70491434361659228159
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,905,407 XPM·at block #6,832,656 · 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