Block #1,458,597

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/15/2016, 7:38:40 PM · Difficulty 10.7664 · 5,351,874 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2fe484a95b99b0bde17a03a775a32ee53c8254683d23a10134481246047fa624

Height

#1,458,597

Difficulty

10.766395

Transactions

3

Size

3.89 KB

Version

2

Bits

0ac43274

Nonce

178,417,606

Timestamp

2/15/2016, 7:38:40 PM

Confirmations

5,351,874

Merkle Root

3c41f9f86178559a32bf45bc10197656e61fc025c636ec9ac88efb9fcd5b9271
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.

6.240 × 10⁹⁶(97-digit number)
62405607868049197262…16089935826450872319
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
6.240 × 10⁹⁶(97-digit number)
62405607868049197262…16089935826450872319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.248 × 10⁹⁷(98-digit number)
12481121573609839452…32179871652901744639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.496 × 10⁹⁷(98-digit number)
24962243147219678905…64359743305803489279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.992 × 10⁹⁷(98-digit number)
49924486294439357810…28719486611606978559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.984 × 10⁹⁷(98-digit number)
99848972588878715620…57438973223213957119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.996 × 10⁹⁸(99-digit number)
19969794517775743124…14877946446427914239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.993 × 10⁹⁸(99-digit number)
39939589035551486248…29755892892855828479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.987 × 10⁹⁸(99-digit number)
79879178071102972496…59511785785711656959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.597 × 10⁹⁹(100-digit number)
15975835614220594499…19023571571423313919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.195 × 10⁹⁹(100-digit number)
31951671228441188998…38047143142846627839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.390 × 10⁹⁹(100-digit number)
63903342456882377997…76094286285693255679
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,727,855 XPM·at block #6,810,470 · 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.

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