Block #2,638,991

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2018, 12:02:32 PM · Difficulty 11.5171 · 4,197,922 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
89ed82d07483715b3e7eedab56ae6ee144568c6895ca5e91656ca74ee49a238f

Height

#2,638,991

Difficulty

11.517135

Transactions

4

Size

1.05 KB

Version

2

Bits

0b8462f7

Nonce

365,771,902

Timestamp

4/30/2018, 12:02:32 PM

Confirmations

4,197,922

Merkle Root

8694d0c89a44f353c66eb8dea5516bea25aa734d1871590a522d6e816858e61d
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.517 × 10⁹⁷(98-digit number)
15175745682566190844…23028317874575687681
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.517 × 10⁹⁷(98-digit number)
15175745682566190844…23028317874575687681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.035 × 10⁹⁷(98-digit number)
30351491365132381688…46056635749151375361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.070 × 10⁹⁷(98-digit number)
60702982730264763377…92113271498302750721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.214 × 10⁹⁸(99-digit number)
12140596546052952675…84226542996605501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.428 × 10⁹⁸(99-digit number)
24281193092105905350…68453085993211002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.856 × 10⁹⁸(99-digit number)
48562386184211810701…36906171986422005761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.712 × 10⁹⁸(99-digit number)
97124772368423621403…73812343972844011521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.942 × 10⁹⁹(100-digit number)
19424954473684724280…47624687945688023041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.884 × 10⁹⁹(100-digit number)
38849908947369448561…95249375891376046081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.769 × 10⁹⁹(100-digit number)
77699817894738897122…90498751782752092161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.553 × 10¹⁰⁰(101-digit number)
15539963578947779424…80997503565504184321
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,939,598 XPM·at block #6,836,912 · 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