Block #2,640,560

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 1:19:31 AM · Difficulty 11.5857 · 4,191,642 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
54af0099234f3ee6856c64310175d2a611c884733eda9a3e2d3ff3626aed5f45

Height

#2,640,560

Difficulty

11.585716

Transactions

10

Size

3.92 KB

Version

2

Bits

0b95f175

Nonce

33,401,296

Timestamp

5/1/2018, 1:19:31 AM

Confirmations

4,191,642

Merkle Root

93744a6f8002c3d73034716f743af73538d1a50b6e7a13659c8f87297347d801
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.184 × 10⁹⁴(95-digit number)
11844277988359833678…51491646240397365801
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.184 × 10⁹⁴(95-digit number)
11844277988359833678…51491646240397365801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.368 × 10⁹⁴(95-digit number)
23688555976719667356…02983292480794731601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.737 × 10⁹⁴(95-digit number)
47377111953439334713…05966584961589463201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.475 × 10⁹⁴(95-digit number)
94754223906878669427…11933169923178926401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.895 × 10⁹⁵(96-digit number)
18950844781375733885…23866339846357852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.790 × 10⁹⁵(96-digit number)
37901689562751467770…47732679692715705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.580 × 10⁹⁵(96-digit number)
75803379125502935541…95465359385431411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.516 × 10⁹⁶(97-digit number)
15160675825100587108…90930718770862822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.032 × 10⁹⁶(97-digit number)
30321351650201174216…81861437541725644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.064 × 10⁹⁶(97-digit number)
60642703300402348433…63722875083451289601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.212 × 10⁹⁷(98-digit number)
12128540660080469686…27445750166902579201
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,901,751 XPM·at block #6,832,201 · 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