Block #2,833,748

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/10/2018, 11:10:27 PM · Difficulty 11.7160 · 3,997,135 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
398cfa809070113c7a5104bcb7d8ae24cbf730ef7faedd1367d8ed9c22d3f352

Height

#2,833,748

Difficulty

11.716008

Transactions

9

Size

3.32 KB

Version

2

Bits

0bb74c54

Nonce

950,009,895

Timestamp

9/10/2018, 11:10:27 PM

Confirmations

3,997,135

Merkle Root

a8ecf85540578e0206745f76bf527fc7bd0aa0c699ae4b46aa0b07f761b12926
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.856 × 10⁹⁴(95-digit number)
38562672741752649643…80696288467380000641
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.856 × 10⁹⁴(95-digit number)
38562672741752649643…80696288467380000641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.712 × 10⁹⁴(95-digit number)
77125345483505299287…61392576934760001281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.542 × 10⁹⁵(96-digit number)
15425069096701059857…22785153869520002561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.085 × 10⁹⁵(96-digit number)
30850138193402119714…45570307739040005121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.170 × 10⁹⁵(96-digit number)
61700276386804239429…91140615478080010241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.234 × 10⁹⁶(97-digit number)
12340055277360847885…82281230956160020481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.468 × 10⁹⁶(97-digit number)
24680110554721695771…64562461912320040961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.936 × 10⁹⁶(97-digit number)
49360221109443391543…29124923824640081921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.872 × 10⁹⁶(97-digit number)
98720442218886783087…58249847649280163841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.974 × 10⁹⁷(98-digit number)
19744088443777356617…16499695298560327681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.948 × 10⁹⁷(98-digit number)
39488176887554713234…32999390597120655361
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,891,200 XPM·at block #6,830,882 · 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