Block #2,830,406

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/8/2018, 3:21:59 PM · Difficulty 11.7161 · 4,001,291 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
926d9ce2afbe1b71d4c34ff5dfdb061ab3bdc4e247192aac6051303b30bab762

Height

#2,830,406

Difficulty

11.716050

Transactions

5

Size

1.94 KB

Version

2

Bits

0bb74f0f

Nonce

1,443,441,123

Timestamp

9/8/2018, 3:21:59 PM

Confirmations

4,001,291

Merkle Root

26a4a7036a43f30b93dd53e80f659aac1c439871ee76d3f7606ac6b6df92d97e
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.823 × 10⁹⁴(95-digit number)
18230377967695686816…98001808975098744241
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.823 × 10⁹⁴(95-digit number)
18230377967695686816…98001808975098744241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.646 × 10⁹⁴(95-digit number)
36460755935391373632…96003617950197488481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.292 × 10⁹⁴(95-digit number)
72921511870782747264…92007235900394976961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.458 × 10⁹⁵(96-digit number)
14584302374156549452…84014471800789953921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.916 × 10⁹⁵(96-digit number)
29168604748313098905…68028943601579907841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.833 × 10⁹⁵(96-digit number)
58337209496626197811…36057887203159815681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.166 × 10⁹⁶(97-digit number)
11667441899325239562…72115774406319631361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.333 × 10⁹⁶(97-digit number)
23334883798650479124…44231548812639262721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.666 × 10⁹⁶(97-digit number)
46669767597300958249…88463097625278525441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.333 × 10⁹⁶(97-digit number)
93339535194601916499…76926195250557050881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.866 × 10⁹⁷(98-digit number)
18667907038920383299…53852390501114101761
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,897,685 XPM·at block #6,831,696 · 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