Block #2,837,590

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/13/2018, 3:17:47 PM · Difficulty 11.7159 · 3,996,264 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e77966560782d24d366ee2b6af022f60c8b66dc54dfa2e9d9c16a17f4bfd1f81

Height

#2,837,590

Difficulty

11.715925

Transactions

5

Size

2.24 KB

Version

2

Bits

0bb746e3

Nonce

2,074,002,149

Timestamp

9/13/2018, 3:17:47 PM

Confirmations

3,996,264

Merkle Root

46b7f9e89ec85ddb38da768d900d8604772fb9ce65a3662f69aa026c84e055c6
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.323 × 10⁹⁴(95-digit number)
63235057174746634418…09813515589575475201
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.323 × 10⁹⁴(95-digit number)
63235057174746634418…09813515589575475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.264 × 10⁹⁵(96-digit number)
12647011434949326883…19627031179150950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.529 × 10⁹⁵(96-digit number)
25294022869898653767…39254062358301900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.058 × 10⁹⁵(96-digit number)
50588045739797307534…78508124716603801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.011 × 10⁹⁶(97-digit number)
10117609147959461506…57016249433207603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.023 × 10⁹⁶(97-digit number)
20235218295918923013…14032498866415206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.047 × 10⁹⁶(97-digit number)
40470436591837846027…28064997732830412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.094 × 10⁹⁶(97-digit number)
80940873183675692055…56129995465660825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.618 × 10⁹⁷(98-digit number)
16188174636735138411…12259990931321651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.237 × 10⁹⁷(98-digit number)
32376349273470276822…24519981862643302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.475 × 10⁹⁷(98-digit number)
64752698546940553644…49039963725286604801
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,915,063 XPM·at block #6,833,853 · 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