Block #2,824,820

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/4/2018, 8:22:19 PM · Difficulty 11.7086 · 4,008,415 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
daa76e0e32d21418b9527b50cfb126729711a19e445dbbf0015b3d641959c4ac

Height

#2,824,820

Difficulty

11.708634

Transactions

4

Size

812 B

Version

2

Bits

0bb56904

Nonce

1,612,589,153

Timestamp

9/4/2018, 8:22:19 PM

Confirmations

4,008,415

Merkle Root

2e6df660e7d5a1cce69da387f6f907344b63760fc5e0046272bb049b7ebe7131
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.

4.177 × 10⁹⁴(95-digit number)
41774060180435942203…64850909583704475841
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
4.177 × 10⁹⁴(95-digit number)
41774060180435942203…64850909583704475841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.354 × 10⁹⁴(95-digit number)
83548120360871884406…29701819167408951681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.670 × 10⁹⁵(96-digit number)
16709624072174376881…59403638334817903361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.341 × 10⁹⁵(96-digit number)
33419248144348753762…18807276669635806721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.683 × 10⁹⁵(96-digit number)
66838496288697507525…37614553339271613441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.336 × 10⁹⁶(97-digit number)
13367699257739501505…75229106678543226881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.673 × 10⁹⁶(97-digit number)
26735398515479003010…50458213357086453761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.347 × 10⁹⁶(97-digit number)
53470797030958006020…00916426714172907521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.069 × 10⁹⁷(98-digit number)
10694159406191601204…01832853428345815041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.138 × 10⁹⁷(98-digit number)
21388318812383202408…03665706856691630081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.277 × 10⁹⁷(98-digit number)
42776637624766404816…07331413713383260161
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,910,067 XPM·at block #6,833,234 · 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