Block #2,634,083

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2018, 6:20:50 PM · Difficulty 11.2217 · 4,209,256 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6c1e611c24f0e8a2f7244ad1f7391fa1e4a99e4b1bcf878c96931c11b23d3521

Height

#2,634,083

Difficulty

11.221672

Transactions

2

Size

642 B

Version

2

Bits

0b38bf7b

Nonce

92,176,562

Timestamp

4/28/2018, 6:20:50 PM

Confirmations

4,209,256

Merkle Root

60049539ea53e36967fa1daa3ea1026491d9514a8fb2e2f35b28d60461b3fc30
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.

5.222 × 10⁹²(93-digit number)
52221208430908838423…56541666030093674241
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
5.222 × 10⁹²(93-digit number)
52221208430908838423…56541666030093674241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.044 × 10⁹³(94-digit number)
10444241686181767684…13083332060187348481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.088 × 10⁹³(94-digit number)
20888483372363535369…26166664120374696961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.177 × 10⁹³(94-digit number)
41776966744727070738…52333328240749393921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.355 × 10⁹³(94-digit number)
83553933489454141477…04666656481498787841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.671 × 10⁹⁴(95-digit number)
16710786697890828295…09333312962997575681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.342 × 10⁹⁴(95-digit number)
33421573395781656591…18666625925995151361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.684 × 10⁹⁴(95-digit number)
66843146791563313182…37333251851990302721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.336 × 10⁹⁵(96-digit number)
13368629358312662636…74666503703980605441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.673 × 10⁹⁵(96-digit number)
26737258716625325272…49333007407961210881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.347 × 10⁹⁵(96-digit number)
53474517433250650545…98666014815922421761
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,991,072 XPM·at block #6,843,338 · 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