Block #2,761,094

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/23/2018, 4:16:13 AM · Difficulty 11.6536 · 4,084,095 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ffbb971f2ce2d585a9b7dc0ed4fbaa8a65e9c6df674a332817062b5594d5fa96

Height

#2,761,094

Difficulty

11.653557

Transactions

31

Size

8.86 KB

Version

2

Bits

0ba74f86

Nonce

331,013,106

Timestamp

7/23/2018, 4:16:13 AM

Confirmations

4,084,095

Merkle Root

010a8a8e6cd78ee77574f2f0b2661d9cb826f5b41779313f5c49028030b8c449
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.692 × 10⁹⁶(97-digit number)
46920626237340955066…88217108830205378561
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.692 × 10⁹⁶(97-digit number)
46920626237340955066…88217108830205378561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.384 × 10⁹⁶(97-digit number)
93841252474681910132…76434217660410757121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.876 × 10⁹⁷(98-digit number)
18768250494936382026…52868435320821514241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.753 × 10⁹⁷(98-digit number)
37536500989872764053…05736870641643028481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.507 × 10⁹⁷(98-digit number)
75073001979745528106…11473741283286056961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.501 × 10⁹⁸(99-digit number)
15014600395949105621…22947482566572113921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.002 × 10⁹⁸(99-digit number)
30029200791898211242…45894965133144227841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.005 × 10⁹⁸(99-digit number)
60058401583796422485…91789930266288455681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.201 × 10⁹⁹(100-digit number)
12011680316759284497…83579860532576911361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.402 × 10⁹⁹(100-digit number)
24023360633518568994…67159721065153822721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.804 × 10⁹⁹(100-digit number)
48046721267037137988…34319442130307645441
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,942 XPM·at block #6,845,188 · 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