Block #2,832,917

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/10/2018, 9:32:34 AM · Difficulty 11.7151 · 4,010,500 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
91414b0daa696a912d1519df08e47d58b52ea079a393810d96096aa0b88f596b

Height

#2,832,917

Difficulty

11.715085

Transactions

8

Size

2.83 KB

Version

2

Bits

0bb70fd1

Nonce

315,294,191

Timestamp

9/10/2018, 9:32:34 AM

Confirmations

4,010,500

Merkle Root

99b64ef5f287e544b84501c66878287b8f787cc86e61c68ddd4bbbe71eb83ff0
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.

2.540 × 10⁹⁶(97-digit number)
25409227453332014840…30746253555857873921
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
2.540 × 10⁹⁶(97-digit number)
25409227453332014840…30746253555857873921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.081 × 10⁹⁶(97-digit number)
50818454906664029680…61492507111715747841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.016 × 10⁹⁷(98-digit number)
10163690981332805936…22985014223431495681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.032 × 10⁹⁷(98-digit number)
20327381962665611872…45970028446862991361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.065 × 10⁹⁷(98-digit number)
40654763925331223744…91940056893725982721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.130 × 10⁹⁷(98-digit number)
81309527850662447488…83880113787451965441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.626 × 10⁹⁸(99-digit number)
16261905570132489497…67760227574903930881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.252 × 10⁹⁸(99-digit number)
32523811140264978995…35520455149807861761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.504 × 10⁹⁸(99-digit number)
65047622280529957990…71040910299615723521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.300 × 10⁹⁹(100-digit number)
13009524456105991598…42081820599231447041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.601 × 10⁹⁹(100-digit number)
26019048912211983196…84163641198462894081
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,991,704 XPM·at block #6,843,416 · 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