Block #2,841,665

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/16/2018, 9:37:46 AM · Difficulty 11.7211 · 3,989,628 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
57c98b3df03a2d7e68512a128f7aa3e6349baaf6b637fae2338a7979d12d0284

Height

#2,841,665

Difficulty

11.721081

Transactions

7

Size

3.08 KB

Version

2

Bits

0bb898ca

Nonce

38,504,393

Timestamp

9/16/2018, 9:37:46 AM

Confirmations

3,989,628

Merkle Root

629d2f1a67b34f380c45918fb56ec3fec2da06a4d861b3be378927c3261221a5
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.

6.248 × 10⁹⁵(96-digit number)
62487480766999210865…14459827046304661761
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
6.248 × 10⁹⁵(96-digit number)
62487480766999210865…14459827046304661761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.249 × 10⁹⁶(97-digit number)
12497496153399842173…28919654092609323521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.499 × 10⁹⁶(97-digit number)
24994992306799684346…57839308185218647041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.998 × 10⁹⁶(97-digit number)
49989984613599368692…15678616370437294081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.997 × 10⁹⁶(97-digit number)
99979969227198737384…31357232740874588161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.999 × 10⁹⁷(98-digit number)
19995993845439747476…62714465481749176321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.999 × 10⁹⁷(98-digit number)
39991987690879494953…25428930963498352641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.998 × 10⁹⁷(98-digit number)
79983975381758989907…50857861926996705281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.599 × 10⁹⁸(99-digit number)
15996795076351797981…01715723853993410561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.199 × 10⁹⁸(99-digit number)
31993590152703595963…03431447707986821121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.398 × 10⁹⁸(99-digit number)
63987180305407191926…06862895415973642241
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,894,490 XPM·at block #6,831,292 · 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