Block #2,638,245

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 5:14:24 AM · Difficulty 11.4836 · 4,200,975 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9206d5ef126509b182545ac503299b1ab6e416b66f83ebd988ae0902531095da

Height

#2,638,245

Difficulty

11.483616

Transactions

10

Size

3.70 KB

Version

2

Bits

0b7bce45

Nonce

82,087,155

Timestamp

4/30/2018, 5:14:24 AM

Confirmations

4,200,975

Merkle Root

47605c41b5058a5f2268a5eceefea274df198d67ad5bad0d14d1296df8d52e7a
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.

4.557 × 10⁹³(94-digit number)
45574657530907339947…20460729251329007499
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
4.557 × 10⁹³(94-digit number)
45574657530907339947…20460729251329007499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.114 × 10⁹³(94-digit number)
91149315061814679895…40921458502658014999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.822 × 10⁹⁴(95-digit number)
18229863012362935979…81842917005316029999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.645 × 10⁹⁴(95-digit number)
36459726024725871958…63685834010632059999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.291 × 10⁹⁴(95-digit number)
72919452049451743916…27371668021264119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.458 × 10⁹⁵(96-digit number)
14583890409890348783…54743336042528239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.916 × 10⁹⁵(96-digit number)
29167780819780697566…09486672085056479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.833 × 10⁹⁵(96-digit number)
58335561639561395133…18973344170112959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.166 × 10⁹⁶(97-digit number)
11667112327912279026…37946688340225919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.333 × 10⁹⁶(97-digit number)
23334224655824558053…75893376680451839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.666 × 10⁹⁶(97-digit number)
46668449311649116106…51786753360903679999
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,958,043 XPM·at block #6,839,219 · 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