Block #2,647,752

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2018, 2:37:29 AM · Difficulty 11.7622 · 4,183,727 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6dadaa81e827075134c5423d78c125fafaaf1b57bd505a075096a75c6a9fff79

Height

#2,647,752

Difficulty

11.762197

Transactions

35

Size

8.73 KB

Version

2

Bits

0bc31f5a

Nonce

1,465,544,475

Timestamp

5/4/2018, 2:37:29 AM

Confirmations

4,183,727

Merkle Root

3b0fa447a43647f5dc821c7267c99d07f4991e24bf5ca92421c91b821d98eb7e
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.

7.732 × 10⁹⁷(98-digit number)
77320694155415595069…35094493332830760961
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
7.732 × 10⁹⁷(98-digit number)
77320694155415595069…35094493332830760961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.546 × 10⁹⁸(99-digit number)
15464138831083119013…70188986665661521921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.092 × 10⁹⁸(99-digit number)
30928277662166238027…40377973331323043841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.185 × 10⁹⁸(99-digit number)
61856555324332476055…80755946662646087681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.237 × 10⁹⁹(100-digit number)
12371311064866495211…61511893325292175361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.474 × 10⁹⁹(100-digit number)
24742622129732990422…23023786650584350721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.948 × 10⁹⁹(100-digit number)
49485244259465980844…46047573301168701441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.897 × 10⁹⁹(100-digit number)
98970488518931961688…92095146602337402881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.979 × 10¹⁰⁰(101-digit number)
19794097703786392337…84190293204674805761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.958 × 10¹⁰⁰(101-digit number)
39588195407572784675…68380586409349611521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.917 × 10¹⁰⁰(101-digit number)
79176390815145569350…36761172818699223041
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,895,924 XPM·at block #6,831,478 · 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