Block #2,876,916

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/11/2018, 4:19:46 PM · Difficulty 11.6510 · 3,968,228 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e056f6db141ac969c99e2aefd64f82f19ea255f615ff7a9ed387114c06783c72

Height

#2,876,916

Difficulty

11.651005

Transactions

3

Size

3.10 KB

Version

2

Bits

0ba6a84a

Nonce

1,445,718,390

Timestamp

10/11/2018, 4:19:46 PM

Confirmations

3,968,228

Merkle Root

1c8b1a5cd503fe8cd4b6fbb3f84cf4736e3643ce6d2f61ccbad2c70a38150908
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.

7.098 × 10⁹⁶(97-digit number)
70983976819525223269…00540563479155322881
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.098 × 10⁹⁶(97-digit number)
70983976819525223269…00540563479155322881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.419 × 10⁹⁷(98-digit number)
14196795363905044653…01081126958310645761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.839 × 10⁹⁷(98-digit number)
28393590727810089307…02162253916621291521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.678 × 10⁹⁷(98-digit number)
56787181455620178615…04324507833242583041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.135 × 10⁹⁸(99-digit number)
11357436291124035723…08649015666485166081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.271 × 10⁹⁸(99-digit number)
22714872582248071446…17298031332970332161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.542 × 10⁹⁸(99-digit number)
45429745164496142892…34596062665940664321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.085 × 10⁹⁸(99-digit number)
90859490328992285785…69192125331881328641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.817 × 10⁹⁹(100-digit number)
18171898065798457157…38384250663762657281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.634 × 10⁹⁹(100-digit number)
36343796131596914314…76768501327525314561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.268 × 10⁹⁹(100-digit number)
72687592263193828628…53537002655050629121
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:58,005,580 XPM·at block #6,845,143 · 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