Block #2,621,649

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2018, 2:21:21 AM · Difficulty 11.2283 · 4,209,345 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2c7e9b02c4ccad2aa296da54f1ca399cc364b5a7d1d226ea8d3666324ee4d235

Height

#2,621,649

Difficulty

11.228273

Transactions

3

Size

1.27 KB

Version

2

Bits

0b3a7016

Nonce

408,163,413

Timestamp

4/20/2018, 2:21:21 AM

Confirmations

4,209,345

Merkle Root

558a9c5d5796ee691e582fda503206d6ff217feba5045b35e61a77f0c3e1c3ce
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.

6.580 × 10⁹¹(92-digit number)
65802342358962487072…28984490022177405921
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
6.580 × 10⁹¹(92-digit number)
65802342358962487072…28984490022177405921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.316 × 10⁹²(93-digit number)
13160468471792497414…57968980044354811841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.632 × 10⁹²(93-digit number)
26320936943584994828…15937960088709623681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.264 × 10⁹²(93-digit number)
52641873887169989657…31875920177419247361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.052 × 10⁹³(94-digit number)
10528374777433997931…63751840354838494721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.105 × 10⁹³(94-digit number)
21056749554867995863…27503680709676989441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.211 × 10⁹³(94-digit number)
42113499109735991726…55007361419353978881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.422 × 10⁹³(94-digit number)
84226998219471983452…10014722838707957761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.684 × 10⁹⁴(95-digit number)
16845399643894396690…20029445677415915521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.369 × 10⁹⁴(95-digit number)
33690799287788793380…40058891354831831041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.738 × 10⁹⁴(95-digit number)
67381598575577586761…80117782709663662081
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,892,093 XPM·at block #6,830,993 · 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