Block #2,657,341

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2018, 9:55:49 PM · Difficulty 11.6706 · 4,185,583 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0741b8601aa86adf5fec580d0c63c642f480b0be6fd52eb1a8e3b37eda718fe8

Height

#2,657,341

Difficulty

11.670615

Transactions

27

Size

8.27 KB

Version

2

Bits

0babad6f

Nonce

1,190,410,218

Timestamp

5/11/2018, 9:55:49 PM

Confirmations

4,185,583

Merkle Root

cd2d42118903db0a89c84406cad5022eb32d2ffa378f85a87b55e754b2bc2478
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.

8.143 × 10⁹⁴(95-digit number)
81432299560524276199…08591421895233473599
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
8.143 × 10⁹⁴(95-digit number)
81432299560524276199…08591421895233473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.628 × 10⁹⁵(96-digit number)
16286459912104855239…17182843790466947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.257 × 10⁹⁵(96-digit number)
32572919824209710479…34365687580933894399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.514 × 10⁹⁵(96-digit number)
65145839648419420959…68731375161867788799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.302 × 10⁹⁶(97-digit number)
13029167929683884191…37462750323735577599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.605 × 10⁹⁶(97-digit number)
26058335859367768383…74925500647471155199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.211 × 10⁹⁶(97-digit number)
52116671718735536767…49851001294942310399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.042 × 10⁹⁷(98-digit number)
10423334343747107353…99702002589884620799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.084 × 10⁹⁷(98-digit number)
20846668687494214706…99404005179769241599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.169 × 10⁹⁷(98-digit number)
41693337374988429413…98808010359538483199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.338 × 10⁹⁷(98-digit number)
83386674749976858827…97616020719076966399
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,987,740 XPM·at block #6,842,923 · 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