Block #2,816,569

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/30/2018, 8:34:56 AM · Difficulty 11.6879 · 4,016,153 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
de480cb673182c34c19eeb723d51293bc5e504d275b3228c7527f04f96226cb4

Height

#2,816,569

Difficulty

11.687946

Transactions

3

Size

1.00 KB

Version

2

Bits

0bb01d36

Nonce

602,679,010

Timestamp

8/30/2018, 8:34:56 AM

Confirmations

4,016,153

Merkle Root

ad79ab61f2bc6904706b5872397f575cc02ae54c5cf3847f7782c4082ab7317f
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.475 × 10⁹⁴(95-digit number)
74756827786676263246…36826962328867537199
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.475 × 10⁹⁴(95-digit number)
74756827786676263246…36826962328867537199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.495 × 10⁹⁵(96-digit number)
14951365557335252649…73653924657735074399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.990 × 10⁹⁵(96-digit number)
29902731114670505298…47307849315470148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.980 × 10⁹⁵(96-digit number)
59805462229341010596…94615698630940297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.196 × 10⁹⁶(97-digit number)
11961092445868202119…89231397261880595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.392 × 10⁹⁶(97-digit number)
23922184891736404238…78462794523761190399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.784 × 10⁹⁶(97-digit number)
47844369783472808477…56925589047522380799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.568 × 10⁹⁶(97-digit number)
95688739566945616955…13851178095044761599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.913 × 10⁹⁷(98-digit number)
19137747913389123391…27702356190089523199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.827 × 10⁹⁷(98-digit number)
38275495826778246782…55404712380179046399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.655 × 10⁹⁷(98-digit number)
76550991653556493564…10809424760358092799
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,933 XPM·at block #6,832,721 · 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