Block #2,780,295

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/5/2018, 1:12:32 PM · Difficulty 11.6505 · 4,052,450 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2b7eca1a32a433348f15f08f14bea112133ae5157d16ce793766d3eb78082f73

Height

#2,780,295

Difficulty

11.650468

Transactions

9

Size

4.88 KB

Version

2

Bits

0ba68517

Nonce

634,006,095

Timestamp

8/5/2018, 1:12:32 PM

Confirmations

4,052,450

Merkle Root

a59ef3ede8e0ff52ebdad94655670ff41e72ee48298c07f88caf48ae453f1ca1
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.012 × 10⁹³(94-digit number)
30128569103982838740…97240274436835264001
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.012 × 10⁹³(94-digit number)
30128569103982838740…97240274436835264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.025 × 10⁹³(94-digit number)
60257138207965677481…94480548873670528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.205 × 10⁹⁴(95-digit number)
12051427641593135496…88961097747341056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.410 × 10⁹⁴(95-digit number)
24102855283186270992…77922195494682112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.820 × 10⁹⁴(95-digit number)
48205710566372541985…55844390989364224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.641 × 10⁹⁴(95-digit number)
96411421132745083970…11688781978728448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.928 × 10⁹⁵(96-digit number)
19282284226549016794…23377563957456896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.856 × 10⁹⁵(96-digit number)
38564568453098033588…46755127914913792001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.712 × 10⁹⁵(96-digit number)
77129136906196067176…93510255829827584001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.542 × 10⁹⁶(97-digit number)
15425827381239213435…87020511659655168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.085 × 10⁹⁶(97-digit number)
30851654762478426870…74041023319310336001
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,906,120 XPM·at block #6,832,744 · 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