Block #2,638,646

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 8:48:54 AM · Difficulty 11.5024 · 4,201,966 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4626cdb24240c637e938ceda931d71578e5fc83f2dedbe0d214e431e38a4100b

Height

#2,638,646

Difficulty

11.502354

Transactions

8

Size

2.60 KB

Version

2

Bits

0b809a40

Nonce

377,891,679

Timestamp

4/30/2018, 8:48:54 AM

Confirmations

4,201,966

Merkle Root

48d41751ccc238571e58115ad5b9bbff45b1b7c8d3f2f85f1fb069c528478a34
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.

3.948 × 10⁹⁴(95-digit number)
39482377319887923529…72757643627396318719
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
3.948 × 10⁹⁴(95-digit number)
39482377319887923529…72757643627396318719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.896 × 10⁹⁴(95-digit number)
78964754639775847058…45515287254792637439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.579 × 10⁹⁵(96-digit number)
15792950927955169411…91030574509585274879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.158 × 10⁹⁵(96-digit number)
31585901855910338823…82061149019170549759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.317 × 10⁹⁵(96-digit number)
63171803711820677647…64122298038341099519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.263 × 10⁹⁶(97-digit number)
12634360742364135529…28244596076682199039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.526 × 10⁹⁶(97-digit number)
25268721484728271058…56489192153364398079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.053 × 10⁹⁶(97-digit number)
50537442969456542117…12978384306728796159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.010 × 10⁹⁷(98-digit number)
10107488593891308423…25956768613457592319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.021 × 10⁹⁷(98-digit number)
20214977187782616847…51913537226915184639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.042 × 10⁹⁷(98-digit number)
40429954375565233694…03827074453830369279
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,969,233 XPM·at block #6,840,611 · 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