Block #2,638,709

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2018, 9:20:45 AM · Difficulty 11.5054 · 4,204,524 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
beda63293a3aac397eced384de3baebec5b16280a37194b6c204500813457245

Height

#2,638,709

Difficulty

11.505427

Transactions

2

Size

427 B

Version

2

Bits

0b8163a3

Nonce

3,902,178

Timestamp

4/30/2018, 9:20:45 AM

Confirmations

4,204,524

Merkle Root

a4b43e2971011f262979736a313fe4a5beb38d05151b69a2f41dc2e0d7c3bec5
Transactions (2)
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.360 × 10⁹⁶(97-digit number)
13603911032363575027…92707220128468486401
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.360 × 10⁹⁶(97-digit number)
13603911032363575027…92707220128468486401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.720 × 10⁹⁶(97-digit number)
27207822064727150054…85414440256936972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.441 × 10⁹⁶(97-digit number)
54415644129454300109…70828880513873945601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.088 × 10⁹⁷(98-digit number)
10883128825890860021…41657761027747891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.176 × 10⁹⁷(98-digit number)
21766257651781720043…83315522055495782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.353 × 10⁹⁷(98-digit number)
43532515303563440087…66631044110991564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.706 × 10⁹⁷(98-digit number)
87065030607126880174…33262088221983129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.741 × 10⁹⁸(99-digit number)
17413006121425376034…66524176443966259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.482 × 10⁹⁸(99-digit number)
34826012242850752069…33048352887932518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.965 × 10⁹⁸(99-digit number)
69652024485701504139…66096705775865036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.393 × 10⁹⁹(100-digit number)
13930404897140300827…32193411551730073601
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,990,239 XPM·at block #6,843,232 · 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