Block #2,650,590

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/6/2018, 4:15:24 AM · Difficulty 11.7557 · 4,191,319 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d47753c7d62b12df76c94ad11940adc44c7ffa079a9da65efb9d1c0db91095b6

Height

#2,650,590

Difficulty

11.755688

Transactions

2

Size

1019 B

Version

2

Bits

0bc174cb

Nonce

1,058,564,244

Timestamp

5/6/2018, 4:15:24 AM

Confirmations

4,191,319

Merkle Root

42026238ac7149b7849ce561a419330db7e04855a1a2ba25a2e216e1788676c2
Transactions (2)
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.634 × 10⁹⁶(97-digit number)
16343372868575189094…06046457386472596481
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.634 × 10⁹⁶(97-digit number)
16343372868575189094…06046457386472596481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.268 × 10⁹⁶(97-digit number)
32686745737150378188…12092914772945192961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.537 × 10⁹⁶(97-digit number)
65373491474300756376…24185829545890385921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.307 × 10⁹⁷(98-digit number)
13074698294860151275…48371659091780771841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.614 × 10⁹⁷(98-digit number)
26149396589720302550…96743318183561543681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.229 × 10⁹⁷(98-digit number)
52298793179440605100…93486636367123087361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.045 × 10⁹⁸(99-digit number)
10459758635888121020…86973272734246174721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.091 × 10⁹⁸(99-digit number)
20919517271776242040…73946545468492349441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.183 × 10⁹⁸(99-digit number)
41839034543552484080…47893090936984698881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.367 × 10⁹⁸(99-digit number)
83678069087104968161…95786181873969397761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.673 × 10⁹⁹(100-digit number)
16735613817420993632…91572363747938795521
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,979,647 XPM·at block #6,841,908 · 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