Block #2,684,232

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/30/2018, 9:06:00 AM · Difficulty 11.6907 · 4,158,550 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a185184309c081240d44f5cd5d35a0df9b051a89e17192385d4a70e7d5d9d162

Height

#2,684,232

Difficulty

11.690656

Transactions

8

Size

2.37 KB

Version

2

Bits

0bb0ced0

Nonce

70,560,675

Timestamp

5/30/2018, 9:06:00 AM

Confirmations

4,158,550

Merkle Root

ecb38fa2c37488046d9642e3abc55731830bb40eca087b05f6dcbdbd0a8f2c2c
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.

3.425 × 10⁹⁷(98-digit number)
34259019636427704066…24962468143840829441
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
3.425 × 10⁹⁷(98-digit number)
34259019636427704066…24962468143840829441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.851 × 10⁹⁷(98-digit number)
68518039272855408133…49924936287681658881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.370 × 10⁹⁸(99-digit number)
13703607854571081626…99849872575363317761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.740 × 10⁹⁸(99-digit number)
27407215709142163253…99699745150726635521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.481 × 10⁹⁸(99-digit number)
54814431418284326507…99399490301453271041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.096 × 10⁹⁹(100-digit number)
10962886283656865301…98798980602906542081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.192 × 10⁹⁹(100-digit number)
21925772567313730602…97597961205813084161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.385 × 10⁹⁹(100-digit number)
43851545134627461205…95195922411626168321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.770 × 10⁹⁹(100-digit number)
87703090269254922411…90391844823252336641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.754 × 10¹⁰⁰(101-digit number)
17540618053850984482…80783689646504673281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.508 × 10¹⁰⁰(101-digit number)
35081236107701968964…61567379293009346561
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,986,595 XPM·at block #6,842,781 · 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