Block #2,811,417

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/27/2018, 12:02:09 AM · Difficulty 11.6672 · 4,031,534 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
37454a284345ab0c57efc0167ee981e7d22ceea7e1e6590cdca3bbf9bb38a0c3

Height

#2,811,417

Difficulty

11.667218

Transactions

15

Size

5.31 KB

Version

2

Bits

0baacecd

Nonce

94,992,868

Timestamp

8/27/2018, 12:02:09 AM

Confirmations

4,031,534

Merkle Root

6c8779610c3cd13b095ae1a7c9b9f7c47bcce66b797e1bdcb736a5ab2d5ec855
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.949 × 10⁹⁵(96-digit number)
49490149876798474858…01839213285438420481
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.949 × 10⁹⁵(96-digit number)
49490149876798474858…01839213285438420481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.898 × 10⁹⁵(96-digit number)
98980299753596949717…03678426570876840961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.979 × 10⁹⁶(97-digit number)
19796059950719389943…07356853141753681921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.959 × 10⁹⁶(97-digit number)
39592119901438779886…14713706283507363841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.918 × 10⁹⁶(97-digit number)
79184239802877559773…29427412567014727681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.583 × 10⁹⁷(98-digit number)
15836847960575511954…58854825134029455361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.167 × 10⁹⁷(98-digit number)
31673695921151023909…17709650268058910721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.334 × 10⁹⁷(98-digit number)
63347391842302047818…35419300536117821441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.266 × 10⁹⁸(99-digit number)
12669478368460409563…70838601072235642881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.533 × 10⁹⁸(99-digit number)
25338956736920819127…41677202144471285761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.067 × 10⁹⁸(99-digit number)
50677913473841638255…83354404288942571521
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,987,960 XPM·at block #6,842,950 · 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