Block #2,642,378

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2018, 5:16:18 PM · Difficulty 11.6509 · 4,189,681 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9b3fd399a7d83fd5671405b0de009258b99d39aee77a06c0c192e470e479b1b0

Height

#2,642,378

Difficulty

11.650866

Transactions

32

Size

9.74 KB

Version

2

Bits

0ba69f20

Nonce

30,882,582

Timestamp

5/1/2018, 5:16:18 PM

Confirmations

4,189,681

Merkle Root

9a9b32740970ab16fa3040c1b6c5feda95cab8f9d0bba87cc9ce0521a27f46b6
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.446 × 10⁹⁴(95-digit number)
44461464135533697394…26316961593925873909
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.446 × 10⁹⁴(95-digit number)
44461464135533697394…26316961593925873909
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.892 × 10⁹⁴(95-digit number)
88922928271067394788…52633923187851747819
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.778 × 10⁹⁵(96-digit number)
17784585654213478957…05267846375703495639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.556 × 10⁹⁵(96-digit number)
35569171308426957915…10535692751406991279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.113 × 10⁹⁵(96-digit number)
71138342616853915831…21071385502813982559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.422 × 10⁹⁶(97-digit number)
14227668523370783166…42142771005627965119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.845 × 10⁹⁶(97-digit number)
28455337046741566332…84285542011255930239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.691 × 10⁹⁶(97-digit number)
56910674093483132664…68571084022511860479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.138 × 10⁹⁷(98-digit number)
11382134818696626532…37142168045023720959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.276 × 10⁹⁷(98-digit number)
22764269637393253065…74284336090047441919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.552 × 10⁹⁷(98-digit number)
45528539274786506131…48568672180094883839
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,900,604 XPM·at block #6,832,058 · 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