Block #2,621,854

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2018, 5:26:33 AM · Difficulty 11.2311 · 4,211,943 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
68ecf0799995cc1d011ec6600299aa082a4ae1ac1b8984adaeae739fccfb5367

Height

#2,621,854

Difficulty

11.231060

Transactions

7

Size

2.58 KB

Version

2

Bits

0b3b26b8

Nonce

121,388,329

Timestamp

4/20/2018, 5:26:33 AM

Confirmations

4,211,943

Merkle Root

96ab799118f79b4dfb2abb36f7ee6f962ce2ae650d9f6a0a7be4ade4869a6b35
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.598 × 10⁹²(93-digit number)
15987630321159079954…94071182817588719001
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.598 × 10⁹²(93-digit number)
15987630321159079954…94071182817588719001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.197 × 10⁹²(93-digit number)
31975260642318159908…88142365635177438001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.395 × 10⁹²(93-digit number)
63950521284636319816…76284731270354876001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.279 × 10⁹³(94-digit number)
12790104256927263963…52569462540709752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.558 × 10⁹³(94-digit number)
25580208513854527926…05138925081419504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.116 × 10⁹³(94-digit number)
51160417027709055852…10277850162839008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.023 × 10⁹⁴(95-digit number)
10232083405541811170…20555700325678016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.046 × 10⁹⁴(95-digit number)
20464166811083622341…41111400651356032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.092 × 10⁹⁴(95-digit number)
40928333622167244682…82222801302712064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.185 × 10⁹⁴(95-digit number)
81856667244334489364…64445602605424128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.637 × 10⁹⁵(96-digit number)
16371333448866897872…28891205210848256001
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,914,598 XPM·at block #6,833,796 · 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