Block #2,833,980

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/11/2018, 3:16:26 AM · Difficulty 11.7153 · 4,009,119 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
060754f3af95ab3b72188cbfe2c52d418e7beba7712989465dd63b8b0aa7fdc8

Height

#2,833,980

Difficulty

11.715276

Transactions

3

Size

1.44 KB

Version

2

Bits

0bb71c52

Nonce

1,854,958,569

Timestamp

9/11/2018, 3:16:26 AM

Confirmations

4,009,119

Merkle Root

99846b693492f90565a06f031b09d47f8776164683ade33243637261621a1df5
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.

1.119 × 10⁹⁶(97-digit number)
11196793109075555878…47322599494961495041
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
1.119 × 10⁹⁶(97-digit number)
11196793109075555878…47322599494961495041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.239 × 10⁹⁶(97-digit number)
22393586218151111756…94645198989922990081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.478 × 10⁹⁶(97-digit number)
44787172436302223512…89290397979845980161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.957 × 10⁹⁶(97-digit number)
89574344872604447024…78580795959691960321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.791 × 10⁹⁷(98-digit number)
17914868974520889404…57161591919383920641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.582 × 10⁹⁷(98-digit number)
35829737949041778809…14323183838767841281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.165 × 10⁹⁷(98-digit number)
71659475898083557619…28646367677535682561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.433 × 10⁹⁸(99-digit number)
14331895179616711523…57292735355071365121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.866 × 10⁹⁸(99-digit number)
28663790359233423047…14585470710142730241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.732 × 10⁹⁸(99-digit number)
57327580718466846095…29170941420285460481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.146 × 10⁹⁹(100-digit number)
11465516143693369219…58341882840570920961
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,989,155 XPM·at block #6,843,098 · 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