Block #2,650,799

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/6/2018, 8:15:16 AM · Difficulty 11.7541 · 4,182,064 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
563ae4d9ff70f5f3d815b654c6bf9e3f412a1ed7e5ab193b1358446101f4c49b

Height

#2,650,799

Difficulty

11.754099

Transactions

6

Size

1.49 KB

Version

2

Bits

0bc10ca0

Nonce

1,686,011,659

Timestamp

5/6/2018, 8:15:16 AM

Confirmations

4,182,064

Merkle Root

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

2.584 × 10⁹⁶(97-digit number)
25847048102843896487…17498688902296453121
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
2.584 × 10⁹⁶(97-digit number)
25847048102843896487…17498688902296453121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.169 × 10⁹⁶(97-digit number)
51694096205687792974…34997377804592906241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.033 × 10⁹⁷(98-digit number)
10338819241137558594…69994755609185812481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.067 × 10⁹⁷(98-digit number)
20677638482275117189…39989511218371624961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.135 × 10⁹⁷(98-digit number)
41355276964550234379…79979022436743249921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.271 × 10⁹⁷(98-digit number)
82710553929100468758…59958044873486499841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.654 × 10⁹⁸(99-digit number)
16542110785820093751…19916089746972999681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.308 × 10⁹⁸(99-digit number)
33084221571640187503…39832179493945999361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.616 × 10⁹⁸(99-digit number)
66168443143280375006…79664358987891998721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.323 × 10⁹⁹(100-digit number)
13233688628656075001…59328717975783997441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.646 × 10⁹⁹(100-digit number)
26467377257312150002…18657435951567994881
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,907,073 XPM·at block #6,832,862 · 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